Probabilistic assignment: an extension approach

Research output: Contribution to journalArticle

3 Citations (Scopus)

Abstract

We study the problem of allocating objects using lotteries when agents only submit preferences over objects. A standard approach is to “extend” agents’ preferences over objects to preferences over lotteries, using (first-order) stochastic dominance, or the sd-extension. Following (Cho, Games Econ Behav 95:168–177, 2016a), we complement this approach with two alternative extensions, the dl- and ul- extensions, that give rise to lexicographic preferences (dl stands for “downward lexicographic” and ul for “upward lexicographic”) and apply all three of them in tandem to probabilistic assignment. Each property of rules now has three versions that vary with the extension chosen. We introduce a family of rules that generalizes the probabilistic serial rule. Then we study their behavior, as well as that of the random priority rule, in terms of efficiency, no-envy, and strategy-proofness.

Original languageEnglish
Pages (from-to)137-162
Number of pages26
JournalSocial Choice and Welfare
Volume51
Issue number1
DOIs
Publication statusPublished - 2018 Jun 1

Fingerprint

envy
study behavior
efficiency
Assignment
Lottery
Serials
Priority rules
Strategy-proofness
Stochastic dominance
Lexicographic preferences
No-envy

ASJC Scopus subject areas

  • Social Sciences (miscellaneous)
  • Economics and Econometrics

Cite this

Probabilistic assignment : an extension approach. / Cho, Wonki.

In: Social Choice and Welfare, Vol. 51, No. 1, 01.06.2018, p. 137-162.

Research output: Contribution to journalArticle

@article{6238514a97fc441d9468b1a9e7731dea,
title = "Probabilistic assignment: an extension approach",
abstract = "We study the problem of allocating objects using lotteries when agents only submit preferences over objects. A standard approach is to “extend” agents’ preferences over objects to preferences over lotteries, using (first-order) stochastic dominance, or the sd-extension. Following (Cho, Games Econ Behav 95:168–177, 2016a), we complement this approach with two alternative extensions, the dl- and ul- extensions, that give rise to lexicographic preferences (dl stands for “downward lexicographic” and ul for “upward lexicographic”) and apply all three of them in tandem to probabilistic assignment. Each property of rules now has three versions that vary with the extension chosen. We introduce a family of rules that generalizes the probabilistic serial rule. Then we study their behavior, as well as that of the random priority rule, in terms of efficiency, no-envy, and strategy-proofness.",
author = "Wonki Cho",
year = "2018",
month = "6",
day = "1",
doi = "10.1007/s00355-018-1110-z",
language = "English",
volume = "51",
pages = "137--162",
journal = "Social Choice and Welfare",
issn = "0176-1714",
publisher = "Springer New York",
number = "1",

}

TY - JOUR

T1 - Probabilistic assignment

T2 - an extension approach

AU - Cho, Wonki

PY - 2018/6/1

Y1 - 2018/6/1

N2 - We study the problem of allocating objects using lotteries when agents only submit preferences over objects. A standard approach is to “extend” agents’ preferences over objects to preferences over lotteries, using (first-order) stochastic dominance, or the sd-extension. Following (Cho, Games Econ Behav 95:168–177, 2016a), we complement this approach with two alternative extensions, the dl- and ul- extensions, that give rise to lexicographic preferences (dl stands for “downward lexicographic” and ul for “upward lexicographic”) and apply all three of them in tandem to probabilistic assignment. Each property of rules now has three versions that vary with the extension chosen. We introduce a family of rules that generalizes the probabilistic serial rule. Then we study their behavior, as well as that of the random priority rule, in terms of efficiency, no-envy, and strategy-proofness.

AB - We study the problem of allocating objects using lotteries when agents only submit preferences over objects. A standard approach is to “extend” agents’ preferences over objects to preferences over lotteries, using (first-order) stochastic dominance, or the sd-extension. Following (Cho, Games Econ Behav 95:168–177, 2016a), we complement this approach with two alternative extensions, the dl- and ul- extensions, that give rise to lexicographic preferences (dl stands for “downward lexicographic” and ul for “upward lexicographic”) and apply all three of them in tandem to probabilistic assignment. Each property of rules now has three versions that vary with the extension chosen. We introduce a family of rules that generalizes the probabilistic serial rule. Then we study their behavior, as well as that of the random priority rule, in terms of efficiency, no-envy, and strategy-proofness.

UR - http://www.scopus.com/inward/record.url?scp=85040929376&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=85040929376&partnerID=8YFLogxK

U2 - 10.1007/s00355-018-1110-z

DO - 10.1007/s00355-018-1110-z

M3 - Article

AN - SCOPUS:85040929376

VL - 51

SP - 137

EP - 162

JO - Social Choice and Welfare

JF - Social Choice and Welfare

SN - 0176-1714

IS - 1

ER -