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.

On the Computational Complexity of Nash Equilibria for (0,1) Bimatrix Games

B Codenotti;
2005

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
Istituto di informatica e telematica - IIT
File in questo prodotto:
Non ci sono file associati a questo prodotto.

I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.

Utilizza questo identificativo per citare o creare un link a questo documento: https://hdl.handle.net/20.500.14243/46152
Citazioni
  • ???jsp.display-item.citation.pmc??? ND
  • Scopus ND
  • ???jsp.display-item.citation.isi??? ND
social impact