Incentive Compatible Two Player Cake Cutting
نویسندگان
چکیده
We characterize methods of dividing a cake between two bidders in a way that is incentive-compatible and Pareto-efficient. In our cake cutting model, each bidder desires a subset of the cake (with a uniform value over this subset), and is allocated some subset. Our characterization proceeds via reducing to a simple one-dimensional version of the problem, and yields, for example, a tight bound on the social welfare achievable.
منابع مشابه
The Price of Indivisibility in Cake Cutting
We consider the problem of envy-free cake cutting, which is the distribution of a continuous heterogeneous resource among self interested players such that nobody prefers what somebody else receives to what they get. Existing work has focused on two distinct classes of solutions to this problem allocations which give each player a continuous piece of cake and allocations which give each player ...
متن کاملThe complexity of cake cutting with unequal shares
An unceasing problem of our prevailing society is the fair division of goods. The problem of fair cake cutting is dividing a heterogeneous and divisible resource, the cake, among n players who value pieces according to their own measure function. The goal is to assign each player a not necessarily connected part of the cake that the player evaluates at least as much as her proportional share. I...
متن کاملOn the Complexity of Envy-Free Cake Cutting
We study the envy-free cake-cutting problem for d+1 players with d cuts, for both the oracle function model and the polynomial time function model. For the former, we derive a θ(( ǫ )) time matching bound for the query complexity of d + 1 player cake cutting with Lipschitz utilities for any d > 1. When the utility functions are given by a polynomial time algorithm, we prove the problem to be PP...
متن کاملEnvy-free two-player mm-cake and three-player two-cake divisions
Cloutier, Nyman, and Su (Mathematical Social Sciences 59 (2005), 26–37) initiated the study of envy-free cake-cutting problems involving several cakes. The classical result in this area is that when there are q players and one cake, an envy-free cake-division requiring only q − 1 cuts exists under weak and natural assumptions. Among other results, Cloutier, Nyman, and Su showed that when there ...
متن کاملFair and Square: Cake-cutting in Two Dimensions
We consider the problem of fairly dividing a two dimensional heterogeneous good among multiple players. Applications include division of land as well as ad space in print and electronic media. Classical cake cutting protocols primarily consider a one-dimensional resource, or allocate each player multiple infinitesimally small “pieces”. In practice, however, the two dimensional shape of the allo...
متن کامل