activity
20232026
most citedAlgorithmics of Egalitarian versus Equitable Sequences of Committees

1 citations · 1 across the 8 of their papers we have counts for

collaborators
Showing 2026Show all

6 papers · 1 filter

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.GT2026

Optimally Selecting Representative Agents from a Metric Space

Benjamin Cookson, Eva Deltl, Yeeseok Oh

This paper studies the problem of proportionally fair clustering, where the goal is to select ``centers'' from a metric space that fairly represent a set of agents who also lie…

cs.CC2026

The Influence of Agent Models on the Complexity of Bus Routing

Eva Deltl, Christian Komusiewicz, Jurek Rostalsky +2

In bus routing, the task is to plan a bus route in a network with several agents, each of whom wants to travel from a starting point to a destination. A bus route should account fo…

cs.GT2026

Improved Lower Bounds for Proportionally Fair Clustering

Benjamin Cookson, Eva Deltl, Yeeseok Oh

We study proportionally fair clustering, where a set of centers must be chosen from a metric space to represent agents, and no sufficiently large group of agents should be…

cs.GT2026

Minimizing the Cost of EFx Allocations

Eva Deltl

Ensuring fairness while limiting costs, such as transportation or storage, is an important challenge in resource allocation, yet most work has focused on cost minimization without…