Suppose a group of
people want to split a group of whole cakes among each other. Each cake is of one type only e.g. vanilla, chocolate, strawberry, etc.
Each person also has a value function associated with each type of cake, which denotes how much each cake is "worth" to each player. The sum of all the value functions for a given person is , and every person values nothing at . Note that a value function must be and .
For example, person 1 might value vanilla at , while person 2 values vanilla at . Person 1 might value chocolate at , while person 2 values chocolate at .
In addition, a person values a fraction of a cake at a fraction of the value function he/she associates it with. For example, given the above value functions, person 2 would value half a vanilla cake at , while person 1 values of a chocolate cake at .
The total value a person receives is the combined values of all the cakes he/she has, based on his/her own value functions. For example, if person 1 receives a vanilla cake and a chocolate cake, his total value would be . If person 2 receives half a chocolate cake and half a vanilla cake, her total value would be .
Is it possible to divide the cakes among all people such that each person receives at least a total value of ?
This section requires Javascript.
You are seeing this because something didn't load right. We suggest you, (a) try
refreshing the page, (b) enabling javascript if it is disabled on your browser and,
finally, (c)
loading the
non-javascript version of this page
. We're sorry about the hassle.
Giving each person n 1 of all the cakes satisfies the conditions
. Let x i be the value function of some person for the i th cake. Then ∑ x i = 1 .
Now since each person gets n 1 of all the cakes, Total value is ∑ n 1 x i = n 1 ∑ x i = n 1