Document Open Access Logo

Large Supports are Required for Well-Supported Nash Equilibria

Authors Yogesh Anbalagan, Hao Huang, Shachar Lovett, Sergey Norin, Adrian Vetta, Hehui Wu

PDF
Thumbnail PDF

File

LIPIcs.APPROX-RANDOM.2015.78.pdf
  • Filesize: 441 kB
  • 7 pages

Document Identifiers

Author Details

Yogesh Anbalagan
Hao Huang
Shachar Lovett
Sergey Norin
Adrian Vetta
Hehui Wu

Cite AsGet BibTex

Yogesh Anbalagan, Hao Huang, Shachar Lovett, Sergey Norin, Adrian Vetta, and Hehui Wu. Large Supports are Required for Well-Supported Nash Equilibria. In Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2015). Leibniz International Proceedings in Informatics (LIPIcs), Volume 40, pp. 78-84, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2015)
https://doi.org/10.4230/LIPIcs.APPROX-RANDOM.2015.78

Abstract

We prove that for any constant k and any epsilon < 1, there exist bimatrix win-lose games for which every epsilon-WSNE requires supports of cardinality greater than k. To do this, we provide a graph-theoretic characterization of win-lose games that possess epsilon-WSNE with constant cardinality supports. We then apply a result in additive number theory of Haight to construct win-lose games that do not satisfy the requirements of the characterization. These constructions disprove graph theoretic conjectures of Daskalakis, Mehta and Papadimitriou and Myers.
Keywords
  • bimatrix games
  • well-supported Nash equilibria

Metrics

  • Access Statistics
  • Total Accesses (updated on a weekly basis)
    0
    PDF Downloads
    0
    Metadata Views

References

  1. I. Althöfer. On sparse approximations to randomized strategies and convex combinations. Linear Algebra and its Applications, 199:339-355, 1994. Google Scholar
  2. Y. Anbalagan, S. Norin, R. Savani, and A. Vetta. Polylogarithmic supports are required for approximate well-supported Nash equilibria below 2/3. In Proceedings of Ninth Conference on Web and Internet Economics (WINE), pages 15-23, 2013. Google Scholar
  3. L. Caccetta and R. Häggkvist. On minimal digraphs with given girth. Linear Algebra and its Applications, 21:181-187, 1978. Google Scholar
  4. P. Charbit. Circuits in Graphs and Digraphs via Embeddings. Doctoral Thesis, University of Lyon, 2005. Google Scholar
  5. X. Chen, X. Deng, and S. Teng. Settling the complexity of computing two-player Nash equilibria. Journal of the ACM, 56(3):1-57, 2009. Google Scholar
  6. C. Daskalakis, P. Goldberg, and C. Papadimitriou. The complexity of computing a Nash equilibrium. SIAM Journal on Computing, 39(1):195-259, 2009. Google Scholar
  7. C. Daskalakis, A. Mehta, and C. Papadimitriou. A note on approximate Nash equilibria. Theoretical Computer Science, 410(17):1581-1588, 2009. Google Scholar
  8. J. Haight. Difference covers which have small k-sums for any k. Mathematika, 20:109-118, 1973. Google Scholar
  9. R. Lipton, E. Markakis, and Mehta A. Playing large games using simple startegies. In Proceedings of Fourth Conference on Electronic Commerce (EC), pages 36-41, 2003. Google Scholar
  10. J. Myers. Extremal Theory of Graph Minors and Directed Graphs. Doctoral Thesis, University of Cambridge, 2003. Google Scholar
  11. J. Nash. Non-cooperative games. Annals of Mathematics, 54:289-295, 1951. Google Scholar
Questions / Remarks / Feedback
X

Feedback for Dagstuhl Publishing


Thanks for your feedback!

Feedback submitted

Could not send message

Please try again later or send an E-mail
© 2023-2024 Schloss Dagstuhl – LZI GmbH Imprint Privacy Contact