Cake sharing
Cake sharing is a problem in social choice theory, in which a group of agents with different preferences has to choose together a subset of a heterogeneous divisible resource, such as time or space. They have a fixed budget, determining the maximum size of the subset that they can choose. Here are two examples.
Time sharing: a group of people would like to have a party of two hours at Sunday. Each person has different preferences about what time the party should be at (e.g. Alice is available between 8:00 to 12:00 and between 16:00 to 20:00, George is available between 10:00 and 17:00, etc.). They have to choose a subset of two hours, from the total available amount of 24 hours. Space sharing: A group of people would like to build a new settlement of a given fixed size. Each person has different preferences regarding the location. They have to choose a subset of the given size, from the total region available for them. The problem was introduced by Bei, Lu and Suksompong in 2022--2025.
Wikipedia contributors, "Cake sharing", Wikipedia, revision 1386038925, retrieved 20 November 2026, source, CC BY-SA 4.0.