Cake cutting: not just child's play
Abstract
How to fairly allocate divisible resources, and why computer scientists should take notice.
Integrity signals
Registry
Cites
Statistics
Claims the paper makes
Claims other papers make about this one
Each is checked against this paper’s own text: does it say what the citing paper says it does?
Combined with mechanism design, such approaches can be used to design methods for cooperation that lead to mutually beneficial outcomes, for example when formalizing procedures around international climate agreements.
“Combined with mechanism design, 30 such approaches can be used to design methods for cooperation that lead to mutually beneficial outcomes, for example when formalizing procedures around international climate agreements [522,641].”
From Tackling climate change with machine learning (2023) · cites this paper as [641]
Cites
Analysis and simulation of a fair queueing algorithm
Demers, A. J., Keshav, S., & Shenker, S. J. (1989) · ACM SIGCOMM Computer Communication Review · doi:10.1145/75247.75248 · Cited by 2,616 · see citing works
Analysis and simulation of a fair queueing algorithm
Demers, A. J., Keshav, S., & Shenker, S. J. (1989) · doi:10.1145/75246.75248 · Cited by 1,730 · see citing works
Dominant resource fairness: fair allocation of multiple resource types
Ghodsi, A., Zaharia, M., Hindman, B., Konwinski, A., Shenker, S. J., & Stoica, I. G. (2011) · doi:10.5555/1972457.1972490 · Cited by 1,120 · see citing works
Resource allocation and the public sector
Foley, D. (1967) · Medical Entomology and Zoology · Cited by 1,038 · see citing works
Fair Division and Collective Welfare
Moulin, H. J. (2003) · The MIT Press eBooks · doi:10.7551/mitpress/2954.001.0001 · Cited by 831 · see citing works
Fair Division: From Cake-Cutting to Dispute Resolution.
Lucas, W. F., Brams, S. J., & Taylor, A. D. (1998) · American Mathematical Monthly · doi:10.2307/2589237 · Cited by 773 · see citing works
Brams, S. J., & Taylor, A. D. (1996) · Cambridge University Press eBooks · doi:10.1017/cbo9780511598975 · Cited by 679 · see citing works
Bertsimas, D., Farias, V. F., & Trichakis, N. (2011) · Operations Research · doi:10.1287/opre.1100.0865 · Cited by 677 · see citing works
On approximately fair allocations of indivisible goods
Lipton, R. J., Markakis, E., Mossel, E., et al. (2004) · ACM Conference on Electronic Commerce (EC) · doi:10.1145/988772.988792 · Cited by 526 · see citing works
Egalitarian Equivalent Allocations: A New Concept of Economic Equity
Pazner, E. A., & Schmeidler, D. (1978) · The Quarterly Journal of Economics · doi:10.2307/1883182 · Cited by 460 · see citing works
Handbook of Social Choice and Welfare
Arrow, K. J., Sen, A. K., & Suzumura, K. (2011) · RePEc: Research Papers in Economics · Cited by 442 · see citing works
Steihaus, H. (1948) · Econometrica · Cited by 440 · see citing works
Cake-Cutting Algorithms: Be Fair if You Can.
Su, F. E., Robertson, J. M., & Webb, W. A. (2000) · American Mathematical Monthly · doi:10.2307/2589459 · Cited by 362 · see citing works
Dubins, L. E., & Spanier, E. H. (1961) · American Mathematical Monthly · doi:10.1080/00029890.1961.11989615 · Cited by 347 · see citing works
Roughgarden, T. (2010) · Communications of the ACM · doi:10.1145/1785414.1785439 · Cited by 288 · see citing works
THOMSON, W. J. (2011) · Handbook of social choice and welfare · doi:10.1016/s0169-7218(10)00021-3 · Cited by 242 · see citing works
An Envy-Free Cake Division Protocol
Brams, S. J., & Taylor, A. D. (1995) · American Mathematical Monthly · doi:10.1080/00029890.1995.11990526 · Cited by 236 · see citing works
Beyond dominant resource fairness: extensions, limitations, and indivisibilities
Parkes, D., Procaccia, A. D., & Shah, N. (2012) · ACM Conference on Economics and Computation · doi:10.1145/2229012.2229075 · Cited by 236 · see citing works
Self-citationRobertson, J. M., & Webb, W. R. (1998) · A K Peters/CRC Press eBooks · doi:10.1201/9781439863855 · Cited by 228 · see citing works
Stromquist, W. R. (1980) · American Mathematical Monthly · doi:10.1080/00029890.1980.11995109 · Cited by 214 · see citing works
Truth, justice, and cake cutting
Chen, Y., Lai, J. K., Parkes, D. C., et al. (2012) · Games and Economic Behavior · doi:10.1016/j.geb.2012.10.009 · Cited by 197 · see citing works
Even, S., & Paz, A. (1984) · Discrete Applied Mathematics · doi:10.1016/0166-218x(84)90005-2 · Cited by 144 · see citing works
Alon, N. (1987) · Advances in Mathematics · doi:10.1016/0001-8708(87)90055-7 · Cited by 117 · see citing works
Gutman, A., & Nisan, N. (2012) · Adaptive Agents and Multi-Agents Systems · doi:10.5555/2343776.2343799 · Cited by 97 · see citing works
Envy-Free Cake Divisions Cannot be Found by Finite Protocols
Stromquist, W. R. (2008) · The Electronic Journal of Combinatorics · doi:10.37236/735 · Cited by 95 · see citing works
Making decisions based on the preferences of multiple agents
Conitzer, V. (2010) · Communications of the ACM · doi:10.1145/1666420.1666442 · Cited by 93 · see citing works
Optimal Envy-Free Cake Cutting
Cohler, Y., Lai, J. K., Parkes, D. C., et al. (2011) · Proceedings of the AAAI Conference on Artificial Intelligence · doi:10.1609/aaai.v25i1.7874 · Cited by 92 · see citing works
Thou shalt covet thy neighbor's cake
Procaccia, A. D. (2009) · Cited by 75 · see citing works
Self-citationAlgorithmic Solutions for Envy-Free Cake Cutting
Deng, X., Qi, Q., & Saberi, A. (2012) · Operations Research · doi:10.1287/opre.1120.1116 · Cited by 72 · see citing works
Strategy-proofness versus efficiency on restricted domains of exchange economies
Schummer, J. (1996) · Social Choice and Welfare · doi:10.1007/s003550050050 · Cited by 72 · see citing works
On the complexity of cake cutting
Woeginger, G. J., & Sgall, J. (2006) · Discrete Optimization · doi:10.1016/j.disopt.2006.07.003 · Cited by 69 · see citing works
Optimal Proportional Cake Cutting with Connected Pieces
Bei, X., Chen, N., Hua, X., et al. (2021) · Proceedings of the AAAI Conference on Artificial Intelligence · doi:10.1609/aaai.v26i1.8243 · Cited by 68 · see citing works
Brams, S. J., & Jones, M. A. (2006) · Cited by 64 · see citing works
How to Cut a Cake Before the Party Ends
Kurokawa, D., Lai, J. K., & Procaccia, A. D. (2013) · Proceedings of the AAAI Conference on Artificial Intelligence · doi:10.1609/aaai.v27i1.8629 · Cited by 59 · see citing works
Self-citationNo agent left behind: dynamic fair division of multiple resources
Kash, I. A., Procaccia, A. D., & Shah, N. (2013) · doi:10.5555/2484920.2484977 · Cited by 58 · see citing works
Self-citationCake cutting really is not a piece of cake
Edmonds, J. A., & Pruhs, K. R. (2006) · Symposium on Discrete Algorithms · doi:10.5555/1109557.1109588 · Cited by 53 · see citing works
Brams, S. J., Feldman, M., Lai, J. K., et al. (2021) · Proceedings of the AAAI Conference on Artificial Intelligence · doi:10.1609/aaai.v26i1.8237 · Cited by 50 · see citing works
Mossel, E., & Tamuz, O. (2010) · CaltechAUTHORS (California Institute of Technology) · doi:10.5555/1929237.1929262 · Cited by 45 · see citing works
The Efficiency of Fair Division
Caragiannis, I., Kaklamanis, C., Kanellopoulos, P., et al. (2009) · Lecture notes in computer science · doi:10.1007/978-3-642-10841-9_45 · Cited by 32 · see citing works
N -Person Cake-Cutting: There May Be No Perfect Division
Brams, S. J., Jones, M. A., & Klamler, C. (2012) · American Mathematical Monthly · doi:10.4169/amer.math.monthly.120.01.035 · Cited by 32 · see citing works
Cake-Cutting Is Not a Piece of Cake
Magdon‐Ismail, M., Busch, C., & Krishnamoorthy, M. S. (2003) · Lecture notes in computer science · doi:10.1007/3-540-36494-3_52 · Cited by 31 · see citing works
The Efficiency of Fair Division with Connected Pieces
Aumann, Y., & Dombb, Y. (2010) · Lecture notes in computer science · doi:10.1007/978-3-642-17572-5_3 · Cited by 30 · see citing works
Computing socially-efficient cake divisions
Aumann, Y., Dombb, Y., & Hassidim, A. (2013) · Adaptive Agents and Multi-Agents Systems · doi:10.5555/2484920.2484976 · Cited by 27 · see citing works
Cutting a Cake for Five People
Saberi, A., & Wang, Y. (2009) · Lecture notes in computer science · doi:10.1007/978-3-642-02158-9_25 · Cited by 15 · see citing works
Throw One’s Cake — and Eat It Too
Arzi, O., Aumann, Y., & Dombb, Y. (2011) · Lecture notes in computer science · doi:10.1007/978-3-642-24829-0_8 · Cited by 14 · see citing works
Strategyproofness, Leontief Economies and the Kalai-Smorodinsky Solution
Friedman, E. J., Ghodsi, A., Shenker, S. J., et al. (2011) · Cited by 6 · see citing works
N-Person Cake-Cutting: There May Be No Perfect DivisionPreprint
Brams, S. J., Jones, M. A., & Klamler, C. (2011) · SSRN Electronic Journal · doi:10.2139/ssrn.1946993 · Cited by 2 · see citing works
Flagged first, then by citations
Cited by
Sorted by citations
Tackling climate change with machine learning
Rolnick, D., Donti, P. L., Kaack, L. H., Kochanski, K., Lacoste, A., Sankaran, K., Ross, A. S., Milojevic-Dupont, N., Jaques, N., Waldman-Brown, A., et al. (2023) · ACM Computing Surveys · doi:10.1145/3485128 · Cited by 336 · see citing works
- Authors
- Procaccia, A. D.
- Affiliations
- Carnegie Mellon University (US)
- Corresponding author
- Procaccia, Ariel D.
- ORCID
- Procaccia, Ariel D.
- Venue
- Communications of the ACM
- Published
- 2013-07
- Volume
- 56
- Issue
- 7
- Pages
- 78-87
- ISSN
- 0001-0782 (ISSN-L)
- 1557-7317
- OpenAlex
- W1994908533
- Cited by
- 156
- References
- 47
- Citations by year
- 2026: 3 · 2025: 6 · 2024: 7 · 2023: 9 · 2022: 14 · 2021: 11 · 2020: 11 · 2019: 13 · 2018: 13 · 2017: 13 · 2016: 10 · 2015: 21 · 2014: 17 · 2013: 8
- FWCI
- 43.68
- Type
- journal article
- Language
- en
- Open access
- closed
- Locations
- Communications of the ACM (publishedVersion)
- Funders
- Division of Computing and Communication Foundations (CCF-1215883)
- Topics
- Social Sciences › Economics, Econometrics and Finance › Economics and Econometrics › Game Theory and Voting Systems
- Physical Sciences › Computer Science › Computer Networks and Communications › Optimization and Search Problems
- Physical Sciences › Computer Science › Computational Theory and Mathematics › Complexity and Algorithms in Graphs
- Keywords
- cake cutting, fair division, divisible resources, resource allocation
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review