Abstract
One research challenge in multi-agent systems is how to partition a set of agent into coalition structures. The number of different coalitions for a set of agents grows exponential with the number of agents and the number of different partitions grows even faster. The common approach for this problem is to search for the coalition structure that maximizes the system outcome (denoted CS *). Until recently, most algorithms that solve this problem considered that the value of a coalition is given by a characteristic function, in where those values are not influenced by factors that are external to the coalition. More recently, several authors have focused on problems that consider the presence of externalities. In this case, centralized algorithms were developed to search for the CS *, but no algorithm was developed to work in a distributed environment. This paper presents a distributed algorithm for searching coalition structures under presence of externalities.
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
Sandholm, T., Larson, K., Andersson, M., Shehory, O., Tohmé, F.: Coalition structure generation with worst case guarantees. Artificial Intelligence (1999)
Rahwan, T., Michalak, T., Wooldridge, M., Jennings, N.R.: Anytime coalition structure generation in multi-agent systems with positive or negative externalities. Artificial Intelligence 186, 95–122 (2012)
Finus, M., Rundshagen, B.: Endogenous coalition formation in global pollution control: a partition function approach. In: The Endogenous Formation of Economic Coalitions, pp. 199–243. Edward Elgar, Cheltenham (2003)
Catilina, E., Feinberg, R.: Market power and incentives to form research consortia. Review of Industrial Organization 28(2), 129–144 (2006)
Koczy, L.A.: A recursive core for partition function form games. Research Memoranda 031 (2006)
Rahwan, T., Jennings, N.R.: An algorithm for distributing coalitional value calculations among cooperating agents. Artificial Intelligence 8(171), 535–567 (2007)
Rahwan, T., Ramchurn, S.D., Dang, V.D., Jennings, N.R.: Near-optimal anytime coalition structure generation. In: Proc. of the Int. Joint Conf. on Art. Intelligence (IJCAI 2007), pp. 2365–2371 (January 2007)
Rahwan, T., Ramchurn, S.D., Jennings, N.R., Giovannucci, A.: An anytime algorithm for optimal coalition structure generation. J. Artif. Int. Res. 34, 521–567 (2009)
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 (2010)
Shehory, O., Kraus, S.: Methods for task allocation via agent coalition formation. Artificial Intelligence 101(1-2), 165–200 (1998)
Michalak, T., Dowell, A., McBurney, P., Wooldridge, M.: Optimal coalition structure generation in partition function games. In: Proceeding of the 2008 Conference on ECAI 2008: 18th European Conference on Artificial Intelligence (2008)
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
Epstein, D., Bazzan, A.L.C. (2013). Distributed Coalition Structure Generation with Positive and Negative Externalities. In: Correia, L., Reis, L.P., Cascalho, J. (eds) Progress in Artificial Intelligence. EPIA 2013. Lecture Notes in Computer Science(), vol 8154. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-40669-0_35
Download citation
DOI: https://doi.org/10.1007/978-3-642-40669-0_35
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-40668-3
Online ISBN: 978-3-642-40669-0
eBook Packages: Computer ScienceComputer Science (R0)