When is the probabilistic serial assignment uniquely efficient and envy-free?
Author
Abstract
Suggested Citation
DOI: 10.1016/j.jmateco.2016.07.001
Download full text from publisher
As the access to this document is restricted, you may want to search for a different version of it.
References listed on IDEAS
- YIlmaz, Özgür, 2010. "The probabilistic serial mechanism with private endowments," Games and Economic Behavior, Elsevier, vol. 69(2), pages 475-491, July.
- Alcalde, Jose, 2013. "Random Housing with Existing Tenants," QM&ET Working Papers 13-5, University of Alicante, D. Quantitative Methods and Economic Theory.
- Kojima, Fuhito, 2009. "Random assignment of multiple indivisible objects," Mathematical Social Sciences, Elsevier, vol. 57(1), pages 134-142, January.
- Heo, Eun Jeong, 2014. "Probabilistic assignment problem with multi-unit demands: A generalization of the serial rule and its characterization," Journal of Mathematical Economics, Elsevier, vol. 54(C), pages 40-47.
- Fuhito Kojima & Parag A. Pathak, 2009. "Incentives and Stability in Large Two-Sided Matching Markets," American Economic Review, American Economic Association, vol. 99(3), pages 608-627, June.
- Demange, Gabrielle, 1982.
"Single-peaked orders on a tree,"
Mathematical Social Sciences, Elsevier, vol. 3(4), pages 389-396, December.
- Gabrielle Demange, 1982. "Single-peaked orders on a tree," Post-Print halshs-00671003, HAL.
- Kojima, Fuhito & Manea, Mihai, 2010. "Incentives in the probabilistic serial mechanism," Journal of Economic Theory, Elsevier, vol. 145(1), pages 106-123, January.
- Yeon-Koo Che & Fuhito Kojima, 2010.
"Asymptotic Equivalence of Probabilistic Serial and Random Priority Mechanisms,"
Econometrica, Econometric Society, vol. 78(5), pages 1625-1672, September.
- Yeon-Koo Che & Fuhito Kojima, 2008. "Asymptotic Equivalence of Probabilistic Serial and Random Priority Mechanisms," Cowles Foundation Discussion Papers 1677, Cowles Foundation for Research in Economics, Yale University.
- Katta, Akshay-Kumar & Sethuraman, Jay, 2006. "A solution to the random assignment problem on the full preference domain," Journal of Economic Theory, Elsevier, vol. 131(1), pages 231-250, November.
- Bogomolnaia, Anna & Heo, Eun Jeong, 2012. "Probabilistic assignment of objects: Characterizing the serial rule," Journal of Economic Theory, Elsevier, vol. 147(5), pages 2072-2082.
- Cho, Wonki Jo & Doğan, Battal, 2016. "Equivalence of efficiency notions for ordinal assignment problems," Economics Letters, Elsevier, vol. 146(C), pages 8-12.
- Cho, Wonki Jo, 2016. "Incentive properties for ordinal mechanisms," Games and Economic Behavior, Elsevier, vol. 95(C), pages 168-177.
- Bogomolnaia, Anna & Moulin, Herve, 2001. "A New Solution to the Random Assignment Problem," Journal of Economic Theory, Elsevier, vol. 100(2), pages 295-328, October.
- YIlmaz, Özgür, 2009. "Random assignment under weak preferences," Games and Economic Behavior, Elsevier, vol. 66(1), pages 546-558, May.
- Hashimoto, Tadashi & Hirata, Daisuke & Kesten, Onur & Kurino, Morimitsu & Unver, Utku, 2014. "Two axiomatic approaches to the probabilistic serial mechanism," Theoretical Economics, Econometric Society, vol. 9(1), January.
- Nehring, Klaus & Puppe, Clemens, 2007. "The structure of strategy-proof social choice -- Part I: General characterization and possibility results on median spaces," Journal of Economic Theory, Elsevier, vol. 135(1), pages 269-305, July.
- Alcalde, Jose & Silva-Reus, José Ángel, 2013. "Allocating via Priorities," QM&ET Working Papers 13-3, University of Alicante, D. Quantitative Methods and Economic Theory.
- Saban, Daniela & Sethuraman, Jay, 2014. "A note on object allocation under lexicographic preferences," Journal of Mathematical Economics, Elsevier, vol. 50(C), pages 283-289.
- Eun Heo, 2014. "The extended serial correspondence on a rich preference domain," International Journal of Game Theory, Springer;Game Theory Society, vol. 43(2), pages 439-454, May.
- Kesten, Onur, 2009. "Why do popular mechanisms lack efficiency in random environments?," Journal of Economic Theory, Elsevier, vol. 144(5), pages 2209-2226, September.
Citations
Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
Cited by:
- Liu, Peng, 2020. "Random assignments on sequentially dichotomous domains," Games and Economic Behavior, Elsevier, vol. 121(C), pages 565-584.
- Liu, Peng & Zeng, Huaxia, 2019. "Random assignments on preference domains with a tier structure," Journal of Mathematical Economics, Elsevier, vol. 84(C), pages 176-194.
- Doğan, Battal & Doğan, Serhat & Yıldız, Kemal, 2018. "A new ex-ante efficiency criterion and implications for the probabilistic serial mechanism," Journal of Economic Theory, Elsevier, vol. 175(C), pages 178-200.
Most related items
These are the items that most often cite the same works as this one and are cited by the same works as this one.- Wonki Jo Cho, 2018. "Probabilistic assignment: an extension approach," Social Choice and Welfare, Springer;The Society for Social Choice and Welfare, vol. 51(1), pages 137-162, June.
- Balbuzanov, Ivan, 2022. "Constrained random matching," Journal of Economic Theory, Elsevier, vol. 203(C).
- Haris Aziz & Yoichi Kasajima, 2017. "Impossibilities for probabilistic assignment," Social Choice and Welfare, Springer;The Society for Social Choice and Welfare, vol. 49(2), pages 255-275, August.
- Andrew McLennan & Shino Takayama & Yuki Tamura, 2024. "An Efficient, Computationally Tractable School Choice Mechanism," Discussion Papers Series 668, School of Economics, University of Queensland, Australia.
- Hougaard, Jens Leth & Moreno-Ternero, Juan D. & Østerdal, Lars Peter, 2014.
"Assigning agents to a line,"
Games and Economic Behavior, Elsevier, vol. 87(C), pages 539-553.
- Hougaard, Jens Leth & Moreno-Ternero, Juan D. & Østerdal, Lars Peter, 2012. "Assigning agents to a line," Discussion Papers on Economics 11/2012, University of Southern Denmark, Department of Economics.
- HOUGAARD, Jens L. & moreno-ternero, JUAN D. & OSTERDAL, Lars P., 2013. "Assigning agents to a line," LIDAM Discussion Papers CORE 2013015, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE).
- HOUGAARD, Jens Leth & MORENO-TERNERO, Juan D & OSTERDAL, Lars Peter, 2014. "Assigning agents to a line," LIDAM Reprints CORE 2631, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE).
- Jens L. Hougaard & Juan D. Moreno-Ternero & Lars P. Osterdal, 2014. "Assigning agents to a line," Working Papers 14.01, Universidad Pablo de Olavide, Department of Economics.
- Afacan, Mustafa Oǧuz, 2018. "The object allocation problem with random priorities," Games and Economic Behavior, Elsevier, vol. 110(C), pages 71-89.
- Shende, Priyanka & Purohit, Manish, 2023. "Strategy-proof and envy-free mechanisms for house allocation," Journal of Economic Theory, Elsevier, vol. 213(C).
- Han, Xiang, 2024. "A theory of fair random allocation under priorities," Theoretical Economics, Econometric Society, vol. 19(3), July.
- Cho, Wonki Jo, 2016. "Incentive properties for ordinal mechanisms," Games and Economic Behavior, Elsevier, vol. 95(C), pages 168-177.
- Sulagna Dasgupta & Debasis Mishra, 2020.
"Ordinal Bayesian incentive compatibility in random assignment model,"
Papers
2009.13104, arXiv.org, revised May 2021.
- Sulagna Dasgupta & Debasis Mishra, 2020. "Ordinal Bayesian incentive compatibility in random assignment model," Discussion Papers 20-06, Indian Statistical Institute, Delhi.
- Balbuzanov, Ivan, 2020. "Short trading cycles: Paired kidney exchange with strict ordinal preferences," Mathematical Social Sciences, Elsevier, vol. 104(C), pages 78-87.
- Heo, Eun Jeong, 2014. "Probabilistic assignment problem with multi-unit demands: A generalization of the serial rule and its characterization," Journal of Mathematical Economics, Elsevier, vol. 54(C), pages 40-47.
- Kesten, Onur & Unver, Utku, 2015.
"A theory of school choice lotteries,"
Theoretical Economics, Econometric Society, vol. 10(2), May.
- Onur Kesten & M. Utku Ünver, 2010. "A Theory of School-Choice Lotteries," Boston College Working Papers in Economics 737, Boston College Department of Economics, revised 29 Jun 2012.
- Chang, Hee-In & Chun, Youngsub, 2017. "Probabilistic assignment of indivisible objects when agents have the same preferences except the ordinal ranking of one object," Mathematical Social Sciences, Elsevier, vol. 90(C), pages 80-92.
- Sulagna Dasgupta & Debasis Mishra, 2022. "Ordinal Bayesian incentive compatibility in random assignment model," Review of Economic Design, Springer;Society for Economic Design, vol. 26(4), pages 651-664, December.
- Heo, Eun Jeong & Yılmaz, Özgür, 2015. "A characterization of the extended serial correspondence," Journal of Mathematical Economics, Elsevier, vol. 59(C), pages 102-110.
- Cho, Wonki Jo & Doğan, Battal, 2016. "Equivalence of efficiency notions for ordinal assignment problems," Economics Letters, Elsevier, vol. 146(C), pages 8-12.
- Bogomolnaia, Anna & Moulin, Herve, 2015. "Size versus fairness in the assignment problem," Games and Economic Behavior, Elsevier, vol. 90(C), pages 119-127.
- Onur Kesten & Morimitsu Kurino & Alexander S. Nesterov, 2017.
"Efficient lottery design,"
Social Choice and Welfare, Springer;The Society for Social Choice and Welfare, vol. 48(1), pages 31-57, January.
- Kesten, Onur & Kurino, Morimitsu & Nesterov, Alexander, 2015. "Efficient lottery design," Discussion Papers, Research Unit: Market Behavior SP II 2015-203, WZB Berlin Social Science Center.
- Kojima, Fuhito & Manea, Mihai, 2010. "Incentives in the probabilistic serial mechanism," Journal of Economic Theory, Elsevier, vol. 145(1), pages 106-123, January.
More about this item
Keywords
Probabilistic serial assignment; sd-efficiency; sd-no-envy; Top-objects divisibility; Preference richness; Recursive decomposability;All these keywords.
Statistics
Access and download statisticsCorrections
All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:eee:mateco:v:66:y:2016:i:c:p:14-25. See general information about how to correct material in RePEc.
If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.
If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .
If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Catherine Liu (email available below). General contact details of provider: http://www.elsevier.com/locate/jmateco .
Please note that corrections may take a couple of weeks to filter through the various RePEc services.