Skip to main content

Coalition Structure Generation for Partition Function Games Utilizing a Concise Graphical Representation

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

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

Abstract

Coalition Structure Generation (CSG), a main research issue in the domain of coalition games, involves partitioning agents into exhaustive and disjoint coalitions to optimize the social welfare. The advent of compact representation schemes, such as Partition Decision Trees (PDTs), promotes the efficiency of solving CSG problems.

This paper studies the CSG problem for partition function games (PFGs) which are coalitional games with externalities. In PFGs, each value of a coalition depends on how the other agents are partitioned. We apply PDTs to represent PFGs and present two methods to solve CSG problems: a depth-first branch-and-bound algorithm and MaxSAT encoding.

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 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

Institutional subscriptions

Notes

  1. 1.

    This corresponds to the space searched for by the solver.

References

  1. Chalkiadakis, G., Elkind, E., Wooldridge, M.: Computational Aspects of Cooperative Game Theory. Morgan and Claypool Publishers, San Rafael (2011)

    MATH  Google Scholar 

  2. Cook, S.A.: The Complexity of theorem-proving procedures. In: Harrison, M.A., Banerji, R.B., Ullman, J.D. (eds.) Proceedings of the 3rd Annual ACM Symposium on Theory of Computing, 3–5 May 1971, Shaker Heights, Ohio, USA, pp. 151–158. ACM (1971)

    Google Scholar 

  3. Dang, V.D., Dash, R.K., Rogers, A., Jennings, N.R.: Overlapping coalition formation for efficient data fusion in multi-sensor networks. In: Proceedings of the 21st National Conference on Artificial Intelligence (AAAI), pp. 635–640 (2006)

    Google Scholar 

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

    Google Scholar 

  5. Koshimura, M., Zhang, T., Fujita, H., Hasegawa, R.: QMaxSAT: A Partial Max-SAT Solver. JSAT 8(1/2), 95–100 (2012)

    MathSciNet  MATH  Google Scholar 

  6. 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 

  7. 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, Athens, Greece, 7–9 November 2012, pp. 910–915. IEEE Computer Society (2012)

    Google Scholar 

  8. Liao, X., Koshimura, M., Fujita, H., Hasegawa, R.: Extending MaxSAT to solve the coalition structure generation problem with externalities based on agent relations. IEICE Trans. 97–D(7), 1812–1821 (2014)

    Article  Google Scholar 

  9. Liao, X., Koshimura, M., Fujita, H., Hasegawa, R.: MaxSAT encoding for MC-net-based coalition structure generation problem with externalities. IEICE Trans. 97–D(7), 1781–1789 (2014)

    Article  Google Scholar 

  10. Michalak, T., Rahwan, T., Marciniak, D., Szamotulski, M., Jennings, N.: Computational aspects of extending the shapley value to coalitional games with externalities. In: ECAI, pp. 197–202 (2010)

    Google Scholar 

  11. Michalak, T.P., Marciniak, D., Szamotulski, M., Rahwan, T., Wooldridge, M., McBurney, P., Jennings, N.R.: A logic-based representation for coalitional games with externalities. In: Proceedings of the 9th International Conference on Autonomous Agents and Multiagent Systems (AAMAS), pp. 125–132 (2010)

    Google Scholar 

  12. 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). doi:10.1007/978-3-642-04244-7_49

    Chapter  Google Scholar 

  13. Rahwan, T., Michalak, T.P., Jennings, N.R., Wooldridge, M., McBurney, P.: Coalition structure generation in multi-agent systems with positive and negative externalities. In: Proceedings of the 21st International Joint Conference on Artificial Intelligence (IJCAI), pp. 257–263 (2009)

    Google Scholar 

  14. 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  MATH  Google Scholar 

  15. Sandholm, T., Lesser, V.R.: Coalitions among computationally bounded agents. Artif. Intell. 94(1–2), 99–137 (1997)

    Article  MathSciNet  MATH  Google Scholar 

  16. Skibski, O., Michalak, T., Sakurai, Y., Wooldridge, M., Yokoo, M.: A Graphical Representation for Games in Partition Function Form. In: Proceedings of the Twenty-Ninth AAAI Conference on Artificial Intelligence, pp. 1036–1042 (2015)

    Google Scholar 

  17. Thrall, R.M., Lucas, W.F.: N-Person games in partition function form. Naval Res. Logistics Q. 10(1), 281–298 (1963)

    Article  MathSciNet  MATH  Google Scholar 

  18. 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 the 11th International Conference on Autonomous Agents and Multiagent Systems (AAMAS), pp. 795–804 (2012)

    Google Scholar 

  19. Yeh, D.Y.: A dynamic programming approach to the complete set partitioning problem. BIT Numer. Math. 26(4), 467–474 (1986)

    Article  MathSciNet  MATH  Google Scholar 

Download references

Acknowledgment

This work was supported by JSPS KAKENHI Grant Numbers JP16K00304, JP17K00307, JP17H00761, JP15H02751.

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Aolong Zha .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2017 Springer International Publishing AG

About this paper

Cite this paper

Zha, A., Nomoto, K., Ueda, S., Koshimura, M., Sakurai, Y., Yokoo, M. (2017). Coalition Structure Generation for Partition Function Games Utilizing a Concise Graphical Representation. In: An, B., Bazzan, A., Leite, J., Villata, S., van der Torre, L. (eds) PRIMA 2017: Principles and Practice of Multi-Agent Systems. PRIMA 2017. Lecture Notes in Computer Science(), vol 10621. Springer, Cham. https://doi.org/10.1007/978-3-319-69131-2_9

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-69131-2_9

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-69130-5

  • Online ISBN: 978-3-319-69131-2

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics