Browsing Computer Science and Artificial Intelligence Lab (CSAIL) by Author "Abbott, Tim"

Now showing items 1-1 of 1

    • Complexity of finding Nash equilibria in 0-1 bimatrix games 

      Abbott, Tim; Kane, Daniel; Valiant, Paul (2005-02-08)
      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.