Finding Approximate Nash Equilibria of Bimatrix Games via Payoff Queries
- Submitting institution
-
The University of Liverpool
- Unit of assessment
- 11 - Computer Science and Informatics
- Output identifier
- 12017
- Type
- D - Journal article
- DOI
-
10.1145/2956579
- Title of journal
- ACM Transactions on Economics and Computation (TEAC)
- Article number
- 25
- First page
- -
- 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
- A preliminary version of this paper appeared at the ACM Conference on Economics and Computation (2014). It was invited to the special issue of ACM Transaction on Economics and Computation as one of the best papers from that conference. Subsequent major results that developed this area further include "Distributed Methods for Computing Approximate Equilibria" (Algorithmica 2019) and "Query Complexity of Approximate Nash Equilibria" (Journal of the ACM 2016).
- Author contribution statement
- -
- Non-English
- No
- English abstract
- -