Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
10331991 | Information Processing Letters | 2005 | 6 Pages |
Abstract
The computational complexity of finding a Nash equilibrium in a nonzero sum bimatrix game is an important open question. We put forward the notion of (0,1)-bimatrix games, and show that some associated computational problems are as hard as in the general case.
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
Authors
Bruno Codenotti, Daniel Å tefankoviÄ,