Imitation games and computation

DOI10.1016/J.GEB.2009.08.003MaRDI QIDQ993779zbMATH OpenOpenAlexFDO

Authors Andrew McLennan, R. Tourky

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

zbMATH Keywords

computational complexityNash equilibriumcomputational economicssymmetric gamesLemke-Howson algorithmtwo person games2-Nashimitation gamesLemke paths

Mathematics Subject Classification ID

Noncooperative games (91A10) 2-person games (91A05) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33)

Recommendations

• Simple complexity from imitation games
• Unit vector games
• Unbeatable imitation
• Imitation, coordination and the emergence of Nash equilibrium
• Equilibrium computation for two-player games in strategic and extensive form

Cites work

• scientific article; zbMATH DE number 3888913 (Why is no real title available?)
• scientific article; zbMATH DE number 53115 (Why is no real title available?)
• scientific article; zbMATH DE number 192986 (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?)
• Algorithmic Game Theory
• Algorithms, games, and the internet
• Bimatrix Equilibrium Points and Mathematical Programming
• Equilibrium Points of Bimatrix Games
• Exponential lower bounds for finding Brouwer fixed points
• Games in oriented matroids
• Hard-to-Solve Bimatrix Games
• Lemke Paths on Simple Polytopes
• Nash and correlated equilibria: Some complexity considerations
• New complexity results about Nash equilibria
• On the average speed of Lemke's algorithm for quadratic programming
• On the computational complexity of Nash equilibria for \((0,1)\) bimatrix games
• 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
• Reducibility among equilibrium problems
• Simple complexity from imitation games
• Simple search methods for finding a Nash equilibrium
• The complexity of computing a Nash equilibrium
• The complexity of finding Nash equilibria

Cited in

(9)

• A Polynomial-Time Algorithm for 1/3-Approximate Nash Equilibria in Bimatrix Games
• A direct reduction from \(k\)-player to 2-player approximate Nash equilibrium
• Simple complexity from imitation games
• A repeated imitation model with dependence between stages: decision strategies and rewards
• 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
• Imitation games
• Computational ability in games: individual difference and dynamics
• Unit vector games

This page was built for publication: Imitation games and computation

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