A Little Charity Guarantees Almost Envy-Freeness

Bhaskar Ray Chaudhury
Bhaskar Ray Chaudhury
Alkmini Sgouritsa
Alkmini Sgouritsa

SODA '20: ACM-SIAM Symposium on Discrete Algorithms Salt Lake City Utah January, 2020, pp. 2658-2672, 2020.

Cited by: 10|Views8
EI

Abstract:

Fair division of indivisible goods is a very well-studied problem. The goal of this problem is to distribute m goods to n agents in a "fair" manner, where every agent has a valuation for each subset of goods. We assume general valuations. Envy-freeness is the most extensively studied notion of fairness. However, envy-free allocations do ...More

Code:

Data:

Your rating :
0

 

Tags
Comments