On the computational complexity of Nash equilibria for (0,1) bimatrix games

  • Codenotti B
  • Štefankovič D
  • 2

    Readers

    Mendeley users who have this article in their library.
  • 21

    Citations

    Citations of this article.

Abstract

The computational complexity of finding a Nash equilibrium in a nonzero sum bimatrix game is an important open question. We put forward the notion of (0,1)-bimatrix games, and show that some associated computational problems are as hard as in the general case. © 2005 Elsevier B.V. All rights reserved.

Author-supplied keywords

  • Bimatrix games
  • Computational complexity
  • Imitation games
  • NP-completeness
  • Nash equilibrium

Get free article suggestions today

Mendeley saves you time finding and organizing research

Sign up here
Already have an account ?Sign in

Find this document

Authors

  • Bruno Codenotti

  • Daniel Štefankovič

Cite this document

Choose a citation style from the tabs below

Save time finding and organizing research with Mendeley

Sign up for free