Lune

AAAI2026Top-tier venue

Truth, Justice, and Secrecy: Cake Cutting Under Privacy Constraints

Yaron Salman, Tamir Tassa, Omer Lev, Roie Zivan

Abstract

Cake-cutting algorithms, which aim to fairly allocate a continuous resource based on individual agent preferences, have seen significant progress over the past two decades. Much of the research has concentrated on fairness, with comparatively less attention given to other important aspects. In 2010, Chen et al. introduced an algorithm that, in addition to ensuring fairness, was strategyproof---meaning agents had no incentive to misreport their valuations. However, even in the absence of strategic incentives to misreport, agents may still hesitate to reveal their true preferences due to privacy concerns (e.g., when allocating advertising time between firms, revealing preferences could inadvertently expose planned marketing strategies or product launch timelines). In this work, we extend the strategyproof algorithm of Chen et al. by introducing a privacy-preserving dimension. To the best of our knowledge, we present the first private cake-cutting protocol, and, in addition, this protocol is also envy-free and strategyproof. Our approach replaces the algorithm’s centralized computation with a novel adaptation of cryptographic techniques, enabling privacy without compromising fairness or strategyproofness. Thus, our protocol encourages agents to report their true preferences not only because they are not incentivized to lie, but also because they are protected from having their preferences exposed.

Ask Lune

Know this paper in minutes, not an afternoon.

Lune can read every page of it and the top-tier papers that cite it, and gives you its claims, its evidence and its limits, each one cited to the paper it comes from. No skimming, no AI slop.

Questions to start from

Lune can draw on

the full paper · related work

Get the answer

Free to start. No credit card required.

Related papers

  1. How to Cut a Discrete Cake FairlyAyumi IgarashiAAAI 2023 · 18 citations
  2. Envy-Free Cake-Cutting for Four AgentsAlexandros Hollender, Aviad RubinsteinFOCS 2023 · 2 citations
  3. Verifying Cake-Cutting, FasterNoah Bertram, Tean Lai, Justin HsuCAV 2024
  4. Differentially Private Fair DivisionPasin Manurangsi, Warut SuksompongAAAI 2023 · 2 citations
  5. Truthful Cake SharingXiaohui Bei, Xinhang Lu, Warut SuksompongAAAI 2022 · 15 citations
Dusk over the sea between two cliffs drawn in fine vertical lines