A simple random assignment problem with a unique solution

Summary.

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.