Rahwan, Talal and Michalak, Tomasz and Elkind, Edith and Faliszewski, Piotr and Sroka, Jacek and Wooldridge, Michael and Jennings, Nicholas R (2011) Constrained Coalition Formation. In: Proc. 25th Conference on AI (AAAI), 7-11 August 2011, San Francisco, USA . (In Press)
![[img]](../../style/images/fileicons/other.png)
|
PDF
Download (5Mb) | Preview |
Abstract
The conventional model of coalition formation considers every possible subset of agents as a potential coalition. However, in many real-world applications, there are inherent constraints on feasible coalitions: for instance, certain agents may be prohibited from being in the same coalition, or the coalition structure may be required to consist of coalitions of the same size. In this paper, we present the first systematic study of constrained coalition formation (CCF). We propose a general framework for this problem, and identify an important class of CCF settings, where the constraints specify which groups of agents should/should not work together. We describe a procedure that transforms such constraints into a structured input that allows coalition formation algorithms to identify, without any redundant computations, all the feasible coalitions. We then use this procedure to develop an algorithm for generating an optimal (welfare-maximizing) constrained coalition structure, and show that it outperforms existing state-of-the-art approaches by several orders of magnitude.
| Item Type: | Conference or Workshop Item (Paper) |
|---|---|
| Subjects: | Topics > Agent-based Computing Work Areas > Agile Teaming |
| Divisions: | University of Southampton |
| Depositing User: | Angela Westley |
| Date Deposited: | 10 Aug 2011 10:26 |
| Last Modified: | 17 Apr 2012 08:42 |
| URI: | http://www.orchid.ac.uk/eprints/id/eprint/6 |
Actions (login required)
 |
View Item |
