The DOI matches its Crossref record.
Cake-Cutting Algorithms: Be Fair if You Can.
Abstract
The challenge of dividing an asset fairly, from cakes to more important properties, is of great practical importance in many situations. Since the famous Polish school of mathematicians (Steinhaus, Banach, and Knaster) introduced and described algorithms for the division problem in the 1940s, the concept has been widely popularized. This book gathers into one readable and inclusive source a comprehensive discussion of the state of the art in cake-cutting problems for both the novice and the professional. It offers a complete treatment of all cake-cutting algorithms under all the considered definitions of fair and presents them in a coherent, reader-friendly manner. Robertson and Webb have brought this elegant problem to life for both the bright high school student and the professional researcher.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cited by
Cake cutting: not just child's play
Procaccia, A. D. (2013) · Communications of the ACM · doi:10.1145/2483852.2483870 · Cited by 156
Consensus-halving via theorems of Borsuk-Ulam and Tucker
Simmons, F. W., & Su, F. E. (2003) · Mathematical Social Sciences · doi:10.1016/s0165-4896(02)00087-2 · Cited by 74
Self-citation
Metadata
- Authors
- Su, F. E., Robertson, J., & Webb, W.
- Venue
- The American Mathematical Monthly
- Publisher
- Informa UK Limited
- Published
- 2000-02
- Volume
- 107
- Issue
- 2
- Pages
- 185
- ISSN
- 0002-9890 (ISSN-L)
- OpenAlex
- W1977246877
- Cited by
- 343
- References
- 0
- FWCI
- 17.83
- Type
- journal article
- Language
- en
- Open access
- closed
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
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Cake-Cutting Algorithms: Be Fair if You Can. https://app.cochat.ai/papers/10.2307/2589459
- The paper
- Su, F. E., Robertson, J., & Webb, W. (2000). Cake-Cutting Algorithms: Be Fair if You Can. The American Mathematical Monthly. https://doi.org/10.2307/2589459
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.
