Enumerating the Nash equilibria of rank 1-games

Simple item page
dc.creatorTheobald, Thorsten
dc.date2007-09-09
dc.date.accessioned2026-07-07T08:28:26Z
dc.date.available2026-07-07T08:28:26Z
dc.descriptionA 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 (non-degenerate) games of rank 1. In particular, we show that even for games of rank 1 not all equilibria can be reached by a Lemke-Howson path and present a parametric simplex-type algorithm for enumerating all Nash equilibria of a non-degenerate game of rank 1.
dc.description15 pages
dc.identifierhttps://arxiv.org/abs/0709.1263
dc.identifierhttp://arxiv.org/abs/0709.1263
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/137616
dc.subjectComputer Science and Game Theory
dc.subjectOptimization and Control
dc.titleEnumerating the Nash equilibria of rank 1-games
dc.typetext

Files

Collections

arXiv