Cake cutting: Not just child's play

Communications of the ACM

Volumn 56, Issue 7, 2013, Pages 78-87

  Procaccia, Ariel D ^a  

^a Carnegie Mellon University ^*  (United States)

Author keywords

[No Author keywords available]

Indexed keywords

CAKE CUTTINGS; COMPUTER SCIENTISTS; FAIR ALLOCATION; FAIR DIVISIONS; MICRO-ECONOMIC THEORY; PROPER ALLOCATIONS; WORLD WAR II;

COMPUTER APPLICATIONS; COMPUTER SCIENCE;

MILITARY OPERATIONS;

EID: 84880160066     PISSN: 00010782     EISSN: 15577317     Source Type: Journal    
DOI: 10.1145/2483852.2483870     Document Type: Article

References (43)

1. Alon, N. Splitting necklaces. Advances in Mathematics 63 (1987), 241-253.
2. Arzi, O., Aumann, Y., and Dombb, Y. Throw one's cake-and eat it, too. in Proceedings of the Fourth International Symposium on Algorithmic Game Theory (2011), 69-80.
3. Aumann, Y. and Dombb, Y. The effciency of fair division with connected pieces. in Proceedings of the Sixth International Workshop on Internet and Network Economics (2010), 26-37.
4. th International Conference on Autonomous Agents and Multi-Agent Systems (2013).
5. th AAAI Conference on Artifcial Intelligence (2012), 1263-1269.
6. Bertsimas, D., Farias, V.F., and Trichakis, N. The price of fairness. Operations Research 59, 1 (2011), 17-31.
7. th AAAI Conference on Artifcial Intelligence (2012), 1285-1291.
8. Brams, S.J., Jones, M.A., and Klamler, C. Better ways to cut a cake. Notices of the AMS 53, 11 (2006), 1314-1321. (Pubitemid 44844184)
9. Brams, S.J., Jones, M.A., and Klamler, C. N-person cake-cutting: there may be no perfect division. The American Mathematical Monthly 120, 1 (2013), 35-47.
10. Brams, S.J. and Taylor, A.D. An envy-free cake-division protocol. The American Mathematical Monthly 102, 1 (1995), 9-18.
11. Brams, S.J. and Taylor, A.D. Fair Division: From Cake Cutting to Dispute Resolution. cambridge university Press, cambridge, u.K., 1996.
12. Caragiannis, I., Kaklamanis, C., Kanellopoulos, P., and Kyropoulou, M. The effciency of fair division. in Proceedings of the Fifth International Workshop on Internet and Network Economics (2009), 475-482.
13. Chen, Y., Lai, J.K., Parkes, D.C., and Procaccia, A.D. Truth, justice, and cake cutting. Games and Economic Behavior 77 (2013), 284-297.
14. th AAAI Conference on Artifcial Intelligence (2011), 626-631.
15. Conitzer, V. Making decisions based on the preferences of multiple agents. Commun. ACM 53, 3 (Mar. 2010), 84-94.
16. Demers, A., Keshav, S., and Shenker, S. Analysis and simulation of a fair queuing algorithm. in Proceedings of the ACM Symposium on Communications Architectures & Protocols (1989), 1-12. (Pubitemid 20692629)
17. Deng, X., Qi, Q., and Saberi, A. Algorithmic solutions for envy-free cake cutting. Operations Research 60, 6 (2012), 1461-1476.
18. Dubins, L.E. and Spanier, E.H. How to cut a cake fairly. American Mathematical Monthly 68, 1 (1961), 1-17.
19. th Annual ACM-SIAM Symposium on Discrete Algorithms (2006), 271-278. (Pubitemid 43275248)
20. Even, S. and Paz, A. A note on cake cutting. Discrete Applied Mathematics 7 (1984), 285-296.
21. Foley, D. Resource allocation and the public sector. Yale Economics Essays 7 (1967), 45-98.
22. Friedman, E.J., Ghodsi, A., Shenker, S., and Stoica, I. Strategyproofness, Leontief Economies, and the Kalai-Smorodinsky Solution. Manuscript, 2011; http://www1. icsi.berkeley.edu/~ejf/pfles/ksgroupsp.pdf
23. Gamow, G. and Stern, M. Puzzle-Math. Viking, new york, 1958.
24. Ghodsi, A., Zaharia, M., Hindman, B., Konwinski, A., Shenker, S., and Stoica, I. Dominant resource fairness: fair allocation of multiple resource types. in Proceedings of the Eighth USENIX Conference on Networked Systems Design and Implementation (2011), 24-37.
25. th International Conference on Autonomous Agents and Multi-Agent Systems (2012), 719-728.
26. th International Conference on Autonomous Agents and Multi-Agent Systems (2013).
27. th AAAI Conference on Artifcial Intelligence (2013).
28. Lipton, R.J., Markakis, E., Mossel, E., and Saberi, A. On approximately fair allocations of indivisible goods. in Proceedings of the Sixth ACM Conference on Electronic Commerce (2004), 125-131.
29. th International Symposium on Theoretical Aspects of Computer Science (2003), 596-607.
30. Mossel, E. and Tamuz, O. Truthful fair division. in Proceedings of the Third International Symposium on Algorithmic Game Theory (2010), 288-299.
31. Moulin, H. Fair Division and Collective Welfare. Mit Press, cambridge, Ma, 2003.
32. th ACM Conference on Electronic Commerce (2012), 808-825.
33. Pazner, E. and Schmeidler, D. Egalitarian equivalent allocations: a new concept of economic equity. Quarterly Journal of Economics 92, 4 (1978), 671-687.
34. st International Joint Conference on Artifcial Intelligence (2009), 239-244.
35. Robertson, J.M. and Webb, W.A. Cake Cutting Algorithms: Be Fair If You Can. a.K. Peters ltd., london, 1998.
36. Roughgarden, T. Algorithmic game theory. Commun. ACM 53, 7 (July 2010), 78-86.
37. Saberi, A. and Wang, Y. Cutting a cake for fve people. in Proceedings of the Fifth International Conference on Algorithmic Aspects in Information and Management (2009), 292-300.
38. Schummer, J. Strategyproofness versus effciency on restricted domains of exchange economies. Social Choice and Welfare 14 (1997), 47-56. (Pubitemid 127007559)
39. Steinhaus, H. The problem of fair division. Econometrica 16 (1948), 101-104.
40. Stromquist, W. How to cut a cake fairly. American Mathematical Monthly 87, 8 (1980), 640-644.
41. Stromquist, W. Envy-free cake divisions cannot be found by fnite protocols. The Electronic Journal of Combinatorics 15, #r11 (2008).
42. Thomson, W. Fair allocation rules. in Handbook of Social Choice and Welfare, Volume 2, Chapter 21, K.J. Arrow, A. Sen, and K. Suzumura, eds. north-holland Publishing co., amsterdam, 2010.
43. Woeginger, G.J. and Sgall, J. On the complexity of cake cutting. Discrete Optimization 4 (2007), 213-220. (Pubitemid 46551949)