An approximation scheme for cake division with a linear number of cuts

Combinatorica

Volumn 27, Issue 2, 2007, Pages 205-211

  Sgall, Jiří ^a   Woeginger, Gerhard J ^b  

^a MATHEMATICAL INSTITUTE   (Czech Republic)

^b EINDHOVEN UNIVERSITY OF TECHNOLOGY   (Netherlands)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 34248212827     PISSN: 02099683     EISSN: None     Source Type: Journal    
DOI: 10.1007/s00493-007-0052-3     Document Type: Article

References (10)

1. S. J. BRAMS and A. D. TAYLOR: Fair Division - From cake cutting to dispute resolution, Cambridge University Press, Cambridge, 1996.
2. L. CARROLL: Alice's Adventures in Wonderland, 1865.
3. S. EVEN and A. PAZ: A note on cake cutting, Discrete Applied Mathematics 7 (1984), 285-296.
4. J. M. ROBERTSON and W. A. WEBB: Minimal number of cuts for fair division, Ars Combinatoria 31 (1991), 191-197.
5. J. M. ROBERTSON and W. A. WEBB: Approximating fair division with a limited number of cuts, Journal of Combinatorial Theory, Series A 72 (1995), 340-344.
6. J. M. ROBERTSON and W. A. WEBB: Cake-cutting algorithms: Be fair if you can, A.K. Peters Ltd, 1998.
7. H. STEINHAUS: The problem of fair division, Econometrica 16 (1948), 101-104.
8. W. STROMQUIST: How to cut a cake fairly, American Mathematical Monthly 87 (1980), 640-644.
9. W. A. WEBB: How to cut a cake fairly using a minimal number of cuts, Discrete Applied Mathematics 74 (1997), 183-190.
10. D. R. WOODALL: Dividing a cake fairly, Journal of Mathematical Analysis and Applications 78 (1980), 233-247.