http://www.cnr.it/ontology/cnr/individuo/prodotto/ID29903
On the Computational Complexity of Nash Equilibria for (0,1) Bimatrix Games (Articolo in rivista)
- Type
- Label
- On the Computational Complexity of Nash Equilibria for (0,1) Bimatrix Games (Articolo in rivista) (literal)
- Anno
- 2005-01-01T00:00:00+01:00 (literal)
- Alternative label
- Http://www.cnr.it/ontology/cnr/pubblicazioni.owl#autori
- B. Codenotti, D. Stefankovic (literal)
- Pagina inizio
- Pagina fine
- Http://www.cnr.it/ontology/cnr/pubblicazioni.owl#numeroVolume
- Rivista
- Note
- ISI Web of Science (WOS) (literal)
- Http://www.cnr.it/ontology/cnr/pubblicazioni.owl#affiliazioni
- IIT, CNR, Pisa,
Department of Computer Science, Comenius University, Bratislava, Slovakia
(literal)
- Titolo
- On the Computational Complexity of Nash Equilibria for (0,1) Bimatrix Games (literal)
- 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. (literal)
- Prodotto di
- Autore CNR
Incoming links:
- Prodotto
- Autore CNR di
- Http://www.cnr.it/ontology/cnr/pubblicazioni.owl#rivistaDi