Skip to main content
SpringerLink
Log in

Solving Coalition Structure Generation Problems over Weighted Graph

  • Conference paper
  • First Online:
PRIMA 2019: Principles and Practice of Multi-Agent Systems (PRIMA 2019)

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 11873))

Abstract

Coalition Structure Generation (CSG), which is a leading research issue in the domain of coalitional games, divides agents into exhaustive and disjoint coalitions to optimize social welfare. This paper studies CSG problems over weighted undirected graphs in which the weight on an edge between any two connecting agents represents how well they work together in a coalition. The weight can have either a positive or a negative value. We examine two types of problems. One is a CSG without any restrictions on the number of coalitions, and another is a CSG with k coalitions where k is determined in advance. We present two methods to solve these problems: ILP formulation and MaxSAT encoding.

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 84.99
Price excludes VAT (USA)
  • Available as EPUB and 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

Notes

  1. 1.

    In the search, we only examine components connected by edges with positive weights.

References

  1. Amer, R., Giménez, J.M.: A connectivity game for graphs. Math. Oper. Res. (MOR) 60(3), 453–470 (2004). https://doi.org/10.1007/s001860400356

    Article  MathSciNet  MATH  Google Scholar 

  2. Bachrach, Y., Kohli, P., Kolmogorov, V., Zadimoghaddam, M.: Optimal coalition structure generation in cooperative graph games. In: Proceedings of the 27th AAAI Conference on Artificial Intelligence (AAAI-2013), pp. 81–87 (2013)

    Google Scholar 

  3. Berg, J., Järvisalo, M.: Cost-optimal constrained correlation clustering via weighted partial Maximum Satisfiability. Artif. Intell. 244, 110–142 (2017)

    Article  MathSciNet  Google Scholar 

  4. Conitzer, V., Sandholm, T.: Complexity of constructing solutions in the core based on synergies among coalitions. Artif. Intell. 170(6), 607–619 (2006)

    Article  MathSciNet  Google Scholar 

  5. Cook, S.A.: The complexity of theorem-proving procedures. In: Proceedings of the 3rd Annual ACM Symposium on Theory of Computing, pp. 151–158 (1971)

    Google Scholar 

  6. Davies, J., Bacchus, F.: Exploiting the Power of mip Solvers in maxsat. In: Järvisalo, M., Van Gelder, A. (eds.) SAT 2013. LNCS, vol. 7962, pp. 166–181. Springer, Heidelberg (2013). https://doi.org/10.1007/978-3-642-39071-5_13

    Chapter  MATH  Google Scholar 

  7. Deng, X., Papadimitriou, C.H.: On the complexity of cooperative solution concepts. MOR 19(2), 257–266 (1994)

    Article  MathSciNet  Google Scholar 

  8. Gent, I.P.: A symmetry breaking constraint for indistinguishable values. In: In Proceedings of the 1st International Workshop on Symmetry in Constraint Satisfaction Problems, pp. 469–473 (2001)

    Google Scholar 

  9. Goldschmidt, O., Hochbaum, D.S.: A polynomial algorithm for the k-cut problem for fixed k. MOR 19(1), 24–37 (1994)

    Article  MathSciNet  Google Scholar 

  10. Grötschel, M., Wakabayashi, Y.: A cutting plane algorithm for a clustering problem. Math. Program. 45(1–3), 59–96 (1989). https://doi.org/10.1007/BF01589097

    Article  MathSciNet  MATH  Google Scholar 

  11. Ieong, S., Shoham, Y.: Marginal contribution nets: a compact representation scheme for coalitional games. In: Proceedings of the 6th ACM Conference on Electronic Commerce (EC-2005), pp. 193–202 (2005)

    Google Scholar 

  12. Ignatiev, A., Morgado, A., Marques-Silva, J.: PySAT: a Python toolkit for prototyping with SAT oracles. In: Beyersdorff, O., Wintersteiger, C.M. (eds.) SAT 2018. LNCS, vol. 10929, pp. 428–437. Springer, Cham (2018). https://doi.org/10.1007/978-3-319-94144-8_26

    Chapter  MATH  Google Scholar 

  13. Kumar, S., Spezzano, F., Subrahmanian, V.S., Faloutsos, C.: Edge weight prediction in weighted signed networks. In: Proceedings of IEEE 16th International Conference on Data Mining (ICDM-2016), pp. 221–230 (2016)

    Google Scholar 

  14. Li, C.M., Manyà, F.: MaxSAT, hard and soft constraints. In: Biere, A., Heule, M., van Maaren, H., Walsh, T. (eds.) Handbook of Satisfiability, Frontiers in Artificial Intelligence and Applications, vol. 185, pp. 613–631. IOS Press, Amsterdam (2009)

    Google Scholar 

  15. Liao, X., Koshimura, M., Fujita, H., Hasegawa, R.: Solving the coalition structure generation problem with MaxSAT. In: IEEE 24th International Conference on Tools with Artificial Intelligence (ICTAI-2012), pp. 910–915 (2012)

    Google Scholar 

  16. Liao, X., Koshimura, M., Nomoto, K., Ueda, S., Sakurai, Y., Yokoo, M.: Improved WPM encoding for coalition structure generation under MC-nets. Constraints 24, 25–55 (2019). https://doi.org/10.1007/s10601-018-9295-4

    Article  MathSciNet  Google Scholar 

  17. Miyauchi, A., Sonobe, T., Sukegawa, N.: Exact clustering via integer programming and maximum satisfiability. In: Proceedings of AAAI-18, pp. 1387–1394 (2018)

    Google Scholar 

  18. Myerson, R.B.: Graphs and cooperation in games. MOR 2(3), 225–229 (1977)

    Article  MathSciNet  Google Scholar 

  19. Ohta, N., Conitzer, V., Ichimura, R., Sakurai, Y., Iwasaki, A., Yokoo, M.: Coalition structure generation utilizing compact characteristic function representations. In: Gent, I.P. (ed.) CP 2009. LNCS, vol. 5732, pp. 623–638. Springer, Heidelberg (2009). https://doi.org/10.1007/978-3-642-04244-7_49

    Chapter  Google Scholar 

  20. Rahwan, T., Michalak, T.P., Wooldridge, M., Jennings, N.R.: Coalition structure generation: a survey. Artif. Intell. 229, 139–174 (2015)

    Article  MathSciNet  Google Scholar 

  21. Sakurai, Y., Ueda, S., Iwasaki, A., Minato, S.-I., Yokoo, M.: A compact representation scheme of coalitional games based on multi-terminal zero-suppressed binary decision diagrams. In: Kinny, D., Hsu, J.Y., Governatori, G., Ghose, A.K. (eds.) PRIMA 2011. LNCS (LNAI), vol. 7047, pp. 4–18. Springer, Heidelberg (2011). https://doi.org/10.1007/978-3-642-25044-6_4

    Chapter  Google Scholar 

  22. Sandholm, T., Larson, K., Andersson, M., Shehory, O., Tohmé, F.: Coalition structure generation with worst case guarantees. Artif. Intell. 111(1–2), 209–238 (1999)

    Article  MathSciNet  Google Scholar 

  23. Sless, L., Hazon, N., Kraus, S., Wooldridge, M.: Forming k coalitions and facilitating relationships in social networks. Artif. Intell. 259, 217–245 (2018)

    Article  MathSciNet  Google Scholar 

  24. Ueda, S., Hasegawa, T., Hashimoto, N., Ohta, N., Iwasaki, A., Yokoo, M.: Handling negative value rules in MC-net-based coalition structure generation. In: Proceedings of AAMAS-2012, pp. 795–804 (2012)

    Google Scholar 

  25. Ueda, S., Kitaki, M., Iwasaki, A., Yokoo, M.: Concise characteristic function representations in coalitional games based on agent types. In: Proceedings of the 22nd International Joint Conference on Artificial Intelligence (IJCAI-2011), pp. 393–399 (2011)

    Google Scholar 

  26. Voice, T., Ramchurn, S.D., Jennings, N.R.: On coalition formation with sparse synergies. In: Proceedings of AAMAS-2012, pp. 223–230 (2012)

    Google Scholar 

  27. West, R., Paskov, H.S., Leskovec, J., Potts, C.: Exploiting social network structure for person-to-person sentiment analysis. Trans. Assoc. Comput. Linguist. 2, 297–310 (2014)

    Article  Google Scholar 

