# Fair Division via Social ComparisonEI

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 {\\em locally proportional} if each agent values its own allocation as much as the average value of its neighbors' allocations. We generalize the classical Cut and Choose\" protocol for two agents t...更多

Similar paper is not avaliable

AAMAS, 2016.