Complexity of finding Nash equilibria in 0-1 bimatrix games
| dc.date.accessioned | 2005-12-22T02:24:28Z | |
| dc.date.accessioned | 2018-11-24T10:24:23Z | |
| dc.date.available | 2005-12-22T02:24:28Z | |
| dc.date.available | 2018-11-24T10:24:23Z | |
| dc.date.issued | 2005-02-08 | |
| dc.identifier.uri | http://hdl.handle.net/1721.1/30523 | |
| dc.identifier.uri | http://repository.aust.edu.ng/xmlui/handle/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.format.extent | 6 p. | |
| dc.format.extent | 6499249 bytes | |
| dc.format.extent | 336493 bytes | |
| dc.language.iso | en_US | |
| dc.title | Complexity of finding Nash equilibria in 0-1 bimatrix games |
Files in this item
| Files | Size | Format | View |
|---|---|---|---|
| MIT-CSAIL-TR-2005-010.pdf | 336.4Kb | application/pdf | View/ |
| MIT-CSAIL-TR-2005-010.ps | 6.499Mb | application/postscript | View/ |