Repository logo
Log in(current)
Repository logoMIT Open ScholarshipDSpace@MIT
  1. Home
  2. Computer Science and Artificial Intelligence Lab (CSAIL)
  3. CSAIL Digital Archive
  4. CSAIL Technical Reports (July 1, 2003 - present)
  5. Complexity of finding Nash equilibria in 0-1 bimatrix games

Complexity of finding Nash equilibria in 0-1 bimatrix games

Thumbnail Image
Download
Name

MIT-CSAIL-TR-2005-010.ps

Size

6.2 MB

Format

PostScript

Checksum (MD5)

e75112df3023cc6c029f86bfc2f531f1

Thumbnail Image
Download
Name

MIT-CSAIL-TR-2005-010.pdf

Size

328.61 KB

Format

Adobe PDF

Checksum (MD5)

e47dad0babd635f34108018cb632bea2

Author(s)
Abbott, Tim
•
Kane, Daniel
•
Valiant, Paul
Date Issued
February 8, 2005
Series/Report no.
Massachusetts Institute of Technology Computer Science and Artificial Intelligence Laboratory
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.
Persistent DSpace Link
http://hdl.handle.net/1721.1/30523
Repository logo
PrivacyPermissionsAccessibilityContact us
Repository logo
Notify us about copyright concerns.