Publication details

A Structural Approach to Activity Selection


EIBEN Eduard GANIAN Robert ORDYNIAK Sebastian

Year of publication 2018
Type Article in Proceedings
Conference Proceedings of the Twenty-Seventh International Joint Conference on Artificial Intelligence (IJCAI)
MU Faculty or unit

Faculty of Informatics

Keywords treewidth; computational social choice; group activity selection problem; parameterized complexity
Description The general task of finding an assignment of agents to activities under certain stability and rationality constraints has led to the introduction of two prominent problems in the area of computational social choice: Group Activity Selection (GASP) and Stable Invitations (SIP). Here we introduce and study the Comprehensive Activity Selection Problem, which naturally generalizes both of these problems. In particular, we apply the parameterized complexity paradigm, which has already been successfully employed for SIP and GASP. While previous work has focused strongly on parameters such as solution size or number of activities, here we focus on parameters which capture the complexity of agent-to-agent interactions. Our results include a comprehensive complexity map for CAS under various restrictions on the number of activities in combination with restrictions on the complexity of agent interactions.

You are running an old browser version. We recommend updating your browser to its latest version.

More info