Two axiomatic approaches to the probabilistic serial mechanism

Abstract

This paper studies the problem of assigning a set of indivisible objects to a set of agents when monetary transfers are not allowed and agents reveal only ordinal preferences, but random assignments are possible. We offer two characterizations of the probabilistic serial mechanism, which assigns lotteries over objects. We show that it is the only mechanism that satisfies non-wastefulness and ordinal fairness, and the only mechanism that satisfies sd-efficiency, sd-envy-freeness, and weak invariance or weak truncation robustness (where “sd” stands for first-order stochastic dominance).

Cite this work

No public copy is stored for this record, so only the metadata is cited.

Stored only when both papers are in the corpus — 93 citations exist upstream.

Papers that cite the same references — the relational fallback while embeddings are still backfilling.