Research map / Multi-agent systems and games / Games and equilibria
Truthful Cake Sharing
Read the paperCheck your idea against 108,967 papers
AI-extracted summary. Written by AI from the paper's title only (no summary yet). Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.
Measured effects reported in the paper
| What was changed | Where | Measured | Effect |
|---|---|---|---|
| Use leximin with blocking under piecewise uniform utilities | Cake-sharing mechanism · Cake sharing, arbitrary number of agents | truthfulness | Helped |
| Use leximin rather than an unrestricted mechanism | Cake-sharing mechanism · Cake sharing, n agents, α ∈ (0,1) | egalitarian ratio: \frac{\alpha}{n-(n-1)\alpha}; upper bound for truthful position oblivious mechanisms | Helped |
| Use MNW with two agents | Cake-sharing mechanism · Cake sharing, two agents | truthfulness | Helped |
| Use MNW with three or more agents | Cake-sharing mechanism · Cake sharing, six-agent subset-reporting example | truthfulness: 1 | Hurt |
| Allow blocking agents from parts they do not report as desired | Truthful, Pareto optimal, position oblivious cake-sharing mechanisms · Cake sharing, two agents | egalitarian ratio: positive egalitarian ratio | Helped |
| Remove blocking (ablation) | Leximin · Cake sharing, two agents | truthfulness: 3/8 versus 1/2 | Hurt |
| Normalize each agent's utility for the whole cake to 1 before applying leximin (ablation) | Leximin · Cake sharing, two agents | truthfulness: 1/6; 2/9 | Hurt |
| Apply generalized leximin separately between public cost breakpoints | Generalized leximin · Cake sharing with piecewise constant costs | truthfulness | Helped |
| Use leximin | Cake-sharing mechanism · Justified representation (n ≥ 3) | PJR: α/2 < t | Hurt |
| Use MNW | Cake-sharing mechanism · Justified representation | EJR | Helped |
Closest papers by meaning
- Contiguous Cake Cutting: Hardness Results and Approximation Algorithms (AAAI 2020 · similarity 0.92)
- On Hierarchies of Fairness Notions in Cake Cutting: From Proportionality to Super Envy-Freeness (NeurIPS 2025 · similarity 0.90)
- Fair Division via the Cake-Cutting Share (AAAI 2025 · similarity 0.88)
- Constrained Fair and Efficient Allocations (AAAI 2025 · similarity 0.86)
- Almost Envy-Free Allocations of Indivisible Goods or Chores with Entitlements (AAAI 2024 · similarity 0.86)
- Reachability of Fair Allocations via Sequential Exchanges (AAAI 2024 · similarity 0.86)
Writing a paper in this area? scime draft is a free LaTeX editor with AI included, real-time co-authors and a check of your references and venue rules before you submit. It also imports OpenAI Prism projects.