Simple algorithmic techniques to approximate nash equilibria
Pages 4 - 9
Abstract
We study the problem of computing approximate Nash equilibria in symmetric bimatrix games. We first give an approximation scheme for Nash equilibria in such games. Even though this scheme is not polynomial-time, it gives an interesting performance guarantee that depends on structural properties of the (exact) Nash equilibria of the game.
Next, we propose and experimentally evaluate a simple algorithm for computing approximate Nash equilibria of symmetric 2-player games. Starting from an arbitrary symmetric strategy profile, we continue by repeatedly modifying it slightly, in order to improve the approximation factor achieved. The algorithm is based on letting the players of a new, suitably defined multi-player game perform greedy selfish improvement steps, so that they converge to a strategy profile that corresponds to a sufficiently good approximate Nash equilibrium of the original bimatrix game.
References
[1]
I. Althöfer. 1994. On Sparse Approximations to Randomized Strategies and Convex Combinations. Linear Algebra and Applications 199 (1994), 339--355.
[2]
Xi Chen and Xiaotie Deng. 2005. Settling the Complexity of 2-Player Nash-Equilibrium. In Proceedings of the 47th Annual IEEE Symposium on Foundations of Computer Science (FOCS'06).
[3]
Xi Chen, Xiaotie Deng, and Shang-Hua Teng. 2006. Computing Nash Equilibria: Approximation and Smoothed Complexity. In Electronic Colloquium on Computational Complexity (ECCC).
[4]
Constantinos Daskalakis, Paul Goldberg, and Christos Papadimitriou. 2006. The Complexity of Computing a Nash Equilibrium. In Proceedings of the 38th Annual ACM Symposium on Theory of Computing (STOC'06). 71--78.
[5]
Constantinos Daskalakis, Aranyak Mehta, and Christos Papadimitriou. 2006. A Note on Approximate Nash Equilibria. In Proceedings of the 2nd Workshop on Internet and Network Economics (WINE'06). 297--306.
[6]
Constantinos Daskalakis and Christos Papadimitriou. 2005. Three-player Games are Hard. In Electronic Colloquium on Computational Complexity (ECCC).
[7]
D. Gal, H. W. Kuhn, and A. W. Tucker. 1950. On symmetric games. Contributions to the Theory of Games I (1950), 81--87.
[8]
Paul Goldberg and Christos Papadimitriou. 2006. Reducibility among Equilibrium Problems. In Proceedings of the 38th Annual ACM Symposium on Theory of Computing (STOC '06). 61--70.
[9]
Spyros Kontogiannis, Panagiota N. Panagopoulou, and Paul G. Spirakis. 2006. Polynomial Algorithms for Approximating Nash Equilibria of Bimatrix Games. In Proceedings of the 2nd Workshop on Internet and Network Economics (WINE'06). 286--296.
[10]
C. E. Lemke. 1965. Bimatrix Equilibrium Points and Mathematical Programming. Management Science 11 (1965), 681--689.
[11]
C. E. Lemke and J. T. Howson. 1964. Equilibrium Points of Bimatrix Games. J. Soc. Indust. Appl. Math. 12 (1964), 313--423.
[12]
Richard J. Lipton, Evangelos Markakis, and Aranyak Mehta. 2003. Playing Large Games using Simple Startegies. In Proceedings of the 4th ACM Conference on Electronic Commerce (EC'03). 36--41.
[13]
J. Nash. 1951. Noncooperative Games. Annals of Mathematics 54 (1951), 289--295.
[14]
Panagiota N. Panagopoulou and Paul G. Spirakis. 2011. Random Bimatrix Games Are Asymptotically Easy to Solve (A Simple Proof). In Algorithmic Game Theory, 4th International Symposium, SAGT 2011, Amalfi, Italy, October 17--19, 2011. Proceedings. 190--199.
[15]
C. H. Papadimitriou. 1991. On Inefficient Proof s of Existence and Complexity Classes. In Proceedings of the 4th Czechoslovakian Symposium on Combinatorics.
[16]
Rahul Savani and Bernhard von Stengel. 2004. Exponentially Many Steps for Finding a Nash Equilibrium in a Bimatrix Game. In Proceedings of the 45th Annual IEEE Symposium on Foundations of Computer Science (FOCS'04). 258--267.
[17]
Haralampos Tsaknakis and Paul G. Spirakis. 2008. An Optimization Approach for Approximate Nash Equilibria. Internet Mathematics 5, 4 (2008), 365--382.
Index Terms
- Simple algorithmic techniques to approximate nash equilibria
Recommendations
Finding Approximate Nash Equilibria of Bimatrix Games via Payoff Queries
Special Issue on EC'14We study the deterministic and randomized query complexity of finding approximate equilibria in a k × k bimatrix game. We show that the deterministic query complexity of finding an ϵ-Nash equilibrium when ϵ < ½ is Ω(k2), even in zero-one constant-sum ...
Polynomial algorithms for approximating Nash equilibria of bimatrix games
We focus on the problem of computing an @e-Nash equilibrium of a bimatrix game, when @e is an absolute constant. We present a simple algorithm for computing a 34-Nash equilibrium for any bimatrix game in strongly polynomial time and we next show how to ...
Finding approximate nash equilibria of bimatrix games via payoff queries
EC '14: Proceedings of the fifteenth ACM conference on Economics and computationWe study the deterministic and randomized query complexity of finding approximate equilibria in a k x k bimatrix game. We show that the deterministic query complexity of finding an ε-Nash equilibrium when ε < 1/2 is Ω(k2), even in zero-one constant-sum ...
Comments
Information & Contributors
Information
Published In
November 2018
336 pages
ISBN:9781450366106
DOI:10.1145/3291533
- Editors:
- Karanikolas Nikitas,
- Mamalis Basilis,
- General Chairs:
- Kontos John,
- Pantziou Grammati,
- Gritzalis Stefanos,
- Douligeris Christos
Copyright © 2018 ACM.
Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]
Publisher
Association for Computing Machinery
New York, NY, United States
Publication History
Published: 29 November 2018
Check for updates
Author Tags
Qualifiers
- Research-article
Conference
PCI '18
Acceptance Rates
PCI '18 Paper Acceptance Rate 57 of 105 submissions, 54%;
Overall Acceptance Rate 190 of 390 submissions, 49%
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- 0Total Citations
- 50Total Downloads
- Downloads (Last 12 months)1
- Downloads (Last 6 weeks)0
Reflects downloads up to 05 Mar 2025
Other Metrics
Citations
View Options
Login options
Check if you have access through your login credentials or your institution to get full access on this article.
Sign in