Better ways to cut a cake
From MaRDI portal
Publication:5450059
zbMATH Open1142.91025MaRDI QIDQ5450059FDOQ5450059
Steven J. Brams, Christian Klamler, Michael A. Jones
Publication date: 19 March 2008
Full work available at URL: http://www.ams.org/notices/200611/fea-brams.pdf
Recommendations
- [[:Publication:3981356|Title not available (Why is that?)]]
- On the possibilities for partitioning a cake
- How to cut a cake fairly using a minimal number of cuts
- [[:Publication:4828941|Title not available (Why is that?)]]
- An Envy-Free Cake Division Protocol
Social choice (91B14) Resource and cost allocation (including fair division, apportionment, etc.) (91B32)
Cited In (25)
- Title not available (Why is that?)
- Fair-by-design matching
- The problem of fair division for a hybrid resource
- 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
- 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
- Multi resource allocation with partial preferences
- Collective decision making
- On the computability of equitable divisions
- Measures of balance in combinatorial optimization
- Two-person cake cutting: the optimal number of cuts
- Revenue Maximizing Markets for Zero-Day Exploits
- Dividing profits three ways: exactness vs. consensuality
- Maximize egalitarian welfare for cake cutting
- Three-agent peer evaluation
- Three Persons, Two Cuts: A New Cake-Cutting Algorithm
- How to divide the indivisible
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)
