13 citations · 24 across the 22 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…
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…
Multidimensional Stable Roommates with Master List
Robert Bredereck, Klaus Heeger, Dušan Knop +1
Since the early days of research in algorithms and complexity, the computation of stable matchings is a core topic. While in the classic setting the goal is to match up two agents…
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…