Skip to main content
SpringerLink
Log in
Book cover

International Computing and Combinatorics Conference

COCOON 2018: Computing and Combinatorics pp 268–279Cite as

Generalized Graph k-Coloring Games

  • Conference paper
  • First Online:

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 10976))

Abstract

We investigate pure Nash equilibria in generalized graph k-coloring games where we are given an edge-weighted undirected graph together with a set of k colors. Nodes represent players and edges capture their mutual interests. The strategy set of each player consists of k colors. The utility of a player v in a given state or coloring is given by the sum of the weights of edges \(\{v,u\}\) incident to v such that the color chosen by v is different than the one chosen by u, plus the profit gained by using the chosen color. Such games form some of the basic payoff structures in game theory, model lots of real-world scenarios with selfish players and extend or are related to several fundamental class of games.

We first show that generalized graph k-coloring games are potential games. In particular, they are convergent and thus Nash Equilibria always exist. We then evaluate their performance by means of the widely used notions of price of anarchy and price of stability and provide tight bounds for two natural and widely used social welfare, i.e., utilitarian and egalitarian social welfare.

This is a preview of subscription content, 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 EPUB and 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

Learn about institutional subscriptions

References

  1. Aharoni, R., Milner, E., Prikry, K.: Unfriendly partitions of a graph. J. Comb. Theory Ser. B 50(1), 1–10 (1990)

    Article  MathSciNet  Google Scholar 

  2. Andelman, N., Feldman, M., Mansour, Y.: Strong price of anarchy. Games Econ. Behav. 65(2), 289–317 (2009)

    Article  MathSciNet  Google Scholar 

  3. Anshelevich, E., Dasgupta, A., Kleinberg, J.M., Tardos, É., Wexler, T., Roughgarden, T.: The price of stability for network design with fair cost allocation. In: Proceedings of the 45th Symposium on Foundations of Computer Science, FOCS, pp. 295–304 (2004)

    Google Scholar 

  4. Apt, K.R., Rahn, M., Schäfer, G., Simon, S.: Coordination games on graphs (extended abstract). In: Liu, T.-Y., Qi, Q., Ye, Y. (eds.) WINE 2014. LNCS, vol. 8877, pp. 441–446. Springer, Cham (2014). https://doi.org/10.1007/978-3-319-13129-0_37

    Chapter  Google Scholar 

  5. Apt, K.R., Simon, S., Wojtczak, D.: Coordination games on directed graphs. In: Proceedings Fifteenth Conference on Theoretical Aspects of Rationality and Knowledge, TARK, pp. 67–80 (2015)

    Article  MathSciNet  Google Scholar 

  6. 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 (1959)

    Google Scholar 

  7. Aziz, H., Gaspers, S., Gudmundsson, J., Mestre, J., Täubig, H.: Welfare maximization in fractional hedonic games. In: Proceedings of the Twenty-Fourth International Joint Conference on Artificial Intelligence, IJCAI, pp. 461–467 (2015)

    Google Scholar 

  8. Aziz, H., Savani, R., Moulin, H.: Hedonic Games, pp. 356–376. Cambridge University Press, Cambridge (2016)

    Google Scholar 

  9. Bazgan, C., Tuza, Z., Vanderpooten, D.: Satisfactory graph partition, variants, and generalizations. Eur. J. Oper. Res. 206(2), 271–280 (2010)

    Article  MathSciNet  Google Scholar 

  10. Bhalgat, A., Chakraborty, T., Khanna, S.: Approximating pure nash equilibrium in cut, party affiliation, and satisfiability games. In: Proceedings 11th ACM Conference on Electronic Commerce, EC, pp. 73–82 (2010)

    Google Scholar 

  11. Bilò, V., Fanelli, A., Flammini, M., Monaco, G., Moscardelli, L.: Nash stability in fractional hedonic games. In: Liu, T.-Y., Qi, Q., Ye, Y. (eds.) WINE 2014. LNCS, vol. 8877, pp. 486–491. Springer, Cham (2014). https://doi.org/10.1007/978-3-319-13129-0_44

    Chapter  Google Scholar 

  12. Bilò, V., Fanelli, A., Flammini, M., Monaco, G., Moscardelli, L.: On the price of stability of fractional hedonic games. In: Proceedings of the 2015 International Conference on Autonomous Agents and Multiagent Systems, AAMAS, pp. 1239–1247 (2015)

    Google Scholar 

  13. Carosi, R., Flammini, M., Monaco, G.: Computing approximate pure nash equilibria in digraph k-coloring games. In: Proceedings of the 16th Conference on Autonomous Agents and MultiAgent Systems, AAMAS, pp. 911–919 (2017)

    Google Scholar 

  14. Christodoulou, G., Koutsoupias, E.: The price of anarchy of finite congestion games. In: Proceedings of the 37th Annual ACM Symposium on Theory of Computing, STOC, pp. 67–73 (2005)

    Google Scholar 

  15. Feldman, M., Friedler, O.: A unified framework for strong price of anarchy in clustering games. In: Halldórsson, M.M., Iwama, K., Kobayashi, N., Speckmann, B. (eds.) ICALP 2015. LNCS, vol. 9135, pp. 601–613. Springer, Heidelberg (2015). https://doi.org/10.1007/978-3-662-47666-6_48

    Chapter  Google Scholar 

  16. Feldman, M., Lewin-Eytan, L., Naor, J.S.: Hedonic clustering games. ACM Trans. Parallel Comput. 2(1), 4:1–4:48 (2015)

    Article  Google Scholar 

  17. 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). https://doi.org/10.1007/978-3-642-16170-4_16

    Chapter  Google Scholar 

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

    Google Scholar 

  19. Kliemann, L., Sheykhdarabadi, E.S., Srivastav, A.: Price of anarchy for graph coloring games with concave payoff. J. Dyn. Games 4(1), 41–58 (2017)

    MathSciNet  MATH  Google Scholar 

  20. Koutsoupias, E., Papadimitriou, C.: Worst-Case equilibria. In: Meinel, C., Tison, S. (eds.) STACS 1999. LNCS, vol. 1563, pp. 404–413. Springer, Heidelberg (1999). https://doi.org/10.1007/3-540-49116-3_38

    Chapter  Google Scholar 

  21. Kun, J., Powers, B., Reyzin, L.: Anti-coordination games and stable graph colorings. In: Vöcking, B. (ed.) SAGT 2013. LNCS, vol. 8146, pp. 122–133. Springer, Heidelberg (2013). https://doi.org/10.1007/978-3-642-41392-6_11

    Chapter  Google Scholar 

  22. Monderer, D., Shapley, L.S.: Potential games. Games Econ. Behav. 14(1), 124–143 (1996)

    Article  MathSciNet  Google Scholar 

  23. Nguyen, N., Nguyen, T.T., Roos, M., Rothe, J.: Complexity and approximability of social welfare optimization in multiagent resource allocation. In: International Conference on Autonomous Agents and Multiagent Systems, AAMAS, pp. 1287–1288 (2012)

    Google Scholar 

  24. Panagopoulou, P.N., Spirakis, P.G.: A game theoretic approach for efficient graph coloring. In: Hong, S.-H., Nagamochi, H., Fukunaga, T. (eds.) ISAAC 2008. LNCS, vol. 5369, pp. 183–195. Springer, Heidelberg (2008). https://doi.org/10.1007/978-3-540-92182-0_19

    Chapter  Google Scholar 

  25. Schäffer, A.A., Yannakakis, M.: Simple local search problems that are hard to solve. SIAM J. Comput. 20(1), 56–87 (1991)

    Article  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Gran Sasso Science Institute, L’Aquila, Italy

    Raffaello Carosi

  2. DISIM - University of L’Aquila, L’Aquila, Italy

    Gianpiero Monaco

Authors
  1. Raffaello Carosi
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Gianpiero Monaco
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding authors

Correspondence to Raffaello Carosi or Gianpiero Monaco .

Editor information

Editors and Affiliations

  1. City University of Hong Kong, Hong Kong, China

    Lusheng Wang

  2. Shandong University, Jinan, China

    Daming Zhu

Rights and permissions

Reprints and permissions

Copyright information

© 2018 Springer International Publishing AG, part of Springer Nature

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Carosi, R., Monaco, G. (2018). Generalized Graph k-Coloring Games. In: Wang, L., Zhu, D. (eds) Computing and Combinatorics. COCOON 2018. Lecture Notes in Computer Science(), vol 10976. Springer, Cham. https://doi.org/10.1007/978-3-319-94776-1_23

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-94776-1_23

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-94775-4

  • Online ISBN: 978-3-319-94776-1

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation