A Note on the Fair Division Problem
From MaRDI portal
Publication:5340475
DOI10.2307/2689255zbMATH Open0131.36702OpenAlexW4239685223MaRDI QIDQ5340475FDOQ5340475
Authors: A. M. Fink 
Publication date: 1964
Full work available at URL: https://doi.org/10.2307/2689255
Cited In (10)
- Green eggs and ham
- On the complexity of cake cutting
- Ramsey partitions of integers and fair divisions
- Cutting a cake for infinitely many guests
- Resource-monotonicity and population-monotonicity in connected cake-cutting
- An algorithm for super envy-free cake division
- Old and new moving-knife schemes
- A note on the cake-division problem
- How to cut a cake fairly using a minimal number of cuts
- Extensions of cut-and-choose fair division
This page was built for publication: A Note on the Fair Division Problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5340475)
