"Logarithmic Query Complexity for Approximate Nash Computation in Large Games."

Paul W. Goldberg, Francisco J. Marmolejo Cossío, Zhiwei Steven Wu (2016)

> Home

Details and statistics

DOI: 10.1007/978-3-662-53354-3_1

access: closed

type: Conference or Workshop Paper

metadata version: 2021-04-09

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - conf/sagt/GoldbergCW16
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/sagt/GoldbergCW16
Paul W. Goldberg, Francisco J. Marmolejo Cossío, Zhiwei Steven Wu:
Logarithmic Query Complexity for Approximate Nash Computation in Large Games. SAGT 2016: 3-14

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.