13 citations · 17 across the 15 of their papers we have counts for
4 papers · 1 filter
Envy-Free Allocations Respecting Social Networks
Robert Bredereck, Andrzej Kaczmarczyk, Rolf Niedermeier
Finding an envy-free allocation of indivisible resources to agents is a central task in many multiagent systems. Often, non-trivial envy-free allocations do not exist, and, when th…
Line-Up Elections: Parallel Voting with Shared Candidate Pool
Niclas Boehmer, Robert Bredereck, Piotr Faliszewski +2
We introduce the model of line-up elections which captures parallel or sequential single-winner elections with a shared candidate pool. The goal of a line-up election is to find a…
High-Multiplicity Fair Allocation Using Parametric Integer Linear Programming
Robert Bredereck, Andrzej Kaczmarczyk, Dušan Knop +1
Using insights from parametric integer linear programming, we significantly improve on our previous work [Proc. ACM EC 2019] on high-multiplicity fair allocation. Therein, answerin…
When Votes Change and Committees Should (Not)
Robert Bredereck, Till Fluschnik, Andrzej Kaczmarczyk
Electing a single committee of a small size is a classical and well-understood voting situation. Being interested in a sequence of committees, we introduce and study two time-depen…