Recommendations
Cited in
(36)- Packing a cake into a box
- Fair-by-design matching
- Cake cutting algorithms
- scientific article; zbMATH DE number 1962847 (Why is no real title available?)
- The problem of fair division for a hybrid resource
- A muffin-theorem generator
- Envy-free division of discrete cakes
- Envy-free division of discrete cakes
- Obvious manipulations in cake-cutting
- How to allocate hard candies fairly
- Proportional pie-cutting
- The incentive guarantees behind Nash welfare in divisible resources allocation
- On existence of truthful fair cake cutting mechanisms
- Expand the shares together: envy-free mechanisms with a small number of cuts
- Fair cake-cutting in practice
- Elementary solution to the fair division problem
- Disproportionate division
- Resource-monotonicity and population-monotonicity in connected cake-cutting
- Revenue maximizing markets for zero-day exploits
- Three persons, two cuts: a new cake-cutting algorithm
- Multi resource allocation with partial preferences
- Connected equitable cake division via Sperner's lemma
- Mathematical muffin morsels. Nobody wants a small piece
- Collective decision making
- Between proportionnality and envy-freeness: k-proportionality
- When is truthfully allocating chores no harder than goods?
- On the computability of equitable divisions
- Measures of balance in combinatorial optimization
- Cutting cakes carefully
- Two-person cake cutting: the optimal number of cuts
- Dividing profits three ways: exactness vs. consensuality
- Three-agent peer evaluation
- Maximize egalitarian welfare for cake cutting
- How to divide the indivisible
- A geometric approach to fair division
- Not obviously manipulable allotment rules
This page was built for publication: Better ways to cut a cake
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5450059)
