Inapproximability results for approximate Nash equilibria



Deligkas, A, Fearnley, J and Savani, R ORCID: 0000-0003-1262-7831
(2016) Inapproximability results for approximate Nash equilibria .

[thumbnail of 1608.03574v3.pdf] PDF
1608.03574v3.pdf - Unspecified

Download (330kB) | Preview

Abstract

We study the problem of finding approximate Nash equilibria that satisfy certain conditions, such as providing good social welfare. In particular, we study the problem ϵ-NE δ-SW: find an ϵ-approximate Nash equilibrium (ϵ-NE) that is within δ of the best social welfare achievable by an ϵ-NE. Our main result is that, if the randomized exponential-time hypothesis (RETH) is true, then solving (1/8 − O(δ))-NE O(δ)-SW for an n × n bimatrix game requires (Formula Presented.) time, where Λ is a constant. Building on this result, we show similar conditional running time lower bounds on a number of decision problems for approximate Nash equilibria that do not involve social welfare, including maximizing or minimizing a certain player’s payoff, or finding approximate equilibria contained in a given pair of supports. We show quasi-polynomial lower bounds for these problems assuming that RETH holds, and these lower bounds apply to ϵ-Nash equilibria for all ϵ < 1/8. The hardness of these other decision problems has so far only been studied in the context of exact equilibria.

Item Type: Conference Item (Unspecified)
Additional Information: A short (14-page) version of this paper appeared at WINE 2016. Compared to that conference version, this new version improves the conditional lower bounds, which now rely on ETH rather than RETH (Randomized ETH)
Uncontrolled Keywords: cs.GT, cs.GT
Divisions: Faculty of Science & Engineering > School of Electrical Engineering, Electronics and Computer Science
Faculty of Science & Engineering > School of Physical Sciences
Depositing User: Symplectic Admin
Date Deposited: 12 Dec 2022 09:52
Last Modified: 21 Apr 2026 23:58
DOI: 10.1007/978-3-662-54110-4_3
Related Websites:
URI: https://livrepository.liverpool.ac.uk/id/eprint/3166597
Disclaimer: The University of Liverpool is not responsible for content contained on other websites from links within repository metadata. Please contact us if you notice anything that appears incorrect or inappropriate.