Rank-1 Games With Exponentially Many Nash Equilibria
Computer Science and Game Theory
2012-11-13 v1
Abstract
The rank of a bimatrix game (A,B) is the rank of the matrix A+B. We give a construction of rank-1 games with exponentially many equilibria, which answers an open problem by Kannan and Theobald (2010).
Keywords
Cite
@article{arxiv.1211.2405,
title = {Rank-1 Games With Exponentially Many Nash Equilibria},
author = {Bernhard von Stengel},
journal= {arXiv preprint arXiv:1211.2405},
year = {2012}
}
Comments
4 pages