|
Title:
|
Complexity of finding Nash equilibria in 0-1 bimatrix games |
|
Author:
|
Abbott, Tim; Kane, Daniel; Valiant, Paul |
|
Other Contributors:
|
Cryptography and Information Security |
|
Issue Date:
|
2005-02-08 |
|
Abstract:
|
We exhibit a polynomial reduction from the problem of finding a Nashequilibrium of a bimatrix game with rational coefficients to the problemof finding a Nash equilibrium of a bimatrix game with 0-1 coefficients. |
|
URI:
|
http://hdl.handle.net/1721.1/30523
|
|
Other Identifiers:
|
MIT-CSAIL-TR-2005-010
MIT-LCS-TM-648 |
|
Series/Report no.:
|
Massachusetts Institute of Technology Computer Science and Artificial Intelligence Laboratory |
