Sebastian Schneckenburger
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Research Interests
Sebastian Schneckenburger has a total of 3 co-authors. Here are the top co-authors by number of shared publications:
- Andreas Darmann
Department of Operations and Information Systems, University of Graz, Graz, Austria
1 shared publication - Britta Dorn
University of Tübingen
1 shared publication - Janosch Döcker
Department of Computer Science University of Tübingen Germany
1 shared publication
Latest Publications
- Open Access
- 13 September 2021
- Published by Springer Nature in International Journal of Game Theory
- Vol. 51 (1) , 169-212
Simplified group activity selection with group size constraints
Several 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.
- 13 September 2021
- Published by Springer Nature in International Journal of Game Theory
- Vol. 51 (1) , 169-212
Open AccessSimplified group activity selection with group size constraints
Several 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.