Skip to main content
SpringerLink
Log in

Berechnung von Nash-Gleichgewichten

  • HAUPTBEITRAG
  • BERECHNUNG VON NASH-GLEICHGEWICHTEN
  • Published:
Informatik-Spektrum Aims and scope

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

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

References

  1. Ackermann H, Röglin H, Vöcking B (2008) On the impact of combinatorial structure on congestion games. J ACM 55(6)

  2. Aumann R (1974) Subjectivity and correlation in randomized strategies. J Math Econ 1:67–96

    Article  MATH  MathSciNet  Google Scholar 

  3. Blum A, Mansour Y (2007) Learning, regret minimization, and equilibria. In: Nisan N, Tardos É, Roughgarden T, Vazirani V (eds) Algorithmic Game Theory, Chapter 4. Cambridge University Press

  4. Chen X, Deng X, Teng S-H (2009) Settling the complexity of computing two-player Nash equilibria. J ACM 56(3)

  5. Chien S, Sinclair A (2007) Convergence to approximate Nash equilibria in congestion games. In: Proc. 18th Symp. Discrete Algorithms (SODA), pp 169–178

  6. Daskalakis C, Goldberg P, Papadimitriou C (2006) The complexity of computing a Nash equilibrium. In: Proc. 38th Symp. Theory of Computing (STOC), pp 71–78

  7. Daskalakis C, Papadimitriou C (2009) On oblivious PTAS’s for Nash equilibrium. In: Proc. 41st Symp. Theory of Computing (STOC), pp 75–84

  8. Fabrikant A, Papadimitriou C, Talwar K (2004) The complexity of pure Nash equilibria. In: Proc. 36th Symp. Theory of Computing (STOC), pp 604–612

  9. Ieong S, McGrew R, Nudelman E, Shoham Y, Sun Q (2005) Fast and compact: A simple class of congestion games. In: Proc. 20th Conf. Artificial Intelligence (AAAI), pp 489–494

  10. Johnson D, Papadimitriou C, Yannakakis M (1988) How easy is local search? J Comput Syst Sci 37:79–100

    Article  MATH  MathSciNet  Google Scholar 

  11. Khachian L (1979) A polynomial algorithm in linear programming (in Russian). Dokl Akad Nauk SSSR 244:1093–1096

    MathSciNet  Google Scholar 

  12. Lemke C, Howson J (1964) Equilibrium points of bimatrix games. SIAM J Appl Math 12:413–423

    Article  MATH  MathSciNet  Google Scholar 

  13. Lipton R, Markakis V, Mehta A (2003) Playing large games using simple strategies. In: Proc. 3rd Conf. Electronic Commerce (EC), pp 36–41

  14. Nash J (1951) Non-cooperative games. Ann Math 54(2):286–295

    Article  MathSciNet  Google Scholar 

  15. von Neumann J, Morgenstern O (1944) Theory of Games and Economic Behavior. Princeton University Press, Princeton, NJ

    MATH  Google Scholar 

  16. Papadimitriou C (1994) On the complexity of the parity argument and other inefficient proofs of existence. J Comput Syst Sci 48(3):498–532

    Article  MATH  MathSciNet  Google Scholar 

  17. Papadimitriou C, Roughgarden T (2008) Computing correlated equilibria in multiplayer games. J ACM 55(3)

  18. Rosenthal R (1973) A class of games possessing pure-strategy Nash equilibria. Int J Game Theory 2:65–67

    Article  MATH  Google Scholar 

  19. Savani R, von Stengel B (2006) Hard-to-solve bimatrix games. Econometrica 74(2):397–429

    Article  MATH  MathSciNet  Google Scholar 

  20. Skopalik A, Vöcking B (2008) Inapproximability of pure Nash equilibria. In: Proc. 40th Symp. Theory of Computing (STOC), pp 355–364

Download references

Author information

Authors and Affiliations

  1. Lehrstuhl Informatik 1, RWTH Aachen, Ahornstraße 55, 52074, Aachen, Deutschland

    Martin Hoefer & Berthold Vöcking

Authors
  1. Martin Hoefer
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Berthold Vöcking
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Martin Hoefer.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Hoefer, M., Vöcking, B. Berechnung von Nash-Gleichgewichten. Informatik Spektrum 33, 462–467 (2010). https://doi.org/10.1007/s00287-010-0462-2

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00287-010-0462-2

Search

Navigation