Imagen de Portada

Optimal Correlated Equilibria in General-Sum Extensive-Form Games: Fixed-Parameter Algorithms, Hardness, and Two-Sided Column-Generation

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autores principales:	Zhang, Brian, Farina, Gabriele, Celli, Andrea, Sandholm, Tuomas
Formato:	Preprint
Publicado:	2022
Materias:	Computer Science and Game Theory Artificial Intelligence Machine Learning
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

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

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

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

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

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

The Complexity of Correlated Equilibria in Generalized Games
por: Bernasconi, Martino, et al.
Publicado: (2025)

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

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

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

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

Watermarking Game-Playing Agents in Perfect-Information Extensive-Form Games
por: Kim, Juho, et al.
Publicado: (2026)

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

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

On the Complexity of the Optimal Correlated Equilibria in Extensive-Form Games
por: Cheval, Vincent, et al.
Publicado: (2025)

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

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

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

On the Optimality of Dilated Entropy and Lower Bounds for Online Learning in Extensive-Form Games
por: Fan, Zhiyuan, et al.
Publicado: (2024)

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

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

On the Power of Perturbation under Sampling in Solving Extensive-Form Games
por: Masaka, Wataru, et al.
Publicado: (2025)

Near-Optimal Quantum Algorithms for Computing (Coarse) Correlated Equilibria of General-Sum Games
por: Li, Tongyang, et al.
Publicado: (2025)

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

Polynomial-Time Computation of Exact $Φ$-Equilibria in Polyhedral Games
por: Farina, Gabriele, et al.
Publicado: (2024)

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

Improved Hardness Results for Min-Max Optimization with Coupled Constraints
por: Bernasconi, Martino, et al.
Publicado: (2024)

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

Characterization and Computation of Normal-Form Proper Equilibria in Extensive-Form Games via the Sequence-Form Representation
por: Hou, Yuqing, et al.
Publicado: (2026)

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

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

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

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

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

A Sequence-Form Characterization and Differentiable Path-Following Method for Computing Normal-Form Perfect Equilibria in Extensive-Form Games
por: Hou, Yuqing, et al.
Publicado: (2025)

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

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

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

Selecting Normal-Form Nash Equilibria in Extensive-Form Games via a Sequence-Form Variant of Logit Quantal Response Equilibrium
por: Hou, Yuqing
Publicado: (2026)

Efficient representations for team and imperfect-recall equilibrium computation
por: Carminati, Luca, et al.
Publicado: (2026)

Query-Efficient Algorithm to Find all Nash Equilibria in a Two-Player Zero-Sum Matrix Game
por: Maiti, Arnab, et al.
Publicado: (2023)