Advertisement

Query Complexity of Approximate Equilibria in Anonymous Games

  • Paul W. Goldberg
  • Stefano Turchetta
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 9470)

Abstract

We study the computation of equilibria of two-strategy anonymous games, via algorithms that may proceed via a sequence of adaptive queries to the game’s payoff function, assumed to be unknown initially. The general topic we consider is query complexity, that is, how many queries are necessary or sufficient to compute an exact or approximate Nash equilibrium.

We show that exact equilibria cannot be found via query-efficient algorithms. We also give an example of a 2-strategy, 3-player anonymous game that does not have any exact Nash equilibrium in rational numbers. Our main result is a new randomized query-efficient algorithm that finds a \(O(n^{-1/4})\)-approximate Nash equilibrium querying \(\tilde{O}(n^{3/2})\) payoffs and runs in time \(\tilde{O}(n^{3/2})\). This improves on the running time of pre-existing algorithms for approximate equilibria of anonymous games, and is the first one to obtain an inverse polynomial approximation in poly-time. We also show how this can be used to get an efficient PTAS. Furthermore, we prove that \(\varOmega (n \log {n})\) payoffs must be queried in order to find any \(\epsilon \)-well-supported Nash equilibrium, even by randomized algorithms.

References

  1. 1.
    Azrieli, Y., Shmaya, E.: Lipschitz games. Math. Oper. Res. 38(2), 350–357 (2013)MathSciNetCrossRefzbMATHGoogle Scholar
  2. 2.
    Babichenko, Y.: Best-reply dynamics in large binary-choice anonymous games. Games Econ. Behav. 81(1), 130–144 (2013)MathSciNetCrossRefzbMATHGoogle Scholar
  3. 3.
    Babichenko, Y.: Query complexity of approximate Nash equilibria. In: Proceedings of the 46th Annual ACM Symposium on Theory of Computing. pp. 535–544. STOC 2014. ACM, USA (2014)Google Scholar
  4. 4.
    Brandt, F., Fischer, F., Holzer, M.: Symmetries and the complexity of pure Nash equilibrium. J. Comput. Syst. Sci. 75, 163–177 (2009)MathSciNetCrossRefzbMATHGoogle Scholar
  5. 5.
    Chen, X., Deng, X., Teng, S.: Settling the complexity of computing two-player Nash equilibria. J. ACM 56(3), 1–57 (2009)MathSciNetCrossRefzbMATHGoogle Scholar
  6. 6.
    Chen, X., Durfee, D., Orfanou, A.: On the complexity of Nash equilibria in anonymous games. In: Proceedings of the Forty-Seventh Annual ACM on Symposium on Theory of Computing, STOC 2015, ACM, pp. 381–390 (2015)Google Scholar
  7. 7.
    Daskalakis, C.: An efficient PTAS for two-strategy anonymous games. In: Papadimitriou, C., Zhang, S. (eds.) WINE 2008. LNCS, vol. 5385, pp. 186–197. Springer, Heidelberg (2008) CrossRefGoogle Scholar
  8. 8.
    Daskalakis, C., Goldberg, P.W., Papadimitriou, C.H.: The complexity of computing a Nash equilibrium. SIAM J. Comput. 39(1), 195–259 (2009)MathSciNetCrossRefzbMATHGoogle Scholar
  9. 9.
    Daskalakis, C., Papadimitriou, C.H.: Computing equilibria in anonymous games. In: Proceedings of the 48th Symposium on Foundations of Computer Science (FOCS), pp. 83–93 (2007)Google Scholar
  10. 10.
    Daskalakis, C., Papadimitriou, C.H.: Discretized multinomial distributions and Nash equilibria in anonymous games. In: Proceedings of the 49th Symposium on Foundations of Computer Science (FOCS), pp. 25–34 (2008)Google Scholar
  11. 11.
    Daskalakis, C., Papadimitriou, C.H.: On oblivious PTAS’s for Nash equilibrium. In: Proceedings of the 41st Annual ACM Symposium on Theory of Computing, STOC 2009, pp. 75–84. ACM, USA (2009)Google Scholar
  12. 12.
    Daskalakis, C., Papadimitriou, C.H.: Sparse covers for sums of indicators (2013). CoRR abs/1306.1265
  13. 13.
    Daskalakis, C., Papadimitriou, C.H.: Approximate Nash equilibria in anonymous games. J. Econ. Theory 156, 207–245 (2015)MathSciNetCrossRefzbMATHGoogle Scholar
  14. 14.
    Etessami, K., Yannakakis, M.: On the complexity of Nash equilibria and other fixed points. SIAM J. Comput. 39(6), 2531–2597 (2010)MathSciNetCrossRefzbMATHGoogle Scholar
  15. 15.
    Fearnley, J., Gairing, M., Goldberg, P.W., Savani, R.: Learning equilibria of games via payoff queries. In: Proceedings of the 14th ACM Conference on Electronic Commerce, EC 2013, pp. 397–414. ACM, USA (2013)Google Scholar
  16. 16.
    Fearnley, J., Savani, R.: Finding approximate Nash equilibria of bimatrix games via payoff queries. In: Proceedings of the Fifteenth ACM Conference on Economics and Computation, EC 2014, pp. 657–674. ACM, USA (2014)Google Scholar
  17. 17.
    Goldberg, P.W., Roth, A.: Bounds for the query complexity of approximate equilibria. In: Proceedings of the Fifteenth ACM Conference on Economics and Computation, EC 2014, pp. 639–656. ACM, USA (2014)Google Scholar
  18. 18.
    Hart, S., Nisan, N.: The query complexity of correlated equilibria. In: Vöckling, B. (ed.) SAGT 2013. LNCS, vol. 8146, p. 268. Springer, Heidelberg (2013)Google Scholar
  19. 19.
    Kash, I.A., Friedman, E.J., Halpern, J.Y.: Multiagent learning in large anonymous games. In: Eighth International Conference on Autonomous Agents and Multiagent Systems (AAMAS), pp. 765–772 (2009)Google Scholar
  20. 20.
    Lipton, R.J., Markakis, E., Mehta, A.: Playing large games using simple strategies. In: Proceedings of the 4th ACM Conference on Electronic Commerce, EC 2003, pp. 36–41. ACM, USA (2003)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2015

Open Access This chapter is distributed under the terms of the Creative Commons Attribution Noncommercial License, which permits any noncommercial use, distribution, and reproduction in any medium, provided the original author(s) and source are credited.

Authors and Affiliations

  1. 1.Department of Computer ScienceUniversity of OxfordOxfordUK

Personalised recommendations