摘要翻译:
在切蛋糕的过程中,从公平的角度来看,策略证明是一个非常昂贵的要求:对于n=2,它意味着独裁分配,而对于n>2,它要求一个代理人不能得到蛋糕。我们证明了Troyan和Morril最近提出的一个较弱的非明显可操作性与比例性的强公平性兼容,它保证每个代理得到1/N的蛋糕。最左边的叶片机构满足了这两个特性,这是Dubins-Spanier动刀程序的一种适应。文献中大多数其他经典比例机构显然是可操纵的,包括最初的动刀机构。非明显的可操作性解释了为什么最左边的叶子在实践中比其他比例机制更少被操纵。
---
英文标题:
《Obvious Manipulations in Cake-Cutting》
---
作者:
Josue Ortega and Erel Segal-Halevi
---
最新提交年份:
2019
---
分类信息:
一级分类:Computer Science 计算机科学
二级分类:Computer Science and Game Theory 计算机科学与博弈论
分类描述:Covers all theoretical and applied aspects at the intersection of computer science and game theory, including work in mechanism design, learning in games (which may overlap with Learning), foundations of agent modeling in games (which may overlap with Multiagent systems), coordination, specification and formal methods for non-cooperative computational environments. The area also deals with applications of game theory to areas such as electronic commerce.
涵盖计算机科学和博弈论交叉的所有理论和应用方面,包括机制设计的工作,游戏中的学习(可能与学习重叠),游戏中的agent建模的基础(可能与多agent系统重叠),非合作计算环境的协调、规范和形式化方法。该领域还涉及博弈论在电子商务等领域的应用。
--
一级分类:Economics 经济学
二级分类:Theoretical Economics 理论经济学
分类描述:Includes theoretical contributions to Contract Theory, Decision Theory, Game Theory, General Equilibrium, Growth, Learning and Evolution, Macroeconomics, Market and Mechanism Design, and Social Choice.
包括对契约理论、决策理论、博弈论、一般均衡、增长、学习与进化、宏观经济学、市场与机制设计、社会选择的理论贡献。
--
---
英文摘要:
In cake-cutting, strategy-proofness is a very costly requirement in terms of fairness: for n=2 it implies a dictatorial allocation, whereas for n > 2 it requires that one agent receives no cake. We show that a weaker version of this property recently suggested by Troyan and Morril, called non-obvious manipulability, is compatible with the strong fairness property of proportionality, which guarantees that each agent receives 1/n of the cake. Both properties are satisfied by the leftmost leaves mechanism, an adaptation of the Dubins - Spanier moving knife procedure. Most other classical proportional mechanisms in literature are obviously manipulable, including the original moving knife mechanism. Non-obvious manipulability explains why leftmost leaves is manipulated less often in practice than other proportional mechanisms.
---
PDF链接:
https://arxiv.org/pdf/1908.02988