Cake-cutting algorithms
by Robertson, Jack · first published 1998
3mentions
1recommended by
3HN commenters
2014–2024first – last mentioned
33% recommend67% neutral
Affiliate links. As an Amazon Associate I earn from qualifying purchases.
…you choose" to more general cases. It is a way of getting an envy-free distribution. It is often called the cake cutting problem. There are some interesting books on the topic... http://www.amazon.com/Cake-Cutting-Algorithms-Fair-You-Can/d...
on “Divide Your Rent Fairly” ↗Fairness is a rather interesting problem with many definitions, see for example [1,2,3], I was hoping for a more extensive set of implementations; still good work! [1] https://www.amazon.com/Cake-Cutting-Algorithms-Fair-You-Can/... [2] https://www.cs.cmu.edu/~arielpro/15896s15/docs/paper10.pdf [3] https://en.wikipedia.org/wiki/Fair_cake-cutting
on “Project Vania – A Fair Distributor for Python” ↗There is a nice introduction to the topic in case someone is interested (but it's older): Cake-Cutting Algorithms, by Jack Robertson and William Webb. A.K. Peters 1998. IMHO it's worth pointing out that the topic has fewer applications than one might think. Many problems where cake-cutting algorithms might seem…
on “Fair Cake-Cutting” ↗