9 citations · 25 across the 15 of their papers we have counts for
Showing 2019Show all
3 papers · 1 filter
cs.GT2019★ 9 cited
Efficient Fair Division with Minimal Sharing
Fedor Sandomirskiy, Erel Segal-Halevi
A collection of objects, some of which are good and some are bad, is to be divided fairly among agents with different tastes, modeled by additive utility functions. If the objects…
cs.GT2019
Algorithms for Competitive Division of Chores
Simina Brânzei, Fedor Sandomirskiy
We study the problem of allocating divisible bads (chores) among multiple agents with additive utilities when monetary transfers are not allowed. The competitive rule is known for…
cs.GT2019
Protecting the Protected Group: Circumventing Harmful Fairness
Omer Ben-Porat, Fedor Sandomirskiy, Moshe Tennenholtz
Machine Learning (ML) algorithms shape our lives. Banks use them to determine if we are good borrowers; IT companies delegate them recruitment decisions; police apply ML for crime-…