activity
20102026
most citedPartitioning Perfect Graphs into Stars

18 citations · 81 across the 40 of their papers we have counts for

collaborators

57 papers

cs.GT2026

Envy-free Allocations with Individual Payments

Robert Bredereck, Eva Deltl, Tanmay Inamdar +2

When an envy-free allocation of indivisible goods does not exist, monetary transfers can restore envy-freeness. Existing work on fair division with subsidies, however, typically as…

cs.GT2026

Reaching Fairness by Reallocating Goods

Robert Bredereck, Eva Deltl, Tanmay Inamdar +3

Fair allocation of indivisible goods has largely been studied under the assumption that no prior allocation exists. Motivated by practical settings with pre-existing (and possibly…

cs.DM2026

Scheduling Tasks towards Energy Autarky: Benefits and Computational Costs of Flexibility

Robert Bredereck, Till Fluschnik, Klaus Heeger

We study the autarky problem: given an energy forecast, a battery, and a set of energy-consuming jobs with time windows, decide whether all jobs can be scheduled without requiring…

cs.GT2026

Adjusted Winner: from Splitting to Selling

Robert Bredereck, Bin Sun, Eyal Briman +1

The Adjusted Winner (AW) method is a fundamental procedure for the fair division of indivisible resources between two agents. However, its reliance on splitting resources can lead…

cs.GT2026

Maximizing Index Diversity in Committee Elections

Paula Böhm, Robert Bredereck, Till Fluschnik

We introduce two models of multiwinner elections with approval preferences and labelled candidates that take the committee's diversity into account. One model aims to find a commit…

cs.GT2026

How to Tamper with a Parliament: Strategic Campaigns in Apportionment Elections

Robert Bredereck, Piotr Faliszewski, Michał Furdyna +6

In parliamentary elections, parties compete for a limited, typically fixed number of seats. Most parliaments are assembled using apportionment methods that distribute the seats bas…