Skip to main content
SpringerLink
Log in

Coordination Games on Graphs (Extended Abstract)

  • Conference paper
Web and Internet Economics (WINE 2014)

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

Included in the following conference series:

Abstract

We introduce natural strategic games on graphs, which capture the idea of coordination in a local setting. We show that these games have an exact potential and have strong equilibria when the graph is a pseudoforest. We also exhibit some other classes of graphs for which a strong equilibrium exists. However, in general strong equilibria do not need to exist. Further, we study the (strong) price of stability and anarchy. Finally, we consider the problems of computing strong equilibria and of determining whether a joint strategy is a strong equilibrium.

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. Andelman, N., Feldman, M., Mansour, Y.: Strong price of anarchy. Games and Economic Behavior 65(2), 289–317 (2009)

    Article  MATH  MathSciNet  Google Scholar 

  2. Aumann, R.J.: Acceptable points in general cooperative n-person games. In: Luce, R.D., Tucker, A.W. (eds.) Contribution to the Theory of Game IV. Annals of Mathematical Study, vol. 40, pp. 287–324. University Press (1959)

    Google Scholar 

  3. Aziz, H., Brandl, F.: Existence of stability in hedonic coalition formation games. In: Proc. 11th International Conference on Autonomous Agents and Multiagent Systems, pp. 763–770 (2012)

    Google Scholar 

  4. Banerjee, S., Konishi: Core in a simple coalition formation game. Social Choice and Welfare 18(1), 135–153 (2001)

    Article  MATH  MathSciNet  Google Scholar 

  5. Bilò, V., Fanelli, A., Flammini, M., Moscardelli, L.: Graphical congestion games. Algorithmica 61(2), 274–297 (2011)

    Article  MATH  MathSciNet  Google Scholar 

  6. Bogomolnaia, A., Jackson, M.O.: The stability of hedonic coalition structures. Games and Economic Behavior 38(2), 201–230 (2002)

    Article  MATH  MathSciNet  Google Scholar 

  7. Cechlárová: Stable partition problem. In: Encyclopedia of Algorithms, pp. 885–888 (2008)

    Google Scholar 

  8. Gairing, M., Savani, R.: Computing stable outcomes in hedonic games. In: Kontogiannis, S., Koutsoupias, E., Spirakis, P.G. (eds.) SAGT 2010. LNCS, vol. 6386, pp. 174–185. Springer, Heidelberg (2010)

    Chapter  Google Scholar 

  9. Hoefer, M.: Cost sharing and clustering under distributed competition, Ph.D. Thesis, University of Konstanz (2007)

    Google Scholar 

  10. Janovskaya, E.: Equilibrium points in polymatrix games. Litovskii Matematicheskii Sbornik 8, 381–384 (1968)

    MATH  MathSciNet  Google Scholar 

  11. Monderer, D., Shapley, L.S.: Potential games. Games and Economic Behaviour 14, 124–143 (1996)

    Article  MATH  MathSciNet  Google Scholar 

  12. Rozenfeld, O., Tennenholtz, M.: Strong and correlated strong equilibria in monotone congestion games. In: Spirakis, P., Mavronicolas, M., Kontogiannis, S. (eds.) WINE 2006. LNCS, vol. 4286, pp. 74–86. Springer, Heidelberg (2006)

    Chapter  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Centre for Mathematics and Computer Science (CWI), Amsterdam, The Netherlands

    Krzysztof R. Apt, Mona Rahn & Guido Schäfer

  2. ILLC, University of Amsterdam, The Netherlands

    Krzysztof R. Apt

  3. VU University Amsterdam, The Netherlands

    Guido Schäfer

  4. IIT Kanpur, Kanpur, India

    Sunil Simon

Authors
  1. Krzysztof R. Apt
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Mona Rahn
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Guido Schäfer
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Sunil Simon
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Microsoft Research, Haidian District, 100080, Beijing, China

    Tie-Yan Liu

  2. The Hong Kong University of Science and Technology, Kowloon, Hong Kong

    Qi Qi

  3. Deptartment of Management Science and Engineering, Stanford University, 94305-4121, Stanford, CA, USA

    Yinyu Ye

Rights and permissions

Reprints and permissions

Copyright information

© 2014 Springer International Publishing Switzerland

About this paper

Cite this paper

Apt, K.R., Rahn, M., Schäfer, G., Simon, S. (2014). Coordination Games on Graphs (Extended Abstract). In: Liu, TY., Qi, Q., Ye, Y. (eds) Web and Internet Economics. WINE 2014. Lecture Notes in Computer Science, vol 8877. Springer, Cham. https://doi.org/10.1007/978-3-319-13129-0_37

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-13129-0_37

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-13128-3

  • Online ISBN: 978-3-319-13129-0

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation