13 citations · 34 across the 29 of their papers we have counts for
5 papers · 2 filters
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…
On the Robustness of Winners: Counting Briberies in Elections
Niclas Boehmer, Robert Bredereck, Piotr Faliszewski +1
We study the parameterized complexity of counting variants of Swap- and Shift-Bribery problems, focusing on the parameterizations by the number of swaps and the number of voters. W…
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…
Bribery and Control in Stable Marriage
Niclas Boehmer, Robert Bredereck, Klaus Heeger +1
We initiate the study of external manipulations in Stable Marriage by considering several manipulative actions as well as several manipulation goals. For instance, one goal is to m…
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…