2 papers
cs.GT2025
Parameterized Complexity of Hedonic Games with Enemy-Oriented Preferences
Martin Durand, Laurin Erlacher, Johanne Müller Vistisen +1
Hedonic games model settings in which a set of agents have to be partitioned into groups which we call coalitions. In the enemy aversion model, each agent has friends and enemies,…
cs.GT2024
Collective schedules: axioms and algorithms
Martin Durand, Fanny Pascual
The collective schedules problem consists in computing a schedule of tasks shared between individuals. Tasks may have different duration, and individuals have preferences over the…