Fair Division via Social Comparison
نویسندگان
چکیده
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 locally envy-free if no agent envies a neighbor’s allocation, and 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 to this setting, by fully characterizing the set of graphs for which an oblivious single-cutter protocol can give locally envy-free (thus also locally-proportional) allocations. We study the price of envy-freeness, which compares the total value of an optimal allocation with that of an optimal, locally envy-free allocation. Surprisingly, a lower bound of Ω( √ n) on the price of envy-freeness for global allocations also holds for local envy-freeness in any connected graph, so sparse graphs do not provide more flexibility asymptotically with respect to the quality of envy-free allocations.
منابع مشابه
Existence of a simple and equitable fair division: A short proof
In this note we study how to share a good between n players in a simple and equitable way. We give a short proof for the existence of such fair divisions. In this note we study a fair division problem. Fair divisions problems are sometimes called cake cutting problems. These kinds of problems appear when we study division of land, time or computer memory between different agents with different ...
متن کاملConsensus-halving via theorems of Borsuk-Ulam and Tucker
In this paper we show how theorems of Borsuk-Ulam and Tucker can be used to construct a consensus-halving: a division of an object into two portions so that each of n people believes the portions are equal. Moreover, the division takes at most n cuts, which is best possible. This extends prior work using methods from combinatorial topology to solve fair division problems. Several applications o...
متن کاملGroup Decision Making via Weighted Propositional Logic: Complexity and Islands of Tractability
We study a general class of multiagent optimization problems, together with a compact representation language of utilities based on weighted propositional formulas. We seek solutions maximizing utilitarian social welfare as well as fair solutions maximizing the utility of the least happy agent. We show that many problems can be expressed in this setting, such as fair division of indivisible goo...
متن کاملFair division - from cake-cutting to dispute resolution
Fair Division, unlike most research on fairness in the social sciences and mathematics, is devoted solely to the analysis of constructive procedures for actually dividing things up and resolving disputes, including...
متن کامل