12 citations · 12 across the 2 of their papers we have counts for
2 papers
cs.GT2020★ 12 cited
Equitable Allocations of Indivisible Chores
Rupert Freeman, Sujoy Sikdar, Rohit Vaish +1
We study fair allocation of indivisible chores (i.e., items with non-positive value) among agents with additive valuations. An allocation is deemed fair if it is (approximately) eq…
cs.DS2016
Opting Into Optimal Matchings
Avrim Blum, Ioannis Caragiannis, Nika Haghtalab +3
We revisit the problem of designing optimal, individually rational matching mechanisms (in a general sense, allowing for cycles in directed graphs), where each player --- who is as…