Search results
Results From The WOW.Com Content Network
Fair cake-cutting is a kind of fair division problem. The problem involves a heterogeneous resource, such as a cake with different toppings, that is assumed to be divisible – it is possible to cut arbitrarily small pieces of it without destroying their value.
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).
Symmetric fair cake-cutting is a variant of the fair cake-cutting problem, in which fairness is applied not only to the final outcome, but also to the assignment of roles in the division procedure. As an example, consider a birthday cake that has to be divided between two children with different tastes, such that each child feels that his/her ...
Fair resource allocation – dividing a set of divisible and homogeneous goods. A special case is fair division of a single homogeneous resource. Fair cake-cutting – dividing a divisible, heterogeneous good. A special case is when the cake is a circle; then the problem is called fair pie-cutting.
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.
It was the first example of a continuous procedure in fair division. The knife is passed over the cake from the left end to the right. Any player may say stop when they think / of the cake is to the left of the knife, the cake is cut and the player who spoke gets that piece. Repeat with the remaining cake and players, the last player gets the ...
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!
Chore division is a fair division problem in which the divided resource is undesirable, so that each participant wants to get as little as possible. It is the mirror-image of the fair cake-cutting problem, in which the divided resource is desirable so that each participant wants to get as much as possible.