Truthful cake sharing

Author:

Bei Xiaohui,Lu Xinhang,Suksompong Warut

Abstract

AbstractThe classic cake cutting problem concerns the fair allocation of a heterogeneous resource among interested agents. In this paper, we study a public goods variant of the problem, where instead of competing with one another for the cake, the agents all share the same subset of the cake which must be chosen subject to a length constraint. We focus on the design of truthful and fair mechanisms in the presence of strategic agents who have piecewise uniform (i.e., approval) utilities over the cake. On the one hand, we show that the leximin solution is excludably truthful (meaning it is truthful when it can block each agent from accessing parts of the cake that the agent does not claim to desire) and moreover maximizes the guaranteed normalized egalitarian welfare among all excludably truthful and position oblivious mechanisms. On the other hand, we demonstrate that the maximum Nash welfare solution is excludably truthful for two agents (as it coincides with leximin in that case) but not in general. We also provide an impossibility result on truthfulness when blocking is not allowed, and adapt notions of representation to our setting.

Funder

Ministry of Education - Singapore

National University of Singapore

ARC Laureate Project

Publisher

Springer Science and Business Media LLC

Cited by 1 articles. 订阅此论文施引文献 订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献

1. Approval-based voting with mixed goods;Social Choice and Welfare;2024-02-27

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

"同舟云学术"是以全球学者为主线,采集、加工和组织学术论文而形成的新型学术文献查询和分析系统,可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容,当前同舟云学术共收录了国内外主流学术期刊6万余种,收集的期刊论文及会议论文总量共计约1.5亿篇,并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询!咨询电话:010-8811{复制后删除}0370

www.globalauthorid.com

TOP

Copyright © 2019-2024 北京同舟云网络信息技术有限公司
京公网安备11010802033243号  京ICP备18003416号-3