Bounds for the query complexity of approximate equilibria
- Submitting institution
-
University of Oxford
- Unit of assessment
- 11 - Computer Science and Informatics
- Output identifier
- 2037
- Type
- D - Journal article
- DOI
-
10.1145/2956582
- Title of journal
- ACM Transactions on Economics and Computation
- Article number
- -
- First page
- 1
- Volume
- 4
- Issue
- 4
- ISSN
- 2167-8375
- Open access status
- Out of scope for open access requirements
- Month of publication
- August
- Year of publication
- 2016
- URL
-
-
- Supplementary information
-
-
- Request cross-referral to
- -
- Output has been delayed by COVID-19
- No
- COVID-19 affected output statement
- -
- Forensic science
- No
- Criminology
- No
- Interdisciplinary
- No
- Number of additional authors
-
1
- Research group(s)
-
-
- Citation count
- -
- Proposed double-weighted
- No
- Reserve for an output with double weighting
- No
- Additional information
- This paper first appeared at ACM Economics and Computation, the leading conference in algorithmic game theory; it appears by invitation in a special issue of ACM Transactions on Economics and Computation. Among other results, the paper introduced a new technique for bounding the query complexity of games, which was extended in a paper of Rubinstein and also led to his well-known work on inapproximability of Nash equilibrium (�Inapproximability of Nash Equilbrium�, SIAM Journal on Computing, 2018: https://epubs.siam.org/doi/pdf/10.1137/15M1039274).
- Author contribution statement
- -
- Non-English
- No
- English abstract
- -
