Argyrios Deligkas
Abstract
Since the celebrated PPAD-completeness result for Nash equilibria in bimatrix games, a long line of research has focused on polynomial-time algorithms that compute ε-approximate Nash equilibria. Finding the best possible approximation guarantee that we can have in polynomial time has been a fundamental and non-trivial pursuit on settling the complexity of approximate equilibria. Despite a significant amount of effort, the algorithm of Tsaknakis and Spirakis [38], with an approximation guarantee of (0.3393+δ), remains the state of the art over the last 15 years. In this paper, we propose a new refinement of the Tsaknakis-Spirakis algorithm, resulting in a polynomial-time algorithm that computes a \((\frac{1}{3}+\delta)\)-Nash equilibrium, for any constant δ > 0. The main idea of our approach is to go beyond the use of convex combinations of primal and dual strategies, as defined in the optimization framework of [38], and enrich the pool of strategies from which we build the strategy profiles that we output in certain bottleneck cases of the algorithm.
- [1] . 2011. Rank-1 bimatrix games: A homeomorphism and a polynomial time algorithm. In Proceedings of STOC. 195–204.Google Scholar
Digital Library
- [2] . 2011. Inapproximability of NP-complete variants of Nash equilibrium. In Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques. Springer, 13–25.Google Scholar
- [3] . 2017. Empirical distribution of equilibrium play and its testing application. Math. Oper. Res. 42, 1 (2017), 15–29.Google ScholarDigital Library
- [4] . 2007. Nash equilibria in random games. Random Structures & Algorithms 31, 4 (2007), 391–405.Google ScholarDigital Library
- [5] . 2018. Approximating Nash equilibria and dense subgraphs via an approximate version of Carathéodory’s theorem. SIAM J. Comput. 47, 3 (2018), 960–981.Google ScholarCross Ref
- [6] . 2020. Smoothed complexity of 2-player Nash equilibria. In Proceedings of FOCS. 271–282.Google ScholarCross Ref
- [7] . 2010. New algorithms for approximate Nash equilibria in bimatrix games. Theoretical Computer Science 411, 1 (2010), 164–173.Google ScholarDigital Library
- [8] . 2015. Approximating the best Nash equilibrium in n\({}^{\mbox{o}}\)\({}^{{(\log {n})}}\)-time breaks the exponential time hypothesis. In Proceedings of SODA. SIAM, 970–982.Google Scholar
- [9] . 2006. Sparse games are hard. In Proceedings of WINE. 262–273.Google ScholarDigital Library
- [10] . 2009. Settling the complexity of computing two-player Nash equilibria. J. ACM 56, 3 (2009).Google ScholarDigital Library
- [11] . 2007. The approximation complexity of win-lose games. In Proceedings of SODA, Vol. 7. 159–168.Google Scholar
- [12] . 2021. On tightness of the Tsaknakis-Spirakis algorithm for approximate Nash equilibrium. In Proceedings of SAGT, Vol. 12885. 97–111.Google ScholarDigital Library
- [13] . 2005. On the computational complexity of Nash equilibria for (0,1) bimatrix games. Inform. Process. Lett. 94, 3 (2005), 145–150.Google ScholarDigital Library
- [14] . 2019. Distributed methods for computing approximate equilibria. Algorithmica 81, 3 (2019), 1205–1231.Google ScholarDigital Library
- [15] . 2014. Approximate well-supported Nash equilibria in symmetric bimatrix games. In Proceedings of SAGT, Vol. 8768. 244–254.Google ScholarCross Ref
- [16] . 2006. The complexity of computing a Nash equilibrium. In Proceedings of STOC. 71–78.Google ScholarDigital Library
- [17] . 2007. Progress in approximate Nash equilibria. In Proceedings of EC. 355–358.Google ScholarDigital Library
- [18] . 2009. A note on approximate Nash equilibria. Theoretical Computer Science 410, 17 (2009), 1581–1588.Google ScholarDigital Library
- [19] . 2023. A polynomial-time algorithm for 1/2-well-supported Nash equilibria in bimatrix games. In Proceedings of ACM-SIAM Symposium on Discrete Algorithms, SODA. SIAM, 3777–3787.
DOI: Google ScholarCross Ref - [20] . 2022. Approximating the existential theory of the reals. J. Comput. Syst. Sci. 125 (2022), 106–128.
DOI: Google ScholarDigital Library - [21] . 2018. Inapproximability results for constrained approximate Nash equilibria. Inf. Comput. 262 (2018), 40–56.Google ScholarCross Ref
- [22] . 2017. Computing approximate Nash equilibria in polymatrix games. Algorithmica 77, 2 (2017), 487–514.Google ScholarDigital Library
- [23] . 2016. Approximate well-supported Nash equilibria below two-thirds. Algorithmica 76, 2 (2016), 297–319.Google ScholarDigital Library
- [24] . 2010. Games of fixed rank: A hierarchy of bimatrix games. Economic Theory 42, 1 (2010), 157–173.Google ScholarCross Ref
- [25] . 2006. Polynomial algorithms for approximating Nash equilibria of bimatrix games. In Proceedings of WINE. 286–296.Google ScholarDigital Library
- [26] . 2010. Well supported approximate equilibria in bimatrix games. Algorithmica 57, 4 (2010), 653–667.Google ScholarCross Ref
- [27] . 2011. Approximability of symmetric bimatrix games and related experiments. In Proceedings of SEA, Vol. 6630. 1–20.Google ScholarCross Ref
- [28] . 2018. Sum-of-squares meets Nash: Lower bounds for finding any equilibrium. In Proceedings of STOC. ACM, 1241–1248.Google ScholarDigital Library
- [29] . 2003. Playing large games using simple strategies. In Proceedings of EC. 36–41.Google ScholarDigital Library
- [30] . 2018. On the approximation of Nash equilibria in sparse win-lose games. In Proceedings of AAAI, Vol. 32.Google ScholarCross Ref
- [31] . 2010. Imitation games and computation. Games and Economic Behavior 70, 1 (2010), 4–11.Google ScholarCross Ref
- [32] . 2010. Simple complexity from imitation games. Games and Economic Behavior 68, 2 (2010), 683–688.Google ScholarCross Ref
- [33] . 2018. Constant rank two-player games are PPAD-hard. SIAM J. Comput. 47, 5 (2018), 1858–1887.Google ScholarDigital Library
- [34] . 2020. Approximate Nash equilibria of imitation games: Algorithms and complexity. In Proceedings of AAMAS. 887–894.Google Scholar
- [35] . 1951. Non-cooperative games. Annals of Mathematics 54, 2 (1951), 286–295.Google ScholarCross Ref
- [36] . 2014. Random bimatrix games are asymptotically easy to solve (A simple proof). Theory of Computing Systems 54, 3 (2014), 479–490.Google ScholarDigital Library
- [37] . 2016. Settling the complexity of computing approximate two-player Nash equilibria. In Proceedings of FOCS. 258–265.Google ScholarCross Ref
- [38] . 2008. An optimization approach for approximate Nash equilibria. Internet Mathematics 5, 4 (2008), 365–382.Google ScholarCross Ref
Index Terms
- A Polynomial-Time Algorithm for 1/3-Approximate Nash Equilibria in Bimatrix Games
Recommendations
Well Supported Approximate Equilibria in Bimatrix Games
In view of the apparent intractability of constructing Nash Equilibria (NE in short) in polynomial time, even for bimatrix games, understanding the limitations of the approximability of the problem is an important challenge.
In this work we study the ...
Approximate Plutocratic and Egalitarian Nash Equilibria: (Extended Abstract)
AAMAS '16: Proceedings of the 2016 International Conference on Autonomous Agents & Multiagent SystemsWe pose the problem of computing approximate Nash equilibria in bimatrix games with two simultaneous criteria of optimization: minimization of the incentives to deviate from a strategy profile and maximization of a measure of quality of the strategy ...
Approximate Well-supported Nash Equilibria Below Two-thirds
In an $$\epsilon $$∈-Nash equilibrium, a player can gain at most $$\epsilon $$∈ by changing his behaviour. Recent work has addressed the question of how best to compute $$\epsilon $$∈-Nash equilibria, and for what values of $$\epsilon $$∈ a polynomial-...
Comments