Fair Division via Social Comparison

AAMAS, 2017.

Cited by: 34|Bibtex|Views26|Links
EI

Abstract:

We study cake cutting on a graph, where agents can only evaluate their shares relative to their neighbors. This is an extension of the classical problem of fair division to incorporate the notion of social comparison from the social sciences. We say an allocation is {\\em locally envy-free} if no agent envies a neighbor's allocation, and ...More

Code:

Data:

Your rating :
0

 

Tags
Comments