Nash equilibria: complexity, symmetries, and approximation

DOI10.1016/J.COSREV.2009.03.003MaRDI QIDQ458482zbMATH OpenOpenAlexFDO

Publication date 7 October 2014

Published in Computer Science Review (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.cosrev.2009.03.003

Research exposition (monographs, survey articles) pertaining to computer science (68-02) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Research exposition (monographs, survey articles) pertaining to game theory, economics, and finance (91-02) Noncooperative games (91A10) 2-person games (91A05)

Recommendations

Symmetries and the complexity of pure Nash equilibrium
Symmetries and the Complexity of Pure Nash Equilibrium
On the complexity of approximating a Nash equilibrium
scientific article; zbMATH DE number 6783488
The complexity of pure Nash equilibria
The complexity of computational problems about Nash equilibria in symmetric win-lose games
The complexity of finding Nash equilibria
On the Complexity of Nash Equilibria and Other Fixed Points
Approximations of Nash equilibria
The complexity of computing a Nash equilibrium

Cites work

scientific article; zbMATH DE number 3177183 (Why is no real title available?)
scientific article; zbMATH DE number 3637614 (Why is no real title available?)
scientific article; zbMATH DE number 3062452 (Why is no real title available?)
scientific article; zbMATH DE number 3062453 (Why is no real title available?)
scientific article; zbMATH DE number 3106184 (Why is no real title available?)
A note on approximate Nash equilibria
Algorithmic Game Theory
Algorithmic mechanism design (extended abstract)
An Efficient PTAS for Two-Strategy Anonymous Games
An optimization approach for approximate Nash equilibria
Approximate Nash equilibria in anonymous games
Computing Equilibria of N-Person Games
Computing equilibria in multi-player games
Congestion games with player-specific payoff functions
Equilibrium Points of Bimatrix Games
Exponential lower bounds for finding Brouwer fixed points
Nash and correlated equilibria: Some complexity considerations
New algorithms for approximate Nash equilibria in bimatrix games
New complexity results about Nash equilibria
Non-cooperative games
On a Generalization of the Lemke–Howson Algorithm to Noncooperative N-Person Games
On oblivious PTAS's for nash equilibrium
On the Complexity of Nash Equilibria and Other Fixed Points
On the complexity of the parity argument and other inefficient proofs of existence
On the computational complexity and geometry of the first-order theory of the reals. I: Introduction. Preliminaries. The geometry of semi-algebraic sets. The decision problem for the existential theory of the reals
On total functions, existence theorems and computational complexity
The Approximation of Fixed Points of a Continuous Mapping
The complexity of computing a Nash equilibrium
The women of Cairo: equilibria in large anonymous games

Cited in

(13)

Symmetries and the complexity of pure Nash equilibrium
A note on the symmetry of all Nash equilibria in games with increasing best replies
scientific article; zbMATH DE number 6783488 (Why is no real title available?)
scientific article; zbMATH DE number 6612107 (Why is no real title available?)
Symmetries and the Complexity of Pure Nash Equilibrium
On the complexity of Nash equilibria in anonymous games
ETR-completeness for decision versions of multi-player (symmetric) Nash equilibria
On the Complexity of Nash Equilibria and Other Fixed Points
Settling some open problems on 2-player symmetric Nash equilibria
Approximate equilibria in strongly symmetric games
scientific article; zbMATH DE number 7136658 (Why is no real title available?)
New complexity results about Nash equilibria
Nash Equilibria: Where We Stand

This page was built for publication: Nash equilibria: complexity, symmetries, and approximation

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q458482)