Imagen de Portada

Steering No-Regret Learners to a Desired Equilibrium

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autores principales:	Zhang, Brian Hu, Farina, Gabriele, Anagnostides, Ioannis, Cacciamani, Federico, McAleer, Stephen Marcus, Haupt, Andreas Alexander, Celli, Andrea, Gatti, Nicola, Conitzer, Vincent, Sandholm, Tuomas
Formato:	Preprint
Publicado:	2023
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

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

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

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

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

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

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

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)

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

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 Interplay between Social Welfare and Tractability of Equilibria
por: Anagnostides, Ioannis, et al.
Publicado: (2023)

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

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

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

Expected Variational Inequalities
por: Zhang, Brian Hu, et al.
Publicado: (2025)

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)

Optimal Correlated Equilibria in General-Sum Extensive-Form Games: Fixed-Parameter Algorithms, Hardness, and Two-Sided Column-Generation
por: Zhang, Brian, et al.
Publicado: (2022)

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

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

The Complexity of Equilibrium Refinements in Potential Games
por: Anagnostides, Ioannis, et al.
Publicado: (2025)

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

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

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

Algorithms and Complexity for Computing Nash Equilibria in Adversarial Team Games
por: Anagnostides, Ioannis, et al.
Publicado: (2023)

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

Parallelizing Counterfactual Regret Minimization
por: Kim, Juho, et al.
Publicado: (2026)

Automated Design of Affine Maximizer Mechanisms in Dynamic Settings
por: Curry, Michael, et al.
Publicado: (2024)

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

Sample-Efficient Regret-Minimizing Double Oracle in Extensive-Form Games
por: Tang, Xiaohang, et al.
Publicado: (2024)

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

Multi-Agent Contract Design beyond Binary Actions
por: Cacciamani, Federico, et al.
Publicado: (2024)

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

Scalable Mechanism Design for Multi-Agent Path Finding
por: Friedrich, Paul, et al.
Publicado: (2024)

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

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

On the Outcome Equivalence of Extensive-Form and Behavioral Correlated Equilibria
por: Zhang, Brian Hu, 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)

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

Simultaneous incremental support adjustment and metagame solving: An equilibrium-finding framework for continuous-action games
por: Martin, Carlos, et al.
Publicado: (2024)

The Complexity of Computing Robust Mediated Equilibria in Ordinal Games
por: Conitzer, Vincent
Publicado: (2024)