default search action

combined dblp search
author search
venue search
publication search

ask others

"Settling the complexity of computing approximate two-player Nash equilibria."

Aviad Rubinstein (2017)

> Home

Details and statistics

DOI: 10.1145/3055589.3055596

access: closed

type: Journal Article

metadata version: 2020-06-04

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/sigecom/Rubinstein17
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/sigecom/Rubinstein17
Aviad Rubinstein:
Settling the complexity of computing approximate two-player Nash equilibria. SIGecom Exch. 15(2): 45-49 (2017)

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.