Skip to main content

Equilibrium Points in Fear of Correlated Threats

  • Conference paper
Internet and Network Economics (WINE 2008)

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

Included in the following conference series:

Abstract

The present work considers the following computational problem: Given any finite game in normal form G and the corresponding infinitely repeated game G  ∞ , determine in polynomial time (wrt the representation of G) a profile of strategies for the players in G  ∞  that is an equilibrium point wrt the limit-of-means payoff. The problem has been solved for two players [10], based mainly on the implementability of the threats for this case. Nevertheless, [4] demonstrated that the traditional notion of threats is a computationally hard problem for games with at least 3 players (see also [8]). Our results are the following: (i) We propose an alternative notion of correlated threats, which is polynomial time computable (and therefore credible). Our correlated threats are also more severe than the traditional notion of threats, but not overwhelming for any individual player. (ii) When for the underlying game G there is a correlated strategy with payoff vector strictly larger than the correlated threats vector, we efficiently compute a polynomial–size (wrt the description of G) equilibrium point for G  ∞ , for any constant number of players. (iii) Otherwise, we demonstrate the construction of an equilibrium point for an arbitrary number of players and up to 2 concurrently positive payoff coordinates in any payoff vector of G. This completely resolves the cases of 3 players, and provides a direction towards handling the cases of more than 3 players. It is mentioned that our construction is not a Nash equilibrium point, because the correlated threats we use are implemented via, not only full synchrony (as in [10]), but also coordination of the other players’ actions. But this seems to be a fair trade-off between efficiency of the construction and players’ coordination, in particular because it only affects the punishments (which are anticipated never to be used).

This work has been partially supported by the Programmes of the European Union (i) ERC/IDEAS under contract number ERC-StG-2008-210743 (RIMACO), and (ii) ICT under contract number ICT-2008-215270 (FRONTS).

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.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. Abraham, I., Dolev, D., Gonen, R., Halpern, J.: Distributed computing meets game theory: Robust mechanisms for rational secret sharing and multiparty computation. In: Proc. of 25th ACM Symp. on Princ. of Distr. Comp. (PODC 2006) (2006)

    Google Scholar 

  2. Aumann, R.J., Shapley, L.S.: Long-term competition – a game theoretic analysis. In: Megiddo, N. (ed.) Essays in Game Theory, pp. 1–15 (1994)

    Google Scholar 

  3. Bárány, I.: Fair distribution protocols or how the players replace fortune. Mathematics of Operations Research 17(2), 327–340 (1992)

    Article  MathSciNet  MATH  Google Scholar 

  4. Borgs, C., Chayes, J., Immorlica, N., Kalai, A.T., Mirrokni, V., Papadimitriou, C.: The myth of the folk theorem. In: Proc. of 40th ACM Symp. on Th. of Comp. (STOC 2008) (2008)

    Google Scholar 

  5. Chen, X., Deng, X.: Settling the complexity of 2-player nash equilibrium. In: Proc. of 47th IEEE Symp. on Found. of Comp. Sci (FOCS 2006), IEEE Comp. Soc. Press, Los Alamitos (2006)

    Google Scholar 

  6. Daskalakis, C., Goldberg, P., Papadimitriou, C.: The complexity of computing a nash equilibrium. In: Proc. of 38th ACM Symp. on Th. of Comp. (STOC 2006). Assoc. of Comp. Mach., ACM (2006)

    Google Scholar 

  7. Fudenberg, D., Maskin, E.: Folk theorems for repeated games with discounting and incomplete information. Econometrica 54, 533–554 (1986)

    Article  MathSciNet  MATH  Google Scholar 

  8. Hansen, K.A., Hansen, T.D., Miltersen, P.B., Sørensen, T.B.: Approximability and parameterized complexity of minmax values. In: Proc. of 4th W. on Internet and Net Econ. (WINE 2008) (2008)

    Google Scholar 

  9. Kontogiannis, S., Spirakis, P.: Equilibrium points in fear of correlated threats. In: Proc. of 4th W. on Internet and Net. Econ. (WINE 2008) (2008), http://www.cs.uoi.gr/~kontog/pubs/repeated-nash.pdf

  10. Littman, M.L., Stone, P.: A polynomial-time nash equilibrium algorithm for repeated games. Decision Support Systems 39(1), 55–66 (2005)

    Article  Google Scholar 

  11. Osborne, M.J., Rubinstein, A.: A Course in Game Theory. MIT Press, Cambridge (1994)

    MATH  Google Scholar 

  12. Schrijver, A.: Theory of Linear and Integer Programming. Wiley–Interscience, New York (1986)

    MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2008 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Kontogiannis, S.C., Spirakis, P.G. (2008). Equilibrium Points in Fear of Correlated Threats. In: Papadimitriou, C., Zhang, S. (eds) Internet and Network Economics. WINE 2008. Lecture Notes in Computer Science, vol 5385. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-92185-1_28

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-92185-1_28

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-92184-4

  • Online ISBN: 978-3-540-92185-1

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics