Imitation games and computation
type: Item
instance of: scholarly article
title: Imitation games and computation
zbMATH Open document ID: 1200.91013
author: Andrew McLennan
author: R. Tourky
published in: Games and Economic Behavior
publication date: 2010-09-20T00:00:00Z
Mathematics Subject Classification ID: 91A05
Mathematics Subject Classification ID: 91A10
Mathematics Subject Classification ID: 90C33
zbMATH DE Number: 5788956
zbMATH Keywords: computational economics
zbMATH Keywords: symmetric games
zbMATH Keywords: Nash equilibrium
zbMATH Keywords: computational complexity
zbMATH Keywords: two person games
zbMATH Keywords: 2-Nash
zbMATH Keywords: imitation games
zbMATH Keywords: Lemke-Howson algorithm
zbMATH Keywords: Lemke paths
MaRDI profile type: Publication
full work available at URL: j.geb.2009.08.003
OpenAlex ID: W2104647222
cites work: Q5801629
cites work: On the computational complexity of Nash equilibria for \((0,1)\) bimatrix games
cites work: New complexity results about Nash equilibria
cites work: Q4003375
cites work: The complexity of computing a Nash equilibrium
cites work: Q5801630
cites work: Nash and correlated equilibria: Some complexity considerations
cites work: Reducibility among equilibrium problems
cites work: Exponential lower bounds for finding Brouwer fixed points
cites work: Bimatrix Equilibrium Points and Mathematical Programming
cites work: Equilibrium Points of Bimatrix Games
cites work: Simple complexity from imitation games
cites work: Games in oriented matroids
cites work: On the expected number of linear complementarity cones intersected by random and semi-random rays
cites work: Lemke Paths on Simple Polytopes
cites work: Q4039868
cites work: Algorithmic Game Theory
cites work: Q3221403
cites work: Algorithms, games, and the internet
cites work: Q3524711
cites work: Simple search methods for finding a Nash equilibrium
cites work: Hard-to-Solve Bimatrix Games
cites work: Polynomial expected behavior of a pivoting algorithm for linear complementarity and linear programming problems
cites work: On the average speed of Lemke's algorithm for quadratic programming
DOI: 10.1016/J.GEB.2009.08.003
description: scientific article; zbMATH DE number 5788956