Imagen de Portada

Polynomial-Time Computation of Exact $Φ$-Equilibria in Polyhedral Games

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autores principales:	Farina, Gabriele, Pipis, Charilaos
Formato:	Preprint
Publicado:	2024
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

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

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

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)

Efficient Kernelized Learning in Polyhedral Games Beyond Full-Information: From Colonel Blotto to Congestion Games
por: Kontogiannis, Andreas, et al.
Publicado: (2025)

On Tractable $Φ$-Equilibria in Non-Concave Games
por: Cai, Yang, 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)

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

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

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

An Efficient Black-Box Reduction from Online Learning to Multicalibration, and a New Route to $Φ$-Regret Minimization
por: Farina, Gabriele, et al.
Publicado: (2026)

Computing Equilibria in Games with Stochastic Action Sets
por: Schwarz, Thomas, et al.
Publicado: (2026)

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

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

Computing Nash Equilibria in Potential Games with Private Uncoupled Constraints
por: Patris, Nikolas, et al.
Publicado: (2024)

Efficiently Computing Equilibria in Budget-Aggregation Games
por: Becker, Patrick, et al.
Publicado: (2025)

On Altruism and Spite in Bimatrix Games
por: Fasoulakis, Michail, et al.
Publicado: (2025)

Computing Perfect Bayesian Equilibria, with Application to Empirical Game-Theoretic Analysis
por: Konicki, Christine, et al.
Publicado: (2026)

Likelihood Equilibria in the Ising Game
por: Leonidov, Andrey
Publicado: (2024)

Permissive Equilibria in Multiplayer Reachability Games
por: Goeminne, Aline, et al.
Publicado: (2024)

Equilibria of the Colonel Blotto Games with Costs
por: Kaźmierowski, Stanisław
Publicado: (2024)

Equilibria in Large Position-Optimization Games
por: Frongillo, Rafael, 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)

Nash Equilibria in Reverse Temporal Voronoi Games
por: Pawlowski, Simeon, et al.
Publicado: (2024)

On the Uniqueness of Nash Equilibria in Multiagent Matrix Games
por: Bailey, James P.
Publicado: (2024)

Verification of Correlated Equilibria in Concurrent Reachability Games
por: Rajasekaran, Senthil, et al.
Publicado: (2026)

Symbolic Computation of Sequential Equilibria
por: Graf, Moritz, et al.
Publicado: (2024)

Learning Equilibria in Coordination Games via Minorization-Maximization
por: S., Ashok Krishnan K., et al.
Publicado: (2026)

Strong Equilibria in Bayesian Games with Bounded Group Size
por: Han, Qishen, et al.
Publicado: (2025)

Value-Set Iteration: Computing Optimal Correlated Equilibria in Infinite-Horizon Multi-Player Stochastic Games
por: Gan, Jiarui, 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)

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

Most General Winning Secure Equilibria Synthesis in Graph Games
por: Nayak, Satya Prakash, et al.
Publicado: (2024)

Subgame-perfect Equilibria in Mean-payoff Games (journal version)
por: Brice, Léonard, et al.
Publicado: (2022)

Arena-Independent Memory Bounds for Nash Equilibria in Reachability Games
por: Main, James C. A.
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)

The Cut-and-Play Algorithm: Computing Nash Equilibria via Outer Approximations
por: Carvalho, Margarida, et al.
Publicado: (2021)

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

Gamu Blue: A Practical Tool for Game Theory Security Equilibria
por: Taweel, Ameer, et al.
Publicado: (2024)

ε-Stationary Nash Equilibria in Multi-player Stochastic Graph Games
por: Asadi, Ali, et al.
Publicado: (2025)