Recent development in computational complexity characterization of Nash equilibrium
DOI10.1016/j.cosrev.2007.09.002zbMath1302.68135OpenAlexW1988766353MaRDI QIDQ458453
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.2007.09.002
Analysis of algorithms and problem complexity (68Q25) Noncooperative games (91A10) 2-person games (91A05) Research exposition (monographs, survey articles) pertaining to game theory, economics, and finance (91-02) Research exposition (monographs, survey articles) pertaining to computer science (68-02) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On total functions, existence theorems and computational complexity
- Simple search methods for finding a Nash equilibrium
- A note on approximate Nash equilibria
- Polynomial algorithms for approximating Nash equilibria of bimatrix games
- On the complexity of market equilibria with maximum social welfare
- How easy is local search?
- On equilibria in finite games
- An interior point potential reduction algorithm for the linear complementarity problem
- On the complexity of the parity argument and other inefficient proofs of existence
- Randomized pivot algorithms for \(P\)-matrix linear complementarity problems
- On the complexity of price equilibria
- Complementary pivot theory of mathematical programming
- Non-cooperative games
- The complexity of computing a Nash equilibrium
- Leontief economies encode nonzero sum two-player games
- Smoothed analysis of algorithms
- On the Complexity of 2D Discrete Fixed Point Problem
- The fundamental theorem of algebra and complexity theory
- Algorithmic Aspects of the Core of Combinatorial Optimization Games
- Algorithms, games, and the internet
- Equilibrium Points of Bimatrix Games
- The Logic of Animal Conflict
- Efficient Algorithms for Constant Well Supported Approximate Equilibria in Bimatrix Games
- Hard-to-Solve Bimatrix Games
- The Approximation of Fixed Points of a Continuous Mapping
- The Core of an N Person Game
- The Linear Complementarity Problem
- A Partition Theorem for Euclidean n-Space
- Equilibrium points in n -person games
- A Social Equilibrium Existence Theorem*
- Existence of an Equilibrium for a Competitive Economy
This page was built for publication: Recent development in computational complexity characterization of Nash equilibrium
