Ordinal efficiency and dominated sets of assignments
Repository Usage Stats
Using lotteries is a common tool for allocating indivisible goods. Since obtaining preferences over lotteries is often difficult, real-life mechanisms usually rely on ordinal preferences over deterministic outcomes. Bogomolnaia and Moulin (J. Econom. Theory 19 (2002) 623) show that the outcome of an ex post efficient mechanism may be stochastically dominated. They define a random assignment to be ordinally efficient if and only if it is not stochastically dominated. In this paper we investigate the relation between ex post efficiency and ordinal efficiency. We introduce a new notion of domination defined over sets of assignments and show that a lottery induces an ordinally efficient random assignment if and only if each subset of the full support of the lottery is undominated. © 2003 Elsevier Inc. All rights reserved.
Published Version (Please cite this version)10.1016/S0022-0531(03)00091-7
Publication InfoAbdulkadiroǧlu, A; & Sönmez, T (2003). Ordinal efficiency and dominated sets of assignments. Journal of Economic Theory, 112(1). pp. 157-172. 10.1016/S0022-0531(03)00091-7. Retrieved from https://hdl.handle.net/10161/1940.
This is constructed from limited available data and may be imprecise. To cite this article, please review & use the official citation provided by the journal.
More InfoShow full item record