Imitation games and computation
From MaRDI portal
Publication:993779
DOI10.1016/j.geb.2009.08.003zbMath1200.91013OpenAlexW2104647222MaRDI QIDQ993779
Publication date: 20 September 2010
Published in: Games and Economic Behavior (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.geb.2009.08.003
computational complexityNash equilibriumcomputational economicssymmetric gamesLemke-Howson algorithmtwo person games2-Nashimitation gamesLemke paths
Noncooperative games (91A10) 2-person games (91A05) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33)
Related Items (5)
A Direct Reduction from k-Player to 2-Player Approximate Nash Equilibrium ⋮ The complexity of computational problems about Nash equilibria in symmetric win-lose games ⋮ A Polynomial-Time Algorithm for 1/2-Well-Supported Nash Equilibria in Bimatrix Games ⋮ A Polynomial-Time Algorithm for 1/3-Approximate Nash Equilibria in Bimatrix Games ⋮ A repeated imitation model with dependence between stages: decision strategies and rewards
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Exponential lower bounds for finding Brouwer fixed points
- Games in oriented matroids
- New complexity results about Nash equilibria
- Simple search methods for finding a Nash equilibrium
- On the computational complexity of Nash equilibria for \((0,1)\) bimatrix games
- Nash and correlated equilibria: Some complexity considerations
- Simple complexity from imitation games
- Reducibility among equilibrium problems
- The complexity of computing a Nash equilibrium
- Lemke Paths on Simple Polytopes
- On the average speed of Lemke's algorithm for quadratic programming
- On the expected number of linear complementarity cones intersected by random and semi-random rays
- Polynomial expected behavior of a pivoting algorithm for linear complementarity and linear programming problems
- Algorithms, games, and the internet
- Equilibrium Points of Bimatrix Games
- Algorithmic Game Theory
- Hard-to-Solve Bimatrix Games
- Bimatrix Equilibrium Points and Mathematical Programming
This page was built for publication: Imitation games and computation