Ordinal efficiency and dominated sets of assignments.
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...
| Publicado en: | Journal of Economic Theory Vol. 112; no. 1; pp. 157 - 173 |
|---|---|
| Autores principales: | , |
| Formato: | Artículo |
| Publicado: |
Academic Press Inc.
September 2003
|
| Materias: | |
| Acceso en línea: | Ver este registro en EBSCOhost |
| fields | @attributes: recordID: 1 pdfLink: plink: https://search.ebscohost.com/login.aspx?direct=true&db=ssf&AN=513147566&site=ehost-live header: @attributes: shortDbName: ssf uiTerm: 513147566 longDbName: Social Sciences Full Text (H.W. Wilson) uiTag: AN controlInfo: bkinfo: jinfo: jid: 00220531 RTH jtl: Journal of Economic Theory issn: 00220531 maglogo: N pubinfo: dt: September 2003 vid: 112 iid: 1 pid: 735 pub: Academic Press Inc. artinfo: ui: 513147566 10.1016/S0022-0531(03)00091-7 ppf: 157 ppct: 16 formats: tig: atl: Ordinal efficiency and dominated sets of assignments. aug: au: Abdulkadiroğlu, Atila Sönmez, Tayfun su: Resource allocation -- Mathematical models Random variables Housing Mathematical models of supply & demand sug: subj: Resource allocation -- Mathematical models Random variables Housing Mathematical models of supply & demand ab: 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. Copyright (c) 2003 Elsevier (USA) pubtype: Academic Journal doctype: Article src: R language: English refInfo: copyright: @attributes: flag: N holdings: @attributes: islocal: N |
|---|