A heuristic optimization of Bayesian incentive-compatible cake-cutting

DOI10.1016/j.cor.2016.05.009zbMath1349.91176OpenAlexW2396844017MaRDI QIDQ342509

Georges Zaccour, Lê Nguyên Hoang, François Soumis

Publication date: 17 November 2016

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cor.2016.05.009

zbMATH Keywords

fairnessincentive compatibilitycake-cutting problemreturn function

Mathematics Subject Classification ID

Applications of game theory (91A80) Resource and cost allocation (including fair division, apportionment, etc.) (91B32)

Cites Work

• Truth, justice, and cake cutting
• Bayesian algorithmic mechanism design
• Truthful Fair Division
• Optimal Auction Design
• Manipulation of Voting Schemes: A General Result
• Incentive Compatibility and the Bargaining Problem
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: A heuristic optimization of Bayesian incentive-compatible cake-cutting