| dc.contributor.author |
Abbott, Tim |
|
| dc.contributor.author |
Kane, Daniel |
|
| dc.contributor.author |
Valiant, Paul |
|
| dc.contributor.other |
Cryptography and Information Security |
|
| dc.date.accessioned |
2005-12-22T02:24:28Z |
|
| dc.date.available |
2005-12-22T02:24:28Z |
|
| dc.date.issued |
2005-02-08 |
|
| dc.identifier.other |
MIT-CSAIL-TR-2005-010 |
|
| dc.identifier.other |
MIT-LCS-TM-648 |
|
| dc.identifier.uri |
http://hdl.handle.net/1721.1/30523 |
|
| dc.description.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. |
|
| dc.description.provenance |
Made available in DSpace on 2005-12-22T02:24:28Z (GMT). No. of bitstreams: 2
MIT-CSAIL-TR-2005-010.ps: 6499249 bytes, checksum: e75112df3023cc6c029f86bfc2f531f1 (MD5)
MIT-CSAIL-TR-2005-010.pdf: 336493 bytes, checksum: e47dad0babd635f34108018cb632bea2 (MD5) |
en |
| dc.format.extent |
6 p. |
|
| dc.format.extent |
6499249 bytes |
|
| dc.format.extent |
336493 bytes |
|
| dc.format.mimetype |
application/postscript |
|
| dc.format.mimetype |
application/pdf |
|
| dc.language.iso |
en_US |
|
| dc.relation.ispartofseries |
Massachusetts Institute of Technology Computer Science and Artificial Intelligence Laboratory |
|
| dc.title |
Complexity of finding Nash equilibria in 0-1 bimatrix games |
|
