Abstract
We propose a novel, multi-agent, decentralized approach for hedonic coalition formation games useful for settings with a large number of agents. We also propose three heuristics which, can be coupled with our approach to find sub-coalitions that prefer to “bud off” from an existing coalition. We found that our approach when compared to random partition formation gives better results which further improve when it is coupled with the proposed heuristics. As matching problems are a common type of hedonic games, we have adapted our approach for two matching problems: roommate matching and bipartite matching. Our method does well for additively separable hedonic games, where finding the optimal partition is NP-hard, and gives near optimal results for matching problems.
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
References
Abdallah, S., Lesser, V.: Organization-based cooperative coalition formation. In: Proceedings of the IEEE/WIC/ACM International Conference on Intelligent Agent Technology, IAT 2004, pp. 162–168. IEEE (2004)
Aziz, H., Brandt, F., Seedig, H.G.: Optimal partitions in additively separable hedonic games. In: IJCAI Proceedings-International Joint Conference on Artificial Intelligence, vol. 22, p. 43 (2011)
Aziz, H., Brandt, F., Seedig, H.G.: Stable partitions in additively separable hedonic games. In: The 10th International Conference on Autonomous Agents and Multiagent Systems, vol. 1, pp. 183–190. International Foundation for Autonomous Agents and Multiagent Systems (2011)
Aziz, H., Brandt, F., Seedig, H.G.: Computing desirable partitions in additively separable hedonic games. Artif. Intell. 195, 316–334 (2013)
Banerjee, S., Konishi, H., Sönmez, T.: Core in a simple coalition formation game. Soc. Choice Welf. 18(1), 135–153 (2001)
Bogomolnaia, A., Jackson, M.O.: The stability of hedonic coalition structures. Games Econ. Behav. 38(2), 201–230 (2002)
Chalkiadakis, G., Boutilier, C.: Bayesian reinforcement learning for coalition formation under uncertainty. In: Proceedings of the Third International Joint Conference on Autonomous Agents and Multiagent Systems, vol. 3, pp. 1090–1097. IEEE Computer Society (2004)
Diamantoudi, E., Miyagawa, E., Xue, L.: Random paths to stability in the roommate problem. Games Econ. Behav. 48(1), 18–28 (2004)
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
Gale, D., Shapley, L.S.: College admissions and the stability of marriage. Am. Math. Mon. 69(1), 9–15 (1962)
Janovsky, P., DeLoach, S.A.: Increasing coalition stability in large-scale coalition formation with self-interested agents. In: ECAI, pp. 1606–1607 (2016)
Janovsky, P., DeLoach, S.A.: Multi-agent simulation framework for large-scale coalition formation. In: 2016 IEEE/WIC/ACM International Conference on Web Intelligence (WI), pp. 343–350. IEEE (2016)
Jiang, J.G., Zhao-Pin, S., Mei-Bin, Q., Zhang, G.F.: Multi-task coalition parallel formation strategy based on reinforcement learning. Acta Automatica Sinica 34(3), 349–352 (2008)
Li, X., Soh, L.K.: Investigating reinforcement learning in multiagent coalition formation. In: American Association for Artificial Workshop on Forming and Maintaining Coalitions and Teams in Adaptive Multiagent Systems, Technical report WS-04-06, pp. 22–28 (2004)
Michalak, T., Sroka, J., Rahwan, T., Wooldridge, M., McBurney, P., Jennings, N.R.: A distributed algorithm for anytime coalition structure generation. In: Proceedings of the 9th International Conference on Autonomous Agents and Multiagent Systems, vol. 1, pp. 1007–1014. International Foundation for Autonomous Agents and Multiagent Systems (2010)
Rahwan, T., Jennings, N.R.: An improved dynamic programming algorithm for coalition structure generation. In: Proceedings of the 7th International Joint Conference on Autonomous agents and Multiagent Systems, vol. 3, pp. 1417–1420. International Foundation for Autonomous Agents and Multiagent Systems (2008)
Rahwan, T., Ramchurn, S.D., Jennings, N.R., Giovannucci, A.: An anytime algorithm for optimal coalition structure generation. J. Artif. Intell. Res. 34, 521–567 (2009)
Richardson, M.: On finite projective games. Proc. Am. Math. Soc. 7(3), 458–465 (1956)
Roth, A.E., Vate, J.H.V.: Random paths to stability in two-sided matching. Econometrica: J. Econ. Soc. 58(6), 1475–1480 (1990)
Sandholm, T., Larson, K., Andersson, M., Shehory, O., Tohmé, F.: Anytime coalition structure generation with worst case guarantees. arXiv preprint cs/9810005 (1998)
Schlueter, J., Goldsmith, J.: Proximal stability (2018, in progress)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2019 Springer Nature Switzerland AG
About this paper
Cite this paper
Taywade, K., Goldsmith, J., Harrison, B. (2019). Decentralized Multiagent Approach for Hedonic Games. In: Slavkovik, M. (eds) Multi-Agent Systems. EUMAS 2018. Lecture Notes in Computer Science(), vol 11450. Springer, Cham. https://doi.org/10.1007/978-3-030-14174-5_15
Download citation
DOI: https://doi.org/10.1007/978-3-030-14174-5_15
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-14173-8
Online ISBN: 978-3-030-14174-5
eBook Packages: Computer ScienceComputer Science (R0)