Robert Bredereck

research

∙ 06/26/2023

Algorithmics of Egalitarian versus Equitable Sequences of Committees

We study the election of sequences of committees, where in each of τ lev...

0 Eva Michelle Deltl, et al. ∙

research

∙ 09/19/2022

Rank Aggregation Using Scoring Rules

To aggregate rankings into a social ranking, one can use scoring systems...

0 Niclas Boehmer, et al. ∙

research

∙ 09/01/2022

Bribery Can Get Harder in Structured Multiwinner Approval Election

We study the complexity of bribery in the context of structured multiwin...

0 Bartosz Kusek, et al. ∙

research

∙ 08/29/2022

A Quantitative and Qualitative Analysis of the Robustness of (Real-World) Election Winners

Contributing to the toolbox for interpreting election results, we evalua...

0 Niclas Boehmer, et al. ∙

research

∙ 05/16/2022

Expected Frequency Matrices of Elections: Computation, Geometry, and Preference Learning

We use the "map of elections" approach of Szufa et al. (AAMAS 2020) to a...

0 Niclas Boehmer, et al. ∙

research

∙ 04/29/2022

Single-Peaked Opinion Updates

We consider opinion diffusion for undirected networks with sequential up...

0 Robert Bredereck, et al. ∙

research

∙ 02/03/2022

Multivariate Algorithmics for Eliminating Envy by Donating Goods

Fairly dividing a set of indivisible resources to a set of agents is of ...

0 Niclas Boehmer, et al. ∙

research

∙ 12/14/2021

Combating Collusion Rings is Hard but Possible

A recent report of Littmann [Commun. ACM '21] outlines the existence and...

0 Niclas Boehmer, et al. ∙

research

∙ 12/14/2021

On Improving Resource Allocations by Sharing

Given an initial resource allocation, where some agents may envy others ...

0 Robert Bredereck, et al. ∙

research

∙ 05/18/2021

Fine-Grained View on Bribery for Group Identification

Given a set of agents qualifying or disqualifying each other, group iden...

0 Niclas Boehmer, et al. ∙

research

∙ 05/17/2021

Putting a Compass on the Map of Elections

Recently, Szufa et al. [AAMAS 2020] presented a "map of elections" that ...

0 Niclas Boehmer, et al. ∙

research

∙ 04/20/2021

Finding Small Multi-Demand Set Covers with Ubiquitous Elements and Large Sets is Fixed-Parameter Tractable

We study a variant of Set Cover where each element of the universe has s...

0 Niclas Boehmer, et al. ∙

research

∙ 02/26/2021

A Multivariate Complexity Analysis of the Material Consumption Scheduling Problem

The NP-hard MATERIAL CONSUMPTION SCHEDULING Problem and closely related ...

0 Matthias Bentert, et al. ∙

research

∙ 11/23/2020

Envy-Free Allocations Respecting Social Networks

Finding an envy-free allocation of indivisible resources to agents is a ...

0 Robert Bredereck, et al. ∙

research

∙ 10/19/2020

On the Robustness of Winners: Counting Briberies in Elections

We study the parameterized complexity of counting variants of Swap- and ...

0 Niclas Boehmer, et al. ∙

research

∙ 09/29/2020

Multidimensional Stable Roommates with Master List

Since the early days of research in algorithms and complexity, the compu...

0 Robert Bredereck, et al. ∙

research

∙ 07/09/2020

Line-Up Elections: Parallel Voting with Shared Candidate Pool

We introduce the model of line-up elections which captures parallel or s...

0 Niclas Boehmer, et al. ∙

research

∙ 07/09/2020

Bribery and Control in Stable Marriage

We initiate the study of external manipulations in Stable Marriage by co...

0 Niclas Boehmer, et al. ∙

research

∙ 05/11/2020

High-Multiplicity Fair Allocation Using Parametric Integer Linear Programming

Using insights from parametric integer linear programming, we significan...

0 Robert Bredereck, et al. ∙

research

∙ 05/05/2020

Multistage Committee Election

Electing a single committee of a small size is a classical and well-unde...

0 Robert Bredereck, et al. ∙

research

∙ 11/21/2019

Parameterized Complexity of Stable Roommates with Ties and Incomplete Lists Through the Lens of Graph Parameters

We continue and extend previous work on the parameterized complexity ana...

0 Robert Bredereck, et al. ∙

research

∙ 07/02/2019

Adapting Stable Matchings to Evolving Preferences

Adaptivity to changing environments and constraints is key to success in...

0 Robert Bredereck, et al. ∙

research

∙ 03/14/2019

Stable Roommates with Narcissistic, Single-Peaked, and Single-Crossing Preferences

The classical Stable Roommates problem asks whether it is possible to ha...

0 Robert Bredereck, et al. ∙

research

∙ 03/01/2019

Hedonic Diversity Games

We consider a coalition formation setting where each agent belongs to on...

0 Robert Bredereck, et al. ∙

research

∙ 06/27/2018

On Coalitional Manipulation for Multiwinner Elections: Shortlisting

Shortlisting of candidates--selecting a group of "best" candidates--is a...

0 Robert Bredereck, et al. ∙

research

∙ 12/07/2017

Group Activity Selection on Social Networks

We propose a new variant of the group activity selection problem (GASP),...

0 Ayumi Igarashi, et al. ∙

research

∙ 11/17/2017

Multiwinner Elections with Diversity Constraints

We develop a model of multiwinner elections that combines performance-ba...

0 Robert Bredereck, et al. ∙

research

∙ 09/08/2017

Mixed Integer Programming with Convex/Concave Constraints: Fixed-Parameter Tractability and Applications to Multicovering and Voting

A classic result of Lenstra [Math. Oper. Res. 1983] says that an integer...

0 Robert Bredereck, et al. ∙

research

∙ 07/05/2017

Robustness Among Multiwinner Voting Rules

We investigate how robust are results of committee elections to small ch...

0 Robert Bredereck, et al. ∙

research

∙ 01/07/2016

Complexity of Shift Bribery in Committee Elections

We study the (parameterized) complexity of SHIFT BRIBERY for multiwinner...

0 Robert Bredereck, et al. ∙

Robert Bredereck

Featured Co-authors