Cover Image

The Complexity of Equilibrium Refinements in Potential Games

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Anagnostides, Ioannis, Balcan, Maria-Florina, Fragkia, Kiriaki, Sandholm, Tuomas, Tewolde, Emanuel, Zhang, Brian Hu
Format:	Preprint
Published:	2025
Subjects:	Computer Science and Game Theory
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

The Complexity of Proper Equilibrium in Extensive-Form and Polytope Games
by: Zhang, Brian Hu, et al.
Published: (2026)

Learning in Structured Stackelberg Games
by: Balcan, Maria-Florina, et al.
Published: (2025)

Convergence of Regret Matching in Potential Games and Constrained Optimization
by: Anagnostides, Ioannis, et al.
Published: (2025)

Convergence of $\text{log}(1/ε)$ for Gradient-Based Algorithms in Zero-Sum Games without the Condition Number: A Smoothed Analysis
by: Anagnostides, Ioannis, et al.
Published: (2024)

(Doubly) Exponential Lower Bounds for Follow the Regularized Leader in Potential Games
by: Anagnostides, Ioannis, et al.
Published: (2026)

Scale-Invariant Regret Matching and Online Learning with Optimal Convergence: Bridging Theory and Practice in Zero-Sum Games
by: Zhang, Brian Hu, et al.
Published: (2025)

On the Interplay between Social Welfare and Tractability of Equilibria
by: Anagnostides, Ioannis, et al.
Published: (2023)

Efficient $Φ$-Regret Minimization with Low-Degree Swap Deviations in Extensive-Form Games
by: Zhang, Brian Hu, et al.
Published: (2024)

The Complexity of Symmetric Equilibria in Min-Max Optimization and Team Zero-Sum Games
by: Anagnostides, Ioannis, et al.
Published: (2025)

On the Complexity of Correlated Equilibria Beyond Normal-Form Games
by: Anagnostides, Ioannis, et al.
Published: (2026)

Computational Lower Bounds for Regret Minimization in Normal-Form Games
by: Anagnostides, Ioannis, et al.
Published: (2024)

Revenue-Optimal Efficient Mechanism Design with General Type Spaces
by: Prasad, Siddharth, et al.
Published: (2025)

Bicriteria Multidimensional Mechanism Design with Side Information
by: Balcan, Maria-Florina, et al.
Published: (2023)

Learning and Computation of $Φ$-Equilibria at the Frontier of Tractability
by: Zhang, Brian Hu, et al.
Published: (2025)

Weakest Bidder Types and New Core-Selecting Combinatorial Auctions
by: Prasad, Siddharth, et al.
Published: (2025)

Equilibrium Refinements Improve Subgame Solving in Imperfect-Information Games
by: Kubicek, Ondrej, et al.
Published: (2026)

Barriers to Welfare Maximization with No-Regret Learning
by: Anagnostides, Ioannis, et al.
Published: (2024)

Expected Variational Inequalities
by: Zhang, Brian Hu, et al.
Published: (2025)

A Polynomial-Time Algorithm for Variational Inequalities under the Minty Condition
by: Anagnostides, Ioannis, et al.
Published: (2025)

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

Hidden-Role Games: Equilibrium Concepts and Computation
by: Carminati, Luca, et al.
Published: (2023)

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

Steering No-Regret Learners to a Desired Equilibrium
by: Zhang, Brian Hu, et al.
Published: (2023)

Team Belief DAG: Generalizing the Sequence Form to Team Games for Fast Computation of Correlated Team Max-Min Equilibria via Regret Minimization
by: Zhang, Brian Hu, et al.
Published: (2022)

On the Outcome Equivalence of Extensive-Form and Behavioral Correlated Equilibria
by: Zhang, Brian Hu, et al.
Published: (2024)

Learning a Game by Paying the Agents
by: Zhang, Brian Hu, et al.
Published: (2025)

Beyond Symmetry in Repeated Games with Restarts
by: Fleischmann, Henry, et al.
Published: (2025)

Solving Infinite-Player Games with Player-to-Strategy Networks
by: Martin, Carlos, et al.
Published: (2025)

Position: Machine Learning for Heart Transplant Allocation Policy Optimization Should Account for Incentives
by: Anagnostides, Ioannis, et al.
Published: (2026)

Computing Optimal Equilibria and Mechanisms via Learning in Zero-Sum Extensive-Form Games
by: Zhang, Brian Hu, et al.
Published: (2023)

Verifying Approximate Equilibrium in Auctions
by: Pieroth, Fabian R., et al.
Published: (2024)

General search techniques without common knowledge for imperfect-information games, and application to superhuman Fog of War chess
by: Zhang, Brian Hu, et al.
Published: (2025)

The Value of Recall in Extensive-Form Games
by: Berker, Ratip Emin, et al.
Published: (2024)

A Lower Bound on Swap Regret in Extensive-Form Games
by: Daskalakis, Constantinos, et al.
Published: (2024)

Regret Minimization in Stackelberg Games with Side Information
by: Harris, Keegan, et al.
Published: (2024)

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

The Active and Noise-Tolerant Strategic Perceptron
by: Balcan, Maria-Florina, et al.
Published: (2025)

New Guarantees for Learning Revenue Maximizing Menus of Lotteries and Two-Part Tariffs
by: Balcan, Maria-Florina, et al.
Published: (2023)

Domain-Independent Game Abstraction using Word Embedding Techniques
by: Kim, Juho, et al.
Published: (2026)

Decision Making under Imperfect Recall: Algorithms and Benchmarks
by: Tewolde, Emanuel, et al.
Published: (2026)