Copertina

On the Complexity of Learning Nash Equilibria

Fuente: arXiv

Salvato in:

Dettagli Bibliografici
Autori principali:	Biggar, Oliver, Papadimitriou, Christos, Piliouras, Georgios
Natura:	Preprint
Pubblicazione:	2026
Soggetti:	Computer Science and Game Theory Computational Complexity
Accesso online:	Acceder al recurso
Tags:	Aggiungi Tag Nessun Tag, puoi essere il primo ad aggiungerne!!

Documenti analoghi

Can Almost Everybody be Almost Happy? PCP for PPAD and the Inapproximability of Nash
di: Babichenko, Yakov, et al.
Pubblicazione: (2015)

Computing stable limit cycles of learning in games
di: Biggar, Oliver, et al.
Pubblicazione: (2026)

On the Complexity of Stationary Nash Equilibria in Discounted Perfect Information Stochastic Games
di: Hansen, Kristoffer Arnsfelt, et al.
Pubblicazione: (2025)

Sink equilibria and the attractors of learning in games
di: Biggar, Oliver, et al.
Pubblicazione: (2025)

Tight Inapproximability of Nash Equilibria in Public Goods Games
di: Dinh, Jérémi Do, et al.
Pubblicazione: (2024)

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

Approximating Nash Equilibria in Normal-Form Games via Stochastic Optimization
di: Gemp, Ian, et al.
Pubblicazione: (2023)

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

Hardness of Approximate Hylland-Zeckhauser Equilibria
di: Braverman, Mark, et al.
Pubblicazione: (2026)

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

On the Computation of Equilibria in Discrete First-Price Auctions
di: Filos-Ratsikas, Aris, et al.
Pubblicazione: (2024)

Constant Inapproximability of Pacing Equilibria in Second-Price Auctions
di: Chen, Xi, et al.
Pubblicazione: (2025)

Reducing the complexity of computing the values of a Nash equilibrium
di: Chatterjee, Debtoru, et al.
Pubblicazione: (2025)

Tight Inapproximability for Welfare-Maximizing Autobidding Equilibria
di: Anagnostides, Ioannis, et al.
Pubblicazione: (2026)

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

Robust Stackelberg Equilibria
di: Gan, Jiarui, et al.
Pubblicazione: (2023)

Swim till You Sink: Computing the Limit of a Game
di: Hakim, Rashida, et al.
Pubblicazione: (2024)

The Computational Complexity of the Housing Market
di: Lock, Edwin, et al.
Pubblicazione: (2024)

On the Smoothed Complexity of Combinatorial Local Search
di: Giannakopoulos, Yiannis, et al.
Pubblicazione: (2022)

The Complexity of Min-Max Optimization with Product Constraints
di: Bernasconi, Martino, et al.
Pubblicazione: (2026)

The Complexity of Symmetric Bimatrix Games with Common Payoffs
di: Ghosh, Abheek, et al.
Pubblicazione: (2024)

A Smoothed FPTAS for Equilibria in Congestion Games
di: Giannakopoulos, Yiannis
Pubblicazione: (2023)

Modelling Network Resilience: The Complexity of Some Graph Division Games
di: Gutowski, Grzegorz, et al.
Pubblicazione: (2026)

The Complexity of Pure Strategy Relevant Equilibria in Concurrent Games
di: Bhaduri, Purandar
Pubblicazione: (2025)

Complexity of Manipulation and Bribery in Premise-Based Judgment Aggregation with Simple Formulas
di: Bredereck, Robert, et al.
Pubblicazione: (2024)

Ex-post Stability under Two-Sided Matching: Complexity and Characterization
di: Aziz, Haris, et al.
Pubblicazione: (2024)

A Computational Analysis of Strategic Nominations: Modeling Equilibrium and Complexity in Organizational Elections
di: Lin, Chuang-Chieh, et al.
Pubblicazione: (2023)

The Randomized Query Complexity of Finding a Tarski Fixed Point on the Boolean Hypercube
di: Brânzei, Simina, et al.
Pubblicazione: (2024)

On the Tractability Landscape of the Conditional Minisum Approval Voting Rule
di: Amanatidis, Georgios, et al.
Pubblicazione: (2024)

Charting the Shapes of Stories with Game Theory
di: Daskalakis, Constantinos, et al.
Pubblicazione: (2024)

The Attractor of the Replicator Dynamic in Zero-Sum Games
di: Biggar, Oliver, et al.
Pubblicazione: (2023)

Complexity of Round-Robin Allocation with Potentially Noisy Queries
di: Li, Zihan, et al.
Pubblicazione: (2024)

Prediction Accuracy of Learning in Games : Follow-the-Regularized-Leader meets Heisenberg
di: Feng, Yi, et al.
Pubblicazione: (2024)

Nash Equilibria with Derangement Degree Probabilities
di: Orzech, Edan, et al.
Pubblicazione: (2026)

Randomness Requirements and Asymmetries in Nash Equilibria
di: Orzech, Edan, et al.
Pubblicazione: (2023)

Complexity of Stability in Trading Networks
di: Fleiner, Tamás, et al.
Pubblicazione: (2018)

The Complexity of Optimizing Atomic Congestion
di: Brand, Cornelius, et al.
Pubblicazione: (2023)

Structural Complexities of Matching Mechanisms
di: Gonczarowski, Yannai A., et al.
Pubblicazione: (2022)

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

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