Author:
Darmann Andreas,Döcker Janosch,Dorn Britta,Schneckenburger Sebastian
Abstract
AbstractSeveral real-world situations can be represented in terms of agents that have preferences over activities in which they may participate. Often, the agents can take part in at most one activity (for instance, since these take place simultaneously), and there are additional constraints on the number of agents that can participate in an activity. In such a setting, we consider the task of assigning agents to activities in a reasonable way. We introduce the simplified group activity selection problem providing a general yet simple model for a broad variety of settings, and start investigating its special case where upper and lower bounds of the groups have to be taken into account. We apply different solution concepts such as envy-freeness and core stability to our setting and provide a computational complexity study for the problem of finding such solutions.
Publisher
Springer Science and Business Media LLC
Subject
Statistics, Probability and Uncertainty,Economics and Econometrics,Social Sciences (miscellaneous),Mathematics (miscellaneous),Statistics and Probability
Reference41 articles.
1. Ahuja RK, Magnanti TL, Orlin JB (1993) Network flows: theory, algorithms, and applications. Prentice Hall, Hoboken
2. Arulselvan A, Cseh A, Groß M, Manlove D, Matuschke J (2018) Matchings with lower quotas: algorithms and complexity. Algorithmica 80(1):185–208
3. Aziz H, Savani R (2015) Hedonic games. In: Brandt F, Conitzer V, Endriss U, Lang J, Procaccia AD (eds) Handbook of computational social choice, chapter 15. Cambridge University Press, Cambridge
4. Berman F, Johnson D, Leighton T, Shor PW, Snyder L (1990) Generalized planar matching. J Algor 11(2):153–184
5. Biró P, Fleiner T, Irving RW, Manlove DF (2010) The college admissions problem with lower and common quotas. Theoret Comput Sci 411(34):3136–3153