IIT Home Page CNR Home Page

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

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.


Authors: B. Codenotti, D. Stefankovic
IIT authors:

Type: Article in ISI Journal
Field of reference: Computer Science and Engineering
Da pagina 145 a pagina 150

Activity: Economia computazionale