Distributed Methods for Computing Approximate Equilibria

DOI10.1007/978-3-662-54110-4_2zbMath1404.91003arXiv1512.03315OpenAlexW2192686830MaRDI QIDQ2959815

Marcin Jurdziński, Rahul Savani, John Fearnley, Argyrios Deligkas, Michail Fasoulakis, Artur Czumaj

Publication date: 10 February 2017

Published in: Web and Internet Economics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1512.03315

zbMATH Keywords

bimatrix gamesapproximate Nash equilibria

Mathematics Subject Classification ID

2-person games (91A05) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Software, source code, etc. for problems pertaining to game theory, economics, and finance (91-04)

Related Items (7)

On tightness of the Tsaknakis-Spirakis algorithm for approximate Nash equilibrium ⋮ A Polynomial-Time Algorithm for 1/2-Well-Supported Nash Equilibria in Bimatrix Games ⋮ Inapproximability Results for Approximate Nash Equilibria ⋮ Unnamed Item ⋮ Inapproximability results for constrained approximate Nash equilibria ⋮ Near-Optimal Communication Lower Bounds for Approximate Nash Equilibria ⋮ Near-Optimal Communication Lower Bounds for Approximate Nash Equilibria

Cites Work

• Unnamed Item
• Approximate well-supported Nash equilibria below two-thirds
• How long to equilibrium? The communication complexity of uncoupled equilibrium procedures
• Well supported approximate equilibria in bimatrix games
• A note on approximate Nash equilibria
• New algorithms for approximate Nash equilibria in bimatrix games
• On the communication complexity of approximate Nash equilibria
• Non-cooperative games
• Approximate Well-Supported Nash Equilibria in Symmetric Bimatrix Games
• Settling the complexity of computing two-player Nash equilibria
• An Optimization Approach for Approximate Nash Equilibria
• The Complexity of Computing a Nash Equilibrium

This page was built for publication: Distributed Methods for Computing Approximate Equilibria