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.
INFORMATION PROCESSING LETTERS (00400J0), 2005
Autori: B. Codenotti, D. Stefankovic
Autori IIT:
Tipo: Articoli su riviste ISI
Area di disciplina: Computer Science and Engineering
Da pagina 145 a pagina 150
Attività: Economia computazionale
- TELERISE 2018: Fourth Intl. Workshop on TEchnical and LEgal aspects of data pRIvacy and SEcurity, 2-5 September 2018
- CfP: STRIVE 2018 - First Intl. Workshop on Safety, securiTy, and pRivacy In automotiVe systEms
- IL CNR A BRUXELLES: STRATEGIE A SUPPORTO DELLA RETE SCIENTIFICA DA HORIZON 2020 A FP9, Auditorium CNR di Pisa, 25 Settembre 2018
- Premio "Franco Denoth"