Download references

Acknowledgment

This work was supported by JSPS KAKENHI Grant Numbers JP17H00761, JP17KK0008, JP19H04175, by JST SICORP JPMJSC1607, and by Kayamori Foundation of Informational Science Advancement.

Author information

Authors and Affiliations

  1. Kyushu University, Fukuoka, Japan

    Emi Watanabe, Miyuki Koshimura & Makoto Yokoo

  2. National Institute of Advanced Industrial Science and Technology, Tsukuba, Japan

    Yuko Sakurai

  3. RIKEN Center for Advanced Intelligence Project (AIP), Tokyo, Japan

    Makoto Yokoo

Authors
  1. Emi Watanabe
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Miyuki Koshimura
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Yuko Sakurai
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Makoto Yokoo
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Emi Watanabe .

Editor information

Editors and Affiliations

  1. Università degli Studi di Torino, Turin, Italy

    Matteo Baldoni

  2. Utrecht University, Utrecht, The Netherlands

    Mehdi Dastani

  3. Zhejiang University, Hangzhou, China

    Beishui Liao

  4. National Institute of Advanced Industrial Science and Technology, Tokyo, Japan

    Yuko Sakurai

  5. University of Texas at Dallas, Richardson, TX, USA

    Rym Zalila Wenkstern

Rights and permissions

Reprints and permissions

Copyright information

© 2019 Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Watanabe, E., Koshimura, M., Sakurai, Y., Yokoo, M. (2019). Solving Coalition Structure Generation Problems over Weighted Graph. In: Baldoni, M., Dastani, M., Liao, B., Sakurai, Y., Zalila Wenkstern, R. (eds) PRIMA 2019: Principles and Practice of Multi-Agent Systems. PRIMA 2019. Lecture Notes in Computer Science(), vol 11873. Springer, Cham. https://doi.org/10.1007/978-3-030-33792-6_21

Download citation

  • DOI: https://doi.org/10.1007/978-3-030-33792-6_21

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-030-33791-9

  • Online ISBN: 978-3-030-33792-6

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation