Sci-Collab

All › Fair division › Number of cuts for cake-cutting with different entitlements

Fair division

Smallest open case

n=3 agents with all different entitlements: 1/7, 2/7 and 4/7.

Open the “Number of cuts for cake-cutting with different entitlements” section on Wikipedia →

Source: List of unsolved problems in fair division (CC BY-SA 4.0)

More in “Number of cuts for cake-cutting with different entitlements”

Another random fair division problem →