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

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

> Home

Details and statistics

DOI: 10.1007/S00224-018-9851-8

access: open

type: Journal Article

metadata version: 2022-06-23

- view
  - electronic edition via DOI (open access)
  authority control:
- export record
  dblp key:
  - journals/mst/GoldbergCW19
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/mst/GoldbergCW19
Paul W. Goldberg, Francisco J. Marmolejo Cossío, Zhiwei Steven Wu:
Logarithmic Query Complexity for Approximate Nash Computation in Large Games. Theory Comput. Syst. 63(1): 26-53 (2019)

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.