Strategy-proof cake cutting mechanisms for all-or-nothing utility

DOI10.3233/FI-2018-1641MaRDI QIDQ4637869zbMATH OpenFDO

Authors Takamasa Ihara, Shunsuke Tsuruta, Taiki Todo, Yuko Sakurai, Makoto Yokoo

Publication date 3 May 2018

Published in Fundamenta Informaticae (Search for Journal in Brave)

zbMATH Keywords

mechanism designstrategy-proofnesscake cuttingnon-additive preference

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Resource and cost allocation (including fair division, apportionment, etc.) (91B32)

Recommendations

• Truthful fair division without free disposal
• Cake cutting algorithms for piecewise constant and piecewise uniform valuations
• Truth, justice, and cake cutting
• Truthful Fair Division
• Algorithmic solutions for envy-free cake cutting

Cited in

(1)

• A heuristic optimization of Bayesian incentive-compatible cake-cutting

This page was built for publication: Strategy-proof cake cutting mechanisms for all-or-nothing utility

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4637869)