Cover Image

On the Complexity of Stationary Nash Equilibria in Discounted Perfect Information Stochastic Games

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Hansen, Kristoffer Arnsfelt, Nie, Xinhao
Format:	Preprint
Published:	2025
Subjects:	Computer Science and Game Theory Computational Complexity
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

On the Complexity of Learning Nash Equilibria
by: Biggar, Oliver, et al.
Published: (2026)

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

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

Stochastic Games with Limited Public Memory
by: Hansen, Kristoffer Arnsfelt, et al.
Published: (2025)

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

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

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

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

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

Improved Hardness Results for the Clearing Problem in Financial Networks with Credit Default Swaps
by: Dohn, Simon, et al.
Published: (2024)

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

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

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

A Smoothed FPTAS for Equilibria in Congestion Games
by: Giannakopoulos, Yiannis
Published: (2023)

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

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

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

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

Robust Stackelberg Equilibria
by: Gan, Jiarui, et al.
Published: (2023)

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

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

The Complexity of Sparse Win-Lose Bimatrix Games
by: Batziou, Eleni, et al.
Published: (2026)

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

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

The Complexity of Stackelberg Pricing Games
by: Grüne, Christoph, et al.
Published: (2025)

The Complexity of Graph Exploration Games
by: Fuchs, Janosch, et al.
Published: (2023)

Solving Four Open Problems about Core Stability in Altruistic Hedonic Games
by: Rothe, Jörg, et al.
Published: (2025)

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

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

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

Simple Stochastic Stopping Games: A Generator and Benchmark Library
by: Rudich, Avi, et al.
Published: (2024)

Arena-Independent Memory Bounds for Nash Equilibria in Reachability Games
by: Main, James C. A.
Published: (2023)

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

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

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

Control by Adding Players to Change or Maintain the Shapley-Shubik or the Penrose-Banzhaf Power Index in Weighted Voting Games Is Complete for NP^PP
by: Kaczmarek, Joanna, et al.
Published: (2024)

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

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

Nash Equilibria via Stochastic Eigendecomposition
by: Gemp, Ian
Published: (2024)

On the Complexity of Nucleolus Computation for Bipartite b-Matching Games
by: Koenemann, Jochen, et al.
Published: (2021)