A simple random assignment problem with a unique solution

B-Tier
Journal: Economic Theory
Year: 2002
Volume: 19
Issue: 3
Pages: 623-636

Score contribution per author:

1.005 = (α=2.01 / 2 authors) × 1.0x B-tier

α: calibrated so average coauthorship-adjusted count equals average raw count

Abstract

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.

Technical Details

RePEc Handle
repec:spr:joecth:v:19:y:2002:i:3:p:623-636
Journal Field
Theory
Author Count
2
Added to Database
2026-01-24