Enumerating the Nash equilibria of rank 1-games

Details Enumerating the Nash equilibria of rank 1-games Enumerating the Nash equilibria of rank 1-games

2007-09-09

arxiv.org/abs/0709.1263v1

Computer Science

Computer Science and Game Theory

15 pages

Scientific paper

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 (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.

Affiliated with

Also associated with

No associations

Rating

Enumerating the Nash equilibria of rank 1-games does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Enumerating the Nash equilibria of rank 1-games, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Enumerating the Nash equilibria of rank 1-games will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-631603