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.
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.
Source: Wikipedia "Cake sharing" · CC BY-SA 4.0
Share this article: X · Bluesky