Hedonic diversity games: A complexity picture with more than two colors

R Ganian, T Hamm, D Knop, Š Schierreich, O Suchý - Artificial Intelligence, 2023 - Elsevier
Hedonic diversity games are a variant of the classical hedonic games designed to better
model a variety of questions concerning diversity and fairness. Previous works mainly …

Algorithms and Complexity of Difference Logic

KK Dabrowski, P Jonsson, S Ordyniak… - arXiv preprint arXiv …, 2024 - arxiv.org
Difference Logic (DL) is a fragment of linear arithmetics where atoms are constraints x+ k<=
y for variables x, y (ranging over Q or Z) and integer k. We study the complexity of deciding …

Individual Rationality in Topological Distance Games is Surprisingly Hard

A Deligkas, E Eiben, D Knop, Š Schierreich - arXiv preprint arXiv …, 2024 - arxiv.org
In the recently introduced topological distance games, strategic agents need to be assigned
to a subset of vertices of a topology. In the assignment, the utility of an agent depends on …

Parameterized Algorithms for Optimal Refugee Resettlement

J Chen, I Schlotter, S Simola - arXiv preprint arXiv:2408.08392, 2024 - arxiv.org
We study variants of the Optimal Refugee Resettlement problem where a set $ F $ of
refugee families need to be allocated to a set $ L $ of possible places of resettlement in a …