A Direct Reduction from k-Player to 2-Player Approximate Nash Equilibrium
From MaRDI portal
Publication:3162514
DOI10.1007/978-3-642-16170-4_13zbMath1310.91011arXiv1007.3886OpenAlexW3136904094MaRDI QIDQ3162514
Publication date: 19 October 2010
Published in: Algorithmic Game Theory (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1007.3886
Analysis of algorithms and problem complexity (68Q25) Noncooperative games (91A10) 2-person games (91A05) (n)-person games, (n>2) (91A06) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)
Related Items (1)
Cites Work
- Unnamed Item
- A decomposition algorithm for \(N\)-player games
- Computing equilibria: a computational complexity perspective
- Well supported approximate equilibria in bimatrix games
- Imitation games and computation
- A note on approximate Nash equilibria
- On equilibria in finite games
- On the complexity of the parity argument and other inefficient proofs of existence
- Non-cooperative games
- Reducibility among equilibrium problems
- How Hard Is It to Approximate the Best Nash Equilibrium?
- On the Complexity of Nash Equilibria and Other Fixed Points
- An Optimization Approach for Approximate Nash Equilibria
- On the Complexity of 2D Discrete Fixed Point Problem
- The Game World Is Flat: The Complexity of Nash Equilibria in Succinct Games
- On the Computation of Fixed Points in the Product Space of Unit Simplices and an Application to Noncooperative N Person Games
- On oblivious PTAS's for nash equilibrium
- The Complexity of Computing a Nash Equilibrium
- Equilibrium Points of Bimatrix Games
This page was built for publication: A Direct Reduction from k-Player to 2-Player Approximate Nash Equilibrium
