Search results
Results From The WOW.Com Content Network
The "cake" is only a metaphor; procedures for fair cake-cutting can be used to divide various kinds of resources, such as land estates, advertisement space or broadcast time. The prototypical procedure for fair cake-cutting is divide and choose, which is mentioned in the book of Genesis to resolve Abraham and Lot's conflict. This procedure ...
Divide and choose (also Cut and choose or I cut, you choose) is a procedure for fair division of a continuous resource, such as a cake, between two parties. It involves a heterogeneous good or resource ("the cake") and two partners who have different preferences over parts of the cake (both want as much of it as possible).
The problem of fair cake-cutting has a variation in which the pieces must be connected. In this variation, both the nominator and the denominator in the POF formula are smaller (since the maximum is taken over a smaller set), so a priori it is not clear whether the POF should be smaller or larger than in the disconnected case.
Fair cake-cutting algorithms: Ortega, Kyropoulou and Segal-Halevi [29] tested algorithms such as Divide and choose, Last diminisher, Even–Paz and Selfridge–Conway between laboratory subjects. It is known that these procedures are not strategyproof , and indeed, they found that subjects often manipulate them.
The cake redivision problem [10] is a variant of fair cake-cutting in which the cake is already divided in an unfair way (e.g. among a subset of the agents), and it should be re-divided in a fair way (among all the agents) while letting the incumbent owners keep a substantial fraction of their present value.
Steven J. Brams (born November 28, 1940, in Concord, New Hampshire) is an American game theorist and political scientist at the New York University Department of Politics. . Brams is best known for using the techniques of game theory, public choice theory, and social choice theory to analyze voting systems and fair divi
Get AOL Mail for FREE! Manage your email like never before with travel, photo & document views. Personalize your inbox with themes & tabs. You've Got Mail!
Edmonds–Pruhs protocol is a protocol for fair cake-cutting.Its goal is to create a partially proportional division of a heterogeneous resource among n people, such that each person receives a subset of the cake which that person values as at least 1/an of the total, where is some sufficiently large constant.