Imagen de Portada

Faster Algorithms for the Least-Core value and the Nucleolus in Convex Games

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autores principales:	Maggiorano, Giacomo, Sosso, Alessandro, Stauffer, Gautier
Formato:	Preprint
Publicado:	2025
Materias:	Computer Science and Game Theory
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

On the Nucleolus of a Class of Linear Production Games
por: Baïou, Mourad, et al.
Publicado: (2022)

Nucleolus, Happy Nucleolus, and Vehicle Routing
por: Ebert, Daniel, et al.
Publicado: (2025)

Nucleolus Computation by Non-Zero-Constrained Optimization
por: Ebert, Daniel, et al.
Publicado: (2026)

On the Complexity of Nucleolus Computation for Bipartite b-Matching Games
por: Koenemann, Jochen, et al.
Publicado: (2021)

Cost Allocation for Set Covering: the Happy Nucleolus
por: Blauth, Jannis, et al.
Publicado: (2024)

Best-response Algorithms for Lattice Convex-Quadratic Simultaneous Games
por: Sankaranarayanan, Sriram
Publicado: (2024)

Mediator Interpretation and Faster Learning Algorithms for Linear Correlated Equilibria in General Extensive-Form Games
por: Zhang, Brian Hu, et al.
Publicado: (2023)

Faster Game Solving via Hyperparameter Schedules
por: Zhang, Naifeng, et al.
Publicado: (2024)

Faster Game Solving by Fixpoint Acceleration
por: Hausmann, Daniel
Publicado: (2024)

Learning the Expected Core of Strictly Convex Stochastic Cooperative Games
por: Tran, Nam Phuong, et al.
Publicado: (2024)

Convex-Concave Zero-sum Markov Stackelberg Games
por: Goktas, Denizalp, et al.
Publicado: (2024)

On the Core of the $b$-Matching Game
por: Gangam, Rohith Reddy, et al.
Publicado: (2025)

Actively Learning to Coordinate in Convex Games via Approximate Correlated Equilibrium
por: Fang, Zhenlong, et al.
Publicado: (2025)

Efficient Learning and Computation of Linear Correlated Equilibrium in General Convex Games
por: Daskalakis, Constantinos, et al.
Publicado: (2024)

Faster and Smaller Solutions of Obliging Games
por: Hausmann, Daniel, et al.
Publicado: (2024)

Pareto-Optimal Algorithms for Learning in Games
por: Arunachaleswaran, Eshwar Ram, et al.
Publicado: (2024)

Algorithmic Monetary Policies for Blockchain Participation Games
por: Ferraioli, Diodato, et al.
Publicado: (2025)

Polytime Algorithms for One-to-Many Matching Games
por: Garrido-Lucero, Felipe, et al.
Publicado: (2021)

On the Convergence of Learning Algorithms in Bayesian Auction Games
por: Bichler, Martin, et al.
Publicado: (2023)

Games on Graphs: A Time-Efficient Algorithm for Solving Finite Reachability and Safety Games
por: Giannetti, Christian
Publicado: (2024)

GUARD: Constructing Realistic Two-Player Matrix and Security Games for Benchmarking Game-Theoretic Algorithms
por: Krever, Noah, et al.
Publicado: (2025)

Fair Core Imputations for the Assignment Game: New Solution Concepts and Efficient Algorithms
por: Vazirani, Vijay V.
Publicado: (2024)

Equitable Core Imputations for Max-Flow, MST and $b$-Matching Games
por: Gangam, Rohith R., et al.
Publicado: (2024)

A Convex Formulation of Game-theoretic Hierarchical Routing
por: Lee, Dong Ho, et al.
Publicado: (2025)

A Distributed Clustering Algorithm based on Coalition Game for Intelligent Vehicles
por: Yang, Weiyi, et al.
Publicado: (2025)

Exponential Lower Bounds on the Double Oracle Algorithm in Zero-Sum Games
por: Zhang, Brian Hu, et al.
Publicado: (2024)

Distributed Algorithm for Robust Wardrop Equilibrium in Uncertain Aggregative Congestion Games
por: Peng, Huan, et al.
Publicado: (2026)

Deterministic Sub-exponential Algorithm for Discounted-sum Games with Unary Weights
por: Asadi, Ali, et al.
Publicado: (2024)

Concurrent Stochastic Games with Stateful-discounted and Parity Objectives: Complexity and Algorithms
por: Asadi, Ali, et al.
Publicado: (2024)

Polynomial-Time Algorithms for Computing the Nucleolus: An Assessment
por: Meinhardt, Holger I.
Publicado: (2025)

Faster Dynamic Auctions via Polymatroid Sum
por: Eickhoff, Katharina, et al.
Publicado: (2023)

Multi-Winner Voting Games in TU and NTU: When is the Core Always Non-Empty?
por: Chen, Jiehua, et al.
Publicado: (2026)

Incremental Data-Driven Policy Synthesis via Game Abstractions
por: Sağlam, Irmak, et al.
Publicado: (2025)

On Approximately Strategy-Proof Tournament Rules for Collusions of Size at Least Three
por: Mikšaník, David, et al.
Publicado: (2024)

Fixed-budget and Multiple-issue Quadratic Voting
por: Georgescu, Laura, et al.
Publicado: (2024)

Networked Digital Public Goods Games with Heterogeneous Players and Convex Costs
por: Cheng, Yukun, et al.
Publicado: (2025)

Game Theory in Social Media: A Stackelberg Model of Collaboration, Conflict, and Algorithmic Incentives
por: Khadka, Arjan
Publicado: (2025)

Inspection Game with Location-Specific Detection Capabilities: Exact and Approximate Algorithms for Strategic Resource Coordination
por: Bahamondes, Bastián, et al.
Publicado: (2024)

Toward a Sustainable Federated Learning Ecosystem: A Practical Least Core Mechanism for Payoff Allocation
por: Ni, Zhengwei, et al.
Publicado: (2026)

Monotone Near-Zero-Sum Games: A Generalization of Convex-Concave Minimax
por: Luo, Ruichen, et al.
Publicado: (2025)