no code implementations • 19 Feb 2024 • Niclas Boehmer, Yash Nair, Sanket Shah, Lucas Janson, Aparna Taneja, Milind Tambe
When resources are scarce, an allocation policy is needed to decide who receives a resource.
1 code implementation • 16 Jun 2023 • Niclas Boehmer, L. Elisa Celis, Lingxiao Huang, Anay Mehrotra, Nisheeth K. Vishnoi
We consider the problem of subset selection where one is given multiple rankings of items and the goal is to select the highest ``quality'' subset.
1 code implementation • 8 Aug 2022 • Niclas Boehmer, Klaus Heeger, Stanisław Szufa
Focusing on Stable Roommates (SR) instances, we contribute to the toolbox for conducting experiments for stable matching problems.
1 code implementation • 16 May 2022 • Niclas Boehmer, Robert Bredereck, Edith Elkind, Piotr Faliszewski, Stanisław Szufa
We use the ``map of elections'' approach of Szufa et al. (AAMAS-2020) to analyze several well-known vote distributions.
1 code implementation • 14 Dec 2021 • Niclas Boehmer, Robert Bredereck, André Nichterlein
A recent report of Littmann [Commun.
no code implementations • 23 Feb 2021 • Niclas Boehmer, Tomohiro Koana, Rolf Niedermeier
We study the NP-hard Fair Connected Districting problem recently proposed by Stoica et al. [AAMAS 2020]: Partition a vertex-colored graph into k connected components (subsequently referred to as districts) so that in every district the most frequent color occurs at most a given number of times more often than the second most frequent color.
Computer Science and Game Theory Discrete Mathematics
no code implementations • 9 Jul 2020 • Niclas Boehmer, Robert Bredereck, Klaus Heeger, Rolf Niedermeier
We initiate the study of external manipulations in Stable Marriage by considering several manipulative actions as well as several manipulation goals.
Computer Science and Game Theory Discrete Mathematics