"On the computational complexity of Nash equilibria for (0, 1) bimatrix games."

Bruno Codenotti, Daniel Stefankovic (2005)

> Home

Details and statistics

DOI: 10.1016/J.IPL.2005.01.010

access: closed

type: Journal Article

metadata version: 2019-10-19

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/ipl/CodenottiS05
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/ipl/CodenottiS05
Bruno Codenotti, Daniel Stefankovic:
On the computational complexity of Nash equilibria for (0, 1) bimatrix games. Inf. Process. Lett. 94(3): 145-150 (2005)

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.