13 citations · 24 across the 22 of their papers we have counts for
6 papers · 1 filter
The Core in Max-Loss Non-Centroid Clustering Can Be Empty
Robert Bredereck, Eva Deltl, Leon Kellerhals +1
We study core stability in non-centroid clustering under the max-loss objective, where each agent's loss is the maximum distance to other members of their cluster. We prove that fo…
Properties of Egalitarian Sequences of Committees: Theory and Experiments
Paula Böhm, Robert Bredereck, Till Fluschnik
We study the task of electing egalitarian sequences of committees given a set of agents with additive utilities for candidates available on each of levels. We introduce sev…
How to Resolve Envy by Adding Goods
Matthias Bentert, Robert Bredereck, Eva Deltl +2
We consider the problem of resolving the envy of a given initial allocation by adding elements from a pool of goods. We give a characterization of the instances where envy can be r…
Putting Fair Division on the Map
Paula Böhm, Robert Bredereck, Paul Gölz +2
The fair division of indivisible goods is not only a subject of theoretical research, but also an important problem in practice, with solutions being offered on several online plat…
Drawing a Map of Elections
Stanisław Szufa, Niclas Boehmer, Robert Bredereck +5
Our main contribution is the introduction of the map of elections framework. A map of elections consists of three main elements: (1) a dataset of elections (i.e., collections of or…
Computing Efficient Envy-Free Partial Allocations of Indivisible Goods
Robert Bredereck, Andrzej Kaczmarczyk, Junjie Luo +1
Envy-freeness is one of the most prominent fairness concepts in the allocation of indivisible goods. Even though trivial envy-free allocations always exist, rich literature shows t…