Distributed Methods for Computing Approximate Equilibria
- Submitting institution
-
The University of Liverpool
- Unit of assessment
- 11 - Computer Science and Informatics
- Output identifier
- 15839
- Type
- D - Journal article
- DOI
-
10.1007/s00453-018-0465-y
- Title of journal
- Algorithmica: an international journal in computer science
- Article number
- 3
- First page
- 1205
- Volume
- 81
- Issue
- 3
- ISSN
- 0178-4617
- Open access status
- Compliant
- Month of publication
- June
- Year of publication
- 2018
- 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
-
5
- Research group(s)
-
-
- Citation count
- 3
- Proposed double-weighted
- No
- Reserve for an output with double weighting
- No
- Additional information
- A preliminary version of this paper with the same title appeared at WINE'16. This paper builds on the authors' earlier techniques from "Approximate Well-supported Nash Equilibria Below Two-thirds" (Algorithmica'16), which is not REF returned. The results complemented (with results for 2-player games) the literature on query and communication complexity of fixed points and equilibria, for example, Roughgarden and Weinstein (FOCS'16) and Babichenko and Rubinstein (STOC'17).
- Author contribution statement
- -
- Non-English
- No
- English abstract
- -