TY - GEN
T1 - Easy and hard coalition resource game formation problems - A parameterized complexity analysis
AU - Shrot, Tammar
AU - Aumann, Yonatan
AU - Kraus, Sarit
PY - 2009
Y1 - 2009
N2 - Coalition formation is a key topic in multi-agent systems (MAS). Coalitions enable agents to achieve goals that they may not have been able to achieve independently, and encourages resource sharing among agents with different goals. A range of previous studies have found that problems in coalitional games tend to be computationally complex. However, such hardness results consider the entire input as one, ignoring any structural information on the instances. In the case of coalition formation problems, this bundles together several distinct elements of the input, e.g. the agent set, the goal set, the resources, etc. In this paper we reexamine the complexity of coalition formation problems in the coalition resources game model, as a function of their distinct input elements, using the theory of parameterized complexity. The analysis shows that not all parts of the input are created equal, and that many instances of the problem are actually tractable. We show that the problems are TVT in the number of goals, implying that if the number of goals is bounded then an efficient algorithm is available. Similarly, the problems are FVT in the combination of the number of agents and resources, again implying that if these parameters are bounded, then an efficient algorithm is available. On the other hand, the problems are para-ATV hard in the number of resources, implying that even if we bound the number of resources the problems (probably) remain hard. Additionally, we show that most problems are W[l]-hard in the size of the coalition of interest, indicating that there is (probably) no algorithm polynomial in all but the coalition size. The exact definitions of the parameterized complexity notions !FVT, Para-NV and VV[1] are provided herein. Categories and Subject Descriptors F.2 [Theory of Computation]: Analysis of Algorithms and Problem Complexity; I.2.11[Artificial Intelligence]: Distributed Artificial Intelligence - Multiagent Systems General Terms Algorithms, Theory.
AB - Coalition formation is a key topic in multi-agent systems (MAS). Coalitions enable agents to achieve goals that they may not have been able to achieve independently, and encourages resource sharing among agents with different goals. A range of previous studies have found that problems in coalitional games tend to be computationally complex. However, such hardness results consider the entire input as one, ignoring any structural information on the instances. In the case of coalition formation problems, this bundles together several distinct elements of the input, e.g. the agent set, the goal set, the resources, etc. In this paper we reexamine the complexity of coalition formation problems in the coalition resources game model, as a function of their distinct input elements, using the theory of parameterized complexity. The analysis shows that not all parts of the input are created equal, and that many instances of the problem are actually tractable. We show that the problems are TVT in the number of goals, implying that if the number of goals is bounded then an efficient algorithm is available. Similarly, the problems are FVT in the combination of the number of agents and resources, again implying that if these parameters are bounded, then an efficient algorithm is available. On the other hand, the problems are para-ATV hard in the number of resources, implying that even if we bound the number of resources the problems (probably) remain hard. Additionally, we show that most problems are W[l]-hard in the size of the coalition of interest, indicating that there is (probably) no algorithm polynomial in all but the coalition size. The exact definitions of the parameterized complexity notions !FVT, Para-NV and VV[1] are provided herein. Categories and Subject Descriptors F.2 [Theory of Computation]: Analysis of Algorithms and Problem Complexity; I.2.11[Artificial Intelligence]: Distributed Artificial Intelligence - Multiagent Systems General Terms Algorithms, Theory.
KW - Coalition problems
KW - Parameterized complexity
UR - http://www.scopus.com/inward/record.url?scp=84899862264&partnerID=8YFLogxK
M3 - ???researchoutput.researchoutputtypes.contributiontobookanthology.conference???
AN - SCOPUS:84899862264
SN - 9781615673346
T3 - Proceedings of the International Joint Conference on Autonomous Agents and Multiagent Systems, AAMAS
SP - 284
EP - 291
BT - 8th International Joint Conference on Autonomous Agents and Multiagent Systems 2009, AAMAS 2009
PB - International Foundation for Autonomous Agents and Multiagent Systems (IFAAMAS)
T2 - 8th International Joint Conference on Autonomous Agents and Multiagent Systems 2009, AAMAS 2009
Y2 - 10 May 2009 through 15 May 2009
ER -