The complexity of computational problems about Nash equilibria in symmetric win-lose games
From MaRDI portal
Publication:2659767
DOI10.1007/s00453-020-00763-xOpenAlexW3087507622MaRDI QIDQ2659767
Vittorio Bilò, Marios Mavronicolas
Publication date: 26 March 2021
Published in: Algorithmica (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1907.10468
Related Items (2)
On the computational complexity of decision problems about multi-player Nash equilibria ⋮ (In)existence of equilibria for 2-player, 2-value games with semistrictly quasiconcave cost functions
Cites Work
- The complexity of equilibria for risk-modeling valuations
- Fixed points, Nash equilibria, and the existential theory of the reals
- The complexity of computing the permanent
- On total functions, existence theorems and computational complexity
- New complexity results about Nash equilibria
- The complexity of uniform Nash equilibria and related regular subgraph problems
- Imitation games and computation
- On the computational complexity of Nash equilibria for \((0,1)\) bimatrix games
- Nash and correlated equilibria: Some complexity considerations
- On the complexity of the parity argument and other inefficient proofs of existence
- Complexity of rational and irrational Nash equilibria
- Simple complexity from imitation games
- Non-cooperative games
- Some Tractable Win-Lose Games
- On the Complexity of Nash Equilibria and Other Fixed Points
- Settling Some Open Problems on 2-Player Symmetric Nash Equilibria
- Settling the complexity of computing two-player Nash equilibria
- Computing Exact and Approximate Nash Equilibria in 2-Player Games
- A symmetrization for finite two-person games
- A Catalog of EXISTS-R-Complete Decision Problems About Nash Equilibria in Multi-Player Games.
- Existential-R-Complete Decision Problems about Symmetric Nash Equilibria in Symmetric Multi-Player Games
- The Complexity of Computing a Nash Equilibrium
- A Polynomial Time Algorithm for Finding Nash Equilibria in Planar Win-Lose Games
- Algorithmic Game Theory
- Efficient Computation of Nash Equilibria for Very Sparse Win-Lose Bimatrix Games
- Computing and Combinatorics
- Equilibrium points in n -person games
- Contributions to the Theory of Games (AM-24), Volume I
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: The complexity of computational problems about Nash equilibria in symmetric win-lose games
