A characterization of the extended serial correspondence
Author
Abstract
Suggested Citation
DOI: 10.1016/j.jmateco.2015.05.003
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
- 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.
- 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.
- 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.
- Onur Kesten & Morimitsu Kurino & M. Utku Ünver, 2010. "Fair and Efficient Assignment via the Probabilistic Serial Mechanism," Boston College Working Papers in Economics 742, Boston College Department of Economics, revised 30 May 2011.
- 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.
- 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.
- 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.
Citations
Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
Cited by:
- Balbuzanov, Ivan, 2022. "Constrained random matching," Journal of Economic Theory, Elsevier, vol. 203(C).
- Mustafa Oǧuz Afacan, 2016. "Characterizations of the cumulative offer process," Social Choice and Welfare, Springer;The Society for Social Choice and Welfare, vol. 47(3), pages 531-542, October.
- Youngsub Chun & Kiyong Yun, 2020. "Upper-contour strategy-proofness in the probabilistic assignment problem," Social Choice and Welfare, Springer;The Society for Social Choice and Welfare, vol. 54(4), pages 667-687, April.
- Ping Zhan, 2023. "A Simple Characterization of Assignment Mechanisms on Set Constraints," SN Operations Research Forum, Springer, vol. 4(2), pages 1-15, June.
- Han, Xiang, 2024. "A theory of fair random allocation under priorities," Theoretical Economics, Econometric Society, vol. 19(3), July.
- Mustafa Oğuz Afacan, 2023. "Axiomatic characterizations of the constrained probabilistic serial mechanism," Theory and Decision, Springer, vol. 95(3), pages 465-484, October.
- Shende, Priyanka & Purohit, Manish, 2023. "Strategy-proof and envy-free mechanisms for house allocation," Journal of Economic Theory, Elsevier, vol. 213(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.
- Tayfun Sönmez & M. Utku Ünver, 2024. "Matching under Non-transferable Utility: Theory," Boston College Working Papers in Economics 1068, Boston College Department of Economics.
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.- Balbuzanov, Ivan, 2022. "Constrained random matching," Journal of Economic Theory, Elsevier, vol. 203(C).
- Cho, Wonki Jo, 2016. "When is the probabilistic serial assignment uniquely efficient and envy-free?," Journal of Mathematical Economics, Elsevier, vol. 66(C), pages 14-25.
- 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.
- Shende, Priyanka & Purohit, Manish, 2023. "Strategy-proof and envy-free mechanisms for house allocation," Journal of Economic Theory, Elsevier, vol. 213(C).
- 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 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).
- 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).
- 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.
- Bogomolnaia, Anna, 2015. "Random assignment: Redefining the serial rule," Journal of Economic Theory, Elsevier, vol. 158(PA), pages 308-318.
- 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.
- 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.
- Ping Zhan, 2023. "A Simple Characterization of Assignment Mechanisms on Set Constraints," SN Operations Research Forum, Springer, vol. 4(2), pages 1-15, June.
- 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.
- Anna Bogomolnaia, 2015. "The Most Ordinally-Efficient of Random Voting Rules," HSE Working papers WP BRP 106/EC/2015, National Research University Higher School of Economics.
- Mustafa Oğuz Afacan, 2023. "Axiomatic characterizations of the constrained probabilistic serial mechanism," Theory and Decision, Springer, vol. 95(3), pages 465-484, October.
- Youngsub Chun & Kiyong Yun, 2020. "Upper-contour strategy-proofness in the probabilistic assignment problem," Social Choice and Welfare, Springer;The Society for Social Choice and Welfare, vol. 54(4), pages 667-687, April.
- Basteck, Christian & Ehlers, Lars, 2021. "Strategy-Proof and Envy-Free Random Assignment," Rationality and Competition Discussion Paper Series 307, CRC TRR 190 Rationality and Competition.
- Harless, Patrick, 2019. "Efficient rules for probabilistic assignment," Journal of Mathematical Economics, Elsevier, vol. 84(C), pages 107-116.
- Yajing Chen & Patrick Harless & Zhenhua Jiao, 2021. "The probabilistic rank random assignment rule and its axiomatic characterization," Papers 2104.09165, arXiv.org.
- 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.
- Kesten, Onur & Kurino, Morimitsu & Ünver, M. Utku, 2017. "On characterizations of the probabilistic serial mechanism involving incentive and invariance properties," Mathematical Social Sciences, Elsevier, vol. 90(C), pages 56-62.
- 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.
- Bogomolnaia, Anna & Moulin, Herve, 2015. "Size versus fairness in the assignment problem," Games and Economic Behavior, Elsevier, vol. 90(C), pages 119-127.
More about this item
Keywords
The serial rule; Sd-efficiency; Sd no-envy; The extended serial correspondence; Limited invariance;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:59:y:2015:i:c:p:102-110. 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.