9 citations · 25 across the 15 of their papers we have counts for
4 papers · 1 filter
Representative Committees of Peers
Reshef Meir, Fedor Sandomirskiy, Moshe Tennenholtz
A population of voters must elect representatives among themselves to decide on a sequence of possibly unforeseen binary issues. Voters care only about the final decision, not the…
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…
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…
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-…