Publication Date:
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.
Iris type:
01.01 Articolo in rivista
List of contributors:
Codenotti, Bruno
Published in: