Pairwise efficiency and monotonicity imply Pareto efficiency in (probabilistic) object allocation
Abstract
We consider object allocation problems with capacities (see, e.g., Abdulkadiroglu and Sonmez, 1998; Basteck, 2025) where objects have to be assigned to agents. We show that if a lottery rule satisfies ex-post non-wastefulness and probabilistic (Maskin) monotonicity, then ex-post pairwise efficiency is equivalent to ex-post Pareto efficiency. This result allows for a strengthening of various existing characterization results, both for lottery rules and deterministic rules, by replacing (ex-post) Pareto efficiency with (ex-post) pairwise efficiency, e.g., for characterizations of the Random Serial Dictatorship rule (Basteck, 2025), Trading Cycles rules (Pycia and Unver, 2017), and Hierarchical Exchange rules (Papai, 2000).
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.