1 citations · 1 across the 3 of their papers we have counts for
3 papers
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,…
Parameterized Algorithms for Optimal Refugee Resettlement
Jiehua Chen, Ildikó Schlotter, Sofia Simola
We study variants of the Optimal Refugee Resettlement problem where a set of refugee families need to be allocated to a set of possible places of resettlement in a feasible…
Efficient Algorithms for Monroe and CC Rules in Multi-Winner Elections with (Nearly) Structured Preferences
Jiehua Chen, Christian Hatschka, Sofia Simola
We investigate winner determination for two popular proportional representation systems: the Monroe and Chamberlin-Courant (abbrv. CC) systems. Our study focuses on (nearly) single…