Games of fixed rank: a hierarchy of bimatrix games

DOI10.1007/s00199-009-0436-2zbMath1202.91007arXivcs/0511021OpenAlexW3136147237MaRDI QIDQ847799

Thorsten Theobald, Ravindran Kannan

Publication date: 19 February 2010

Published in: Economic Theory (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/cs/0511021

zbMATH Keywords

approximationNash equilibriumbimarix gamefixed rank

Mathematics Subject Classification ID

2-person games (91A05) Approximation algorithms (68W25) Spaces of games (91A70)

Related Items

Settling Some Open Problems on 2-Player Symmetric Nash Equilibria, Computing equilibria: a computational complexity perspective, Constant Rank Two-Player Games are PPAD-hard, A Glimpse at Paul G. Spirakis, Approximating Nash Equilibria and Dense Subgraphs via an Approximate Version of Carathéodory's Theorem, A Polynomial-Time Algorithm for 1/2-Well-Supported Nash Equilibria in Bimatrix Games, Detection thresholds in very sparse matrix completion, A Polynomial-Time Algorithm for 1/3-Approximate Nash Equilibria in Bimatrix Games, On mutual concavity and strategically-zero-sum bimatrix games, Parameterized two-player Nash equilibrium, Nash equilibria: complexity, symmetries, and approximation, Well supported approximate equilibria in bimatrix games, Separable and low-rank continuous games, A note on approximate Nash equilibria, The discrete yet ubiquitous theorems of Carathéodory, Helly, Sperner, Tucker, and Tverberg, Fast Algorithms for Rank-1 Bimatrix Games, Unnamed Item

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Approximation algorithms for indefinite quadratic programming
• Polynomial algorithms for approximating Nash equilibria of bimatrix games
• Generic \(4\times 4\) two person games have at most 15 Nash equilibria
• New maximal numbers of equilibria in bimatrix games
• On the complexity of the parity argument and other inefficient proofs of existence
• On the maximal number of Nash equilibria in an \(n\times n\) bimatrix game
• A bound on the number of Nash equilibria in a coordination game.
• Non-cooperative games
• Matrix Analysis
• On a class of nash-solvable bimatrix games and some related nash subsets
• Algorithms, games, and the internet
• Equilibrium Points of Bimatrix Games
• Equilibrium Points of Bimatrix Games
• Computing Normal Form Perfect Equilibria for Extensive Two-Person Games
• Equilibrium points in n -person games