2 search results - page 1 / 1 » Enumerating the Nash equilibria of rank 1-games |
CORR
2007
Springer
13 years 4 months ago
2007
Springer
A bimatrix game (A, B) is called a game of rank k if the rank of the matrix A + B is at most k. We consider the problem of enumerating the Nash equilibria in
APPROX
2010
Springer
13 years 6 months ago
2010
Springer
Abstract. We study the fundamental problem of computing an arbitrary Nash equilibrium in bimatrix games. We start by proposing a novel characterization of the set of Nash equilibri...