The DOI matches its Crossref record; 7 of the 7 references it cites were found in a registry or an index.
An Envy-Free Cake Division Protocol
Abstract
(1995). An Envy-Free Cake Division Protocol. The American Mathematical Monthly: Vol. 102, No. 1, pp. 9-18.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
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
Cites
Steihaus, H. (1948) · Econometrica · Cited by 440
Dubins, L. E., & Spanier, E. H. (1961) · The American Mathematical Monthly · doi:10.1080/00029890.1961.11989615 · Cited by 385
Stromquist, W. (1980) · The American Mathematical Monthly · doi:10.1080/00029890.1980.11995109 · Cited by 215
Even, S., & Paz, A. (1984) · Discrete Applied Mathematics · doi:10.1016/0166-218x(84)90005-2 · Cited by 185
Woodall, D. R. (1980) · Journal of Mathematical Analysis and Applications · doi:10.1016/0022-247x(80)90225-5 · Cited by 94
A moving-knife solution to the four-person envy-free cake-division problem
Brams, S. J., Taylor, A. D., & Zwicker, W. S. (1997) · Proceedings of the American Mathematical Society · doi:10.1090/s0002-9939-97-03614-9 · Cited by 63
Self-citationAustin, A. K. (1982) · The Mathematical Gazette · doi:10.2307/3616548 · Cited by 54
Cited by
On approximately fair allocations of indivisible goods
Lipton, R. J., Markakis, E., Mossel, E., & Saberi, A. (2004) · Proceedings of the 5th ACM conference on Electronic commerce · doi:10.1145/988772.988792 · Cited by 514
Cake cutting: not just child's play
Procaccia, A. D. (2013) · Communications of the ACM · doi:10.1145/2483852.2483870 · Cited by 156
Metadata
- Authors
- Brams, S. J., & Taylor, A. D.
- Venue
- The American Mathematical Monthly
- Publisher
- Informa UK Limited
- Published
- 1995-01
- Volume
- 102
- Issue
- 1
- Pages
- 9-18
- ISSN
- 0002-9890 (ISSN-L)
- 1930-0972
- OpenAlex
- W2088036329
- Cited by
- 261
- References
- 7
- FWCI
- 16.86
- 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: An Envy-Free Cake Division Protocol. https://app.cochat.ai/papers/10.1080/00029890.1995.11990526
- The paper
- Brams, S. J., & Taylor, A. D. (1995). An Envy-Free Cake Division Protocol. The American Mathematical Monthly. https://doi.org/10.1080/00029890.1995.11990526
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.