"The Computational Complexity of Nash Equilibria in Concisely Represented ..."

Grant Schoenebeck, Salil P. Vadhan (2012)

> Home

Details and statistics

DOI: 10.1145/2189778.2189779

access: closed

type: Journal Article

metadata version: 2023-03-21

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/toct/SchoenebeckV12
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/toct/SchoenebeckV12
Grant Schoenebeck, Salil P. Vadhan:
The Computational Complexity of Nash Equilibria in Concisely Represented Games. ACM Trans. Comput. Theory 4(2): 4:1-4:50 (2012)

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.