Showing 1 - 10 of 21
We analyze a class of proportional cake-cutting algorithms that use a minimal number of cuts (n-1 if there are n players) to divide a cake that the players value along one dimension. While these algorithms may not produce an envy-free or efficient allocation--as these terms are used in the...
Persistent link: https://www.econbiz.de/10015221562
A cake is a metaphor for a heterogeneous, divisible good, such as land. A perfect division of cake is efficient (also called Pareto-optimal), envy-free, and equitable. We give an example of a cake in which it is impossible to divide it among three players such that these three properties are...
Persistent link: https://www.econbiz.de/10015229020
We analyze a class of proportional cake-cutting algorithms that use a minimal number of cuts (n-1 if there are n players) to divide a cake that the players value along one dimension. While these algorithms may not produce an envy-free or efficient allocation--as these terms are used in the...
Persistent link: https://www.econbiz.de/10008506098
A cake is a metaphor for a heterogeneous, divisible good, such as land. A perfect division of cake is efficient (also called Pareto-optimal), envy-free, and equitable. We give an example of a cake in which it is impossible to divide it among three players such that these three properties are...
Persistent link: https://www.econbiz.de/10009325605
Persistent link: https://www.econbiz.de/10007916561
A cake is a metaphor for a heterogeneous, divisible good, such as land. A perfect division of cake is efficient (also called Pareto-optimal), envy-free, and equitable. We give an example of a cake in which it is impossible to divide it among three players such that these three properties are...
Persistent link: https://www.econbiz.de/10014042381
We analyze a class of proportional cake-cutting algorithms that use a minimal number of cuts (n-1 if there are n players) to divide a cake that the players value along one dimension. While these algorithms may not produce an envy-free or efficient allocation – as these terms are used in the...
Persistent link: https://www.econbiz.de/10014045264
Persistent link: https://www.econbiz.de/10003665978
Ordinally single-peaked preferences are distinguished from cardinally single-peaked preferences, in which all players have a similar perception of distances in some one-dimensional ordering. While ordinal single-peakedness can lead to disconnected coalitions that have a "hole" in the ordering,...
Persistent link: https://www.econbiz.de/10011335684
Players are assumed to rank each other as coalition partners. Two processes of coalition formation are defined and illustrated: i) Fallback (FB): Players seek coalition partners by descending lower and lower in their preference rankings until some majority coalition, all of whose members...
Persistent link: https://www.econbiz.de/10005423068