Cited by 156Game Theory and Voting SystemsOptimization and Search ProblemsComplexity and Algorithms in Graphs

Cake cutting: not just child's play

Procaccia, Ariel D.·2013·Communications of the ACM

Abstract

How to fairly allocate divisible resources, and why computer scientists should take notice.

Integrity signals

Registry

Crossref · 10.1145/2483852.2483870

Cites

47 of 47 references verified0 citation errors · 0 not checkable

Statistics

Recomputing p-values needs the paper’s full text.

Claims the paper makes

This paper’s full text isn’t openly available, so its claims and self-check weren’t run. The registry and citation checks still apply.

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

Flagged first, then by citations

Cited by

Sorted by citations

Authors
Procaccia, A. D.
Affiliations
Carnegie Mellon University (US)
Corresponding author
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