摘要翻译:
我们研究了当$n$agent可以表示严格的纯序数偏好和偏好强度时,将$n$agent的不可分对象分配给$n$agent的问题。我们提出了一个基于等级的准则,在这种环境下对偏好强度进行有序的人际比较,而不假设人际间的可比较效用。然后,如果一个分配是帕累托有效的,我们就把它定义为“强度有效的”,并且当另一个分配以“翻转”的方式把相同的对象对分配给相同的代理对时,前者就把每一个这样的对中共同偏好的替代方案分配给更喜欢它的代理。我们证明了当$n=3$时,对所有1728个剖面都存在强度有效分配。
---
英文标题:
《Intensity-Efficient Allocations》
---
作者:
Georgios Gerasimou
---
最新提交年份:
2020
---
分类信息:
一级分类: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.
包括对契约理论、决策理论、博弈论、一般均衡、增长、学习与进化、宏观经济学、市场与机制设计、社会选择的理论贡献。
--
---
英文摘要:
We study the problem of allocating $n$ indivisible objects to $n$ agents when the latter can express strict and purely ordinal preferences and preference intensities. We suggest a rank-based criterion to make ordinal interpersonal comparisons of preference intensities in such an environment without assuming interpersonally comparable utilities. We then define an allocation to be \"intensity-efficient\" if it is Pareto efficient and also such that, whenever another allocation assigns the same pairs of objects to the same pairs of agents but in a \"flipped\" way, then the former assigns the commonly preferred alternative within every such pair to the agent who prefers it more. We show that an intensity-efficient allocation exists for all 1,728 profiles when $n=3$.
---
PDF下载:
-->