1 citations · 2 across the 7 of their papers we have counts for
1 paper · 2 filters
Gerdus Benadè, Daniel Halpern, Alexandros Psomas +1
We study the problem of fairly allocating m indivisible items among n agents. Envy-free allocations, in which each agent prefers her bundle to the bundle of every other agent,…