Abstract
Motivated by understanding non-strict and strict pure strategy equilibria in network anti-coordination games, we define notions of stable and, respectively, strictly stable colorings in graphs. We characterize the cases when such colorings exist and when the decision problem is NP-hard. These correspond to finding pure strategy equilibria in the anti-coordination games, whose price of anarchy we also analyze. We further consider the directed case, a generalization that captures both coordination and anti-coordination. We prove the decision problem for non-strict equilibria in directed graphs is NP-hard. Our notions also have multiple connections to other combinatorial questions, and our results resolve some open problems in these areas, most notably the complexity of the strictly unfriendly partition problem.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Aharoni, R., Milner, E.C., Prikry, K.: Unfriendly partitions of a graph. J. Comb. Theory, Ser. B 50(1), 1–10 (1990)
Bazgan, C., Tuza, Z., Vanderpooten, D.: Satisfactory graph partition, variants, and generalizations. Eur. J. Oper. Res. 206(2), 271–280 (2010)
Bramoullé, Y., López-Pintado, D., Goyal, S., Vega-Redondo, F.: Network formation and anti-coordination games. Int. J. Game Theory 33(1), 1–19 (2004)
Bruhn, H., Diestel, R., Georgakopoulos, A., Sprüssel, P.: Every rayless graph has an unfriendly partition. Combinatorica 30(5), 521–532 (2010)
Cao, Z., Yang, X.: The fashion game: Matching pennies on social networks. In: SSRN (2012)
Chatzigiannakis, I., Koninis, C., Panagopoulou, P.N., Spirakis, P.G.: Distributed game-theoretic vertex coloring. In: Lu, C., Masuzawa, T., Mosbah, M. (eds.) OPODIS 2010. LNCS, vol. 6490, pp. 103–118. Springer, Heidelberg (2010)
Chaudhuri, K., Chung Graham, F., Jamall, M.S.: A network coloring game. In: Papadimitriou, C., Zhang, S. (eds.) WINE 2008. LNCS, vol. 5385, pp. 522–530. Springer, Heidelberg (2008)
Cowen, R., Emerson, W.: Proportional colorings of graphs (unpublished)
Elsässer, R., Tscheuschner, T.: Settling the complexity of local max-cut (Almost) completely. In: Aceto, L., Henzinger, M., Sgall, J. (eds.) ICALP 2011, Part I. LNCS, vol. 6755, pp. 171–182. Springer, Heidelberg (2011)
Escoffier, B., Gourvès, L., Monnot, J.: Strategic coloring of a graph. In: Calamoneri, T., Diaz, J. (eds.) CIAC 2010. LNCS, vol. 6078, pp. 155–166. Springer, Heidelberg (2010)
Fotakis, D., Kontogiannis, S., Koutsoupias, E., Mavronicolas, M., Spirakis, P.G.: The structure and complexity of nash equilibria for a selfish routing game. In: Widmayer, P., Triguero, F., Morales, R., Hennessy, M., Eidenbenz, S., Conejo, R. (eds.) ICALP 2002. LNCS, vol. 2380, pp. 123–134. Springer, Heidelberg (2002)
Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman & Co., New York (1979)
Gourvès, L., Monnot, J.: On strong equilibria in the max cut game. In: Leonardi, S. (ed.) WINE 2009. LNCS, vol. 5929, pp. 608–615. Springer, Heidelberg (2009)
Hoefer, M.: Cost sharing and clustering under distributed competition. PhD thesis, Universität Konstanz, Germany (2007)
Kearns, M., Suri, S., Montfort, N.: A behavioral study of the coloring problem on human subject networks. Science 313, 2006 (2006)
Koutsoupias, E., Papadimitriou, C.: Worst-case equilibria. In: Meinel, C., Tison, S. (eds.) STACS 1999. LNCS, vol. 1563, pp. 404–413. Springer, Heidelberg (1999)
Monderer, D., Shapley, L.S.: Potential games. Games and Economic Behavior 14(1), 124–143 (1996)
Monien, B., Tscheuschner, T.: On the power of nodes of degree four in the local max-cut problem. In: Calamoneri, T., Diaz, J. (eds.) CIAC 2010. LNCS, vol. 6078, pp. 264–275. Springer, Heidelberg (2010)
Naor, M., Stockmeyer, L.: What can be computed locally? In: STOC 1993, pp. 184–193. ACM (1993)
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)
Roughgarden, T., Tardos, É.: How bad is selfish routing? J. ACM 49(2), 236–259 (2002)
Shafique, K., Dutton, R.D.: Partitioning a graph into alliance free sets. Discrete Mathematics 309(10), 3102–3105 (2009)
Shelah, S., Milner, E.C.: Graphs with no unfriendly partitions. A tribute to Paul Erdös, pp. 373–384 (1990)
van den Heuvel, J., Leese, R.A., Shepherd, M.A.: Graph labeling and radio channel assignment. J. Graph Theory 29(4), 263–283 (1998)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2013 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Kun, J., Powers, B., Reyzin, L. (2013). Anti-coordination Games and Stable Graph Colorings. In: Vöcking, B. (eds) Algorithmic Game Theory. SAGT 2013. Lecture Notes in Computer Science, vol 8146. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-41392-6_11
Download citation
DOI: https://doi.org/10.1007/978-3-642-41392-6_11
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-41391-9
Online ISBN: 978-3-642-41392-6
eBook Packages: Computer ScienceComputer Science (R0)