activity
20192026
most citedEquitable Allocations of Indivisible Chores

12 citations · 17 across the 4 of their papers we have counts for

collaborators
Showing cs.GTShow all

8 papers · 1 filter

cs.GT2026

Social Welfare in Budget Aggregation

Javier Cembrano, Rupert Freeman, Ulrike Schmidt-Kraepelin +1

We study budget aggregation under -utilities, a model for collective decision making in which agents with heterogeneous preferences must allocate a public budget across a s…

cs.GT2024

Harm Ratio: A Novel and Versatile Fairness Criterion

Soroush Ebadian, Rupert Freeman, Nisarg Shah

Envy-freeness has become the cornerstone of fair division research. In settings where each individual is allocated a disjoint share of collective resources, it is a compelling fair…

cs.GT2021

Two-Sided Matching Meets Fair Division

Rupert Freeman, Evi Micha, Nisarg Shah

We introduce a new model for two-sided matching which allows us to borrow popular fairness notions from the fair division literature such as envy-freeness up to one good and maximi…

cs.GT2021

Computing Possible and Necessary Equilibrium Actions (and Bipartisan Set Winners)

Markus Brill, Rupert Freeman, Vincent Conitzer

In many multiagent environments, a designer has some, but limited control over the game being played. In this paper, we formalize this by considering incompletely specified games,…

cs.GT2021

Incentive-Compatible Forecasting Competitions

Jens Witkowski, Rupert Freeman, Jennifer Wortman Vaughan +2

We initiate the study of incentive-compatible forecasting competitions in which multiple forecasters make predictions about one or more events and compete for a single prize. We ha…

cs.GT2020

Best of Both Worlds: Ex-Ante and Ex-Post Fairness in Resource Allocation

Rupert Freeman, Nisarg Shah, Rohit Vaish

We study the problem of allocating indivisible goods among agents with additive valuations. When randomization is allowed, it is possible to achieve compelling notions of fairness…