A note on the cake-division problem (Q1075937)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 3952455
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A note on the cake-division problem |
scientific article; zbMATH DE number 3952455 |
Statements
A note on the cake-division problem (English)
0 references
1986
0 references
Let C (the cake) be a compact convex set, and let each of n people define a non-atomic probability measure on the Borel sets of C. It is well known that C can be divided among the n people so that each receives at least 1/n of it (in his own measure), and even, if the n measures are not all identical, so that each receives more than 1/n of it. No constructive proof was known of this latter result. This note provides one.
0 references
cake division
0 references
fair division
0 references
non-atomic probability measure
0 references
Borel sets
0 references
0.894351065158844
0 references
0.8768285512924194
0 references
0.8718566298484802
0 references
0.8681640028953552
0 references
