Skip to main content
SpringerLink
Log in

A Direct Reduction from k-Player to 2-Player Approximate Nash Equilibrium

  • Conference paper
Algorithmic Game Theory (SAGT 2010)

Part of the book series: Lecture Notes in Computer Science ((LNISA,volume 6386))

Included in the following conference series:

Abstract

We present a direct reduction from k-player games to 2-player games that preserves approximate Nash equilibrium. Previously, the computational equivalence of computing approximate Nash equilibrium in k-player and 2-player games was established via an indirect reduction. This included a sequence of works defining the complexity class PPAD, identifying complete problems for this class, showing that computing approximate Nash equilibrium for k-player games is in PPAD, and reducing a PPAD-complete problem to computing approximate Nash equilibrium for 2-player games. Our direct reduction makes no use of the concept of PPAD, eliminating some of the difficulties involved in following the known indirect reduction.

A full version of this paper is available at http://arxiv.org/abs/1007.3886. Work supported in part by The Israel Science Foundation (grant No. 873/08).

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Althofer, I.: On sparse approximations to randomized strategies and convex combinations. Linear Algebra and its Applications 240, 9–19 (1994)

    MathSciNet  MATH  Google Scholar 

  2. Bosse, H., Byrka, J., Markakis, E.: New algorithms for approximate Nash equilibria in bimatrix games. In: Deng, X., Graham, F.C. (eds.) WINE 2007. LNCS, vol. 4858, pp. 17–29. Springer, Heidelberg (2007)

    Chapter  Google Scholar 

  3. Bubelis, V.: On equilibria in finite games. International Journal of Game Theory 8(2), 65–79 (1979)

    Article  MathSciNet  MATH  Google Scholar 

  4. Chen, X., Deng, X.: On the complexity of 2d discrete fixed point problem. In: Bugliesi, M., Preneel, B., Sassone, V., Wegener, I. (eds.) ICALP 2006. LNCS, vol. 4051, pp. 489–500. Springer, Heidelberg (2006)

    Chapter  Google Scholar 

  5. Chen, X., Deng, X.: Settling the complexity of 2-player Nash-equilibrium. In: FOCS (2006)

    Google Scholar 

  6. Chen, X., Deng, X., Teng, S.: Computing Nash equilibria: Approximation and smoothed complexity. In: FOCS (2006)

    Google Scholar 

  7. Daskalakis, C., Fabrikant, A., Papadimitriou, C.H.: The game world is flat: The complexity of Nash equilibria in succinct games. In: Bugliesi, M., Preneel, B., Sassone, V., Wegener, I. (eds.) ICALP 2006. LNCS, vol. 4051, pp. 513–524. Springer, Heidelberg (2006)

    Chapter  Google Scholar 

  8. Daskalakis, C., Goldberg, P.W., Papadimitriou, C.H.: The complexity of computing a Nash equilibrium. SICOMP 39(1), 195–259 (2009)

    Article  MathSciNet  MATH  Google Scholar 

  9. Daskalakis, C., Mehta, A., Papadimitriou, C.H.: Progress in approximate Nash equilibria. In: EC (2006)

    Google Scholar 

  10. Daskalakis, C., Papadimitriou, C.H.: On oblivious PTAS’s for Nash equilibrium. In: STOC (2009)

    Google Scholar 

  11. Etessami, K., Yannakakis, M.: On the complexity of Nash equilibria and other fixed points. In: FOCS (2007)

    Google Scholar 

  12. Gale, D., Kuhn, H.W., Tucker, A.W.: On symmetric games. In: Kuhn, H.W., Tucker, A.W. (eds.) Contributions to the Theory of Games, Princeton, pp. 81–87 (1950)

    Google Scholar 

  13. Goldberg, P.W., Papadimitriou, C.H.: Reducibility among equilibrium problems. In: STOC (2006)

    Google Scholar 

  14. Govindan, S., Wilson, R.: A decomposition algorithm for n-player games. Economic Theory 42(1), 97–117 (2010)

    Article  MathSciNet  MATH  Google Scholar 

  15. Hazan, E., Krauthgamer, R.: How hard is it to approximate the best Nash equilibrium? In: SODA (2009)

    Google Scholar 

  16. Kontogiannis, S.C., Spirakis, P.G.: Well supported approximate equilibria in bimatrix games. Algorithmica 57(4), 653–667 (2010)

    Article  MathSciNet  MATH  Google Scholar 

  17. van der Laan, G., Talman, A.J.J.: On the computation of fixed points in the product space of unit simplices and an application to noncooperative n-person games. Mathematics of Operations Research 7(1), 1–13 (1982)

    Article  MathSciNet  MATH  Google Scholar 

  18. Lemke, C.E., Howson, J.T.: Equilibrium points of bimatrix games. SIAM Journal of Applied Mathematics 12, 413–423 (1964)

    Article  MathSciNet  MATH  Google Scholar 

  19. Lipton, R., Markakis, E., Mehta, A.: Playing large games using simple strategies. In: EC (2003)

    Google Scholar 

  20. McLennan, A., Tourky, R.: Imitation games and computation. Games and Economic Behavior (2009)

    Google Scholar 

  21. Nash, J.F.: Non-cooperative games. Annals of Math. 54, 289–295 (1951)

    Article  MathSciNet  MATH  Google Scholar 

  22. Papadimitriou, C.H.: On the complexity of the parity argument and other inefficient proofs of existence. Journal of Computer and System Sciences 48(3), 498–532 (1994)

    Article  MathSciNet  MATH  Google Scholar 

  23. Roughgarden, T.: Computing equilibria: A computational complexity perspective. Economic Theory 42(1), 193–236 (2010)

    Article  MathSciNet  MATH  Google Scholar 

  24. Tsaknakis, H., Spirakis, P.G.: An optimization approach for approximate Nash equilibria. In: Deng, X., Graham, F.C. (eds.) WINE 2007. LNCS, vol. 4858, pp. 42–56. Springer, Heidelberg (2007)

    Chapter  Google Scholar 

  25. Tsaknakis, H., Spirakis, P.G.: A graph spectral approach for computing approximate Nash equilibria. In: ECCC (2009)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Weizmann Institute of Science, PO Box 26, Rehovot, 76100, Israel

    Uriel Feige & Inbal Talgam-Cohen

Authors
  1. Uriel Feige
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Inbal Talgam-Cohen
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Lecturer, Department of Computer Science, University of Ioannina, Dourouti University Campus, 45110, Ioannina, Greece

    Spyros Kontogiannis

  2. Department of Informatics and Telecommunications Panepistimiopolis, Ilissia, Professor, National and Kapodistrian University of Athens, 15784, Athens, Greece

    Elias Koutsoupias

  3. Computer Engineering and Informatics Department (CEID), University of Patras, 26500, Patras, Greece

    Paul G. Spirakis

Rights and permissions

Reprints and permissions

Copyright information

© 2010 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Feige, U., Talgam-Cohen, I. (2010). A Direct Reduction from k-Player to 2-Player Approximate Nash Equilibrium. In: Kontogiannis, S., Koutsoupias, E., Spirakis, P.G. (eds) Algorithmic Game Theory. SAGT 2010. Lecture Notes in Computer Science, vol 6386. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-16170-4_13

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-16170-4_13

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-16169-8

  • Online ISBN: 978-3-642-16170-4

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation