A simple random assignment problem with a unique solution

被引:50
作者
Bogomoinaia, A
Moulin, H
机构
[1] Rice Univ, Dept Econ, Houston, TX 77251 USA
[2] So Methodist Univ, Dept Econ, Dallas, TX 75275 USA
关键词
random assignment; no envy; strategy proofness; priority;
D O I
10.1007/s001990100168
中图分类号
F [经济];
学科分类号
02 ;
摘要
All agents have the same ordinal ranking over all objects, receiving no object (opting out) may be preferable to some objects, agents differ on which objects are worse than opting out, and the latter information is private. The Probabilistic Serial assignment, improves upon (in the Pareto sense) the Random Priority assignment, that randomly orders the agents and offers them successively the most valuable remaining object. We characterize Probabilistic Serial by efficiency in an ordinal sense, and envy-freeness. We characterize it also by ordinal efficiency, strategyproofness and equal treatment of equals.
引用
收藏
页码:623 / 635
页数:13
相关论文
共 12 条
[11]   ON A CONJECTURE BY GALE ABOUT ONE-SIDED MATCHING PROBLEMS [J].
ZHOU, L .
JOURNAL OF ECONOMIC THEORY, 1990, 52 (01) :123-135
[12]  
[No title captured]