IDEAS home Printed from https://ideas.repec.org/a/eee/gamebe/v155y2026icp10-26.html

A maximal domain for weak stochastic dominance strategy-proofness of the extended probabilistic serial correspondence

Author

Listed:
  • Yun, Kiyong
  • Chun, Youngsub

Abstract

On the strict preference domain, Bogomolnaia and Moulin (2001) introduce the probabilistic serial rule and show that the rule is weakly stochastic dominance strategy-proof. Katta and Sethuraman (2006) introduce the extended probabilistic serial correspondence, which generalizes the probabilistic serial rule to the full preference domain. However, this correspondence is not weakly stochastic dominance strategy-proof. In this paper, we introduce a subdomain of the full preference domain, which we call “the sequentially ranked from the top domain,” on which the correspondence is weakly stochastic dominance strategy-proof. In fact, it is a maximal domain on which the three requirements of stochastic dominance efficiency, stochastic dominance envyfreeness, and weak stochastic dominance strategy-proofness are compatible. In addition, on this domain, we provide an axiomatic characterization of it by adapting its characterization on the full preference domain (Heo and Yılmaz, 2015).

Suggested Citation

  • Yun, Kiyong & Chun, Youngsub, 2026. "A maximal domain for weak stochastic dominance strategy-proofness of the extended probabilistic serial correspondence," Games and Economic Behavior, Elsevier, vol. 155(C), pages 10-26.
    • Handle: RePEc:eee:gamebe:v:155:y:2026:i:c:p:10-26
    DOI: 10.1016/j.geb.2025.10.001
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0899825625001447
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.geb.2025.10.001?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to

    for a different version of it.

    References listed on IDEAS

    as
    1. Sato, Shin, 2013. "A sufficient condition for the equivalence of strategy-proofness and nonmanipulability by preferences adjacent to the sincere one," Journal of Economic Theory, Elsevier, vol. 148(1), pages 259-278.
    2. 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.
    3. Liu, Peng, 2020. "Random assignments on sequentially dichotomous domains," Games and Economic Behavior, Elsevier, vol. 121(C), pages 565-584.
    4. 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.
    5. Ramezanian, Rasoul & Feizi, Mehdi, 2021. "Stepwise ordinal efficiency for the random assignment problem," Journal of Mathematical Economics, Elsevier, vol. 92(C), pages 60-65.
    6. Cho, Wonki Jo, 2016. "Incentive properties for ordinal mechanisms," Games and Economic Behavior, Elsevier, vol. 95(C), pages 168-177.
    7. D. Marc Kilgour & Jean-Charles Grégoire & Angèle M. Foley, 2020. "The prevalence and consequences of ballot truncation in ranked-choice elections," Public Choice, Springer, vol. 184(1), pages 197-218, July.
    8. Arnaud Dellis & Sean D’Evelyn & Katerina Sherstyuk, 2011. "Multiple votes, ballot truncation and the two-party system: an experiment," Social Choice and Welfare, Springer;The Society for Social Choice and Welfare, vol. 37(2), pages 171-200, July.
    9. Nesterov, Alexander S., 2017. "Fairness and efficiency in strategy-proof object allocation mechanisms," Journal of Economic Theory, Elsevier, vol. 170(C), pages 145-168.
    10. 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.
    11. 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.
    12. Feizi, Mehdi & Ramezanian, Rasoul, 2023. "A new impossibility result for random assignments," Journal of Mathematical Economics, Elsevier, vol. 107(C).
    13. Eric Kamwa, 2022. "Scoring Rules, Ballot Truncation, and the Truncation Paradox," Working Papers hal-03632662, HAL.
    14. 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.
    15. Yun, Kiyong, 2025. "Impossibility results in the probabilistic assignment problem with stochastic same-sidedness and minimal invariance," Journal of Mathematical Economics, Elsevier, vol. 121(C).
    16. Eric Kamwa, 2022. "Scoring rules, ballot truncation, and the truncation paradox," Public Choice, Springer, vol. 192(1), pages 79-97, July.
    17. Yoichi Kasajima, 2013. "Probabilistic assignment of indivisible goods with single-peaked preferences," Social Choice and Welfare, Springer;The Society for Social Choice and Welfare, vol. 41(1), pages 203-215, June.
    18. 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.
    19. 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.
    20. Aziz, Haris & Luo, Pang & Rizkallah, Christine, 2017. "Incompatibility of efficiency and strategyproofness in the random assignment setting with indifferences," Economics Letters, Elsevier, vol. 160(C), pages 46-49.
    21. Donald Saari & Jill Newenhizen, 1988. "The problem of indeterminacy in approval, multiple, and truncated voting systems," Public Choice, Springer, vol. 59(2), pages 101-120, November.
    22. 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.
    23. 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.
    24. Ramezanian, Rasoul & Feizi, Mehdi, 2022. "Robust ex-post Pareto efficiency and fairness in random assignments: Two impossibility results," Games and Economic Behavior, Elsevier, vol. 135(C), pages 356-367.
    25. Peter Fishburn & Steven Brams, 1984. "Manipulability of voting by sincere truncation of preferences," Public Choice, Springer, vol. 44(3), pages 397-410, January.
    Full references (including those not matched with items on IDEAS)

    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.
    1. 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.
    2. Yun, Kiyong, 2025. "Impossibility results in the probabilistic assignment problem with stochastic same-sidedness and minimal invariance," Journal of Mathematical Economics, Elsevier, vol. 121(C).
    3. 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.
    4. Basteck, Christian & Ehlers, Lars, 2023. "Strategy-proof and envy-free random assignment," Journal of Economic Theory, Elsevier, vol. 209(C).
    5. Chen, Yajing & Jiao, Zhenhua & Zhao, Fang, 2025. "The equivalence between random priority and probabilistic serial rule on restricted preference domains," Economics Letters, Elsevier, vol. 251(C).
    6. Shende, Priyanka & Purohit, Manish, 2023. "Strategy-proof and envy-free mechanisms for house allocation," Journal of Economic Theory, Elsevier, vol. 213(C).
    7. Sulagna Dasgupta & Debasis Mishra, 2020. "Ordinal Bayesian incentive compatibility in random assignment model," Papers 2009.13104, arXiv.org, revised May 2021.
    8. 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.
    9. Anna Bogomolnaia, 2024. "On slots’ scheduling," Economic Theory, Springer;Society for the Advancement of Economic Theory (SAET), vol. 77(3), pages 653-674, May.
    10. Balbuzanov, Ivan, 2022. "Constrained random matching," Journal of Economic Theory, Elsevier, vol. 203(C).
    11. 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.
    12. 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.
    13. Ping Zhan, 2023. "A Simple Characterization of Assignment Mechanisms on Set Constraints," SN Operations Research Forum, Springer, vol. 4(2), pages 1-15, June.
    14. 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.
    15. 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.
    16. 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.
    17. Basteck, Christian & Ehlers, Lars H., 2022. "Strategy-proof and envy-free random assignment," Discussion Papers, Research Unit: Market Behavior SP II 2022-208, WZB Berlin Social Science Center.
    18. Altuntaş, Açelya & Phan, William & Tamura, Yuki, 2023. "Some characterizations of Generalized Top Trading Cycles," Games and Economic Behavior, Elsevier, vol. 141(C), pages 156-181.
    19. Mustafa Oğuz Afacan, 2023. "Axiomatic characterizations of the constrained probabilistic serial mechanism," Theory and Decision, Springer, vol. 95(3), pages 465-484, October.
    20. Kiran Tomlinson & Johan Ugander & Jon Kleinberg, 2022. "Ballot Length in Instant Runoff Voting," Papers 2207.08958, arXiv.org, revised Dec 2022.

    More about this item

    Keywords

    ;
    ;
    ;
    ;
    ;
    ;

    JEL classification:

    • C78 - Mathematical and Quantitative Methods - - Game Theory and Bargaining Theory - - - Bargaining Theory; Matching Theory
    • D61 - Microeconomics - - Welfare Economics - - - Allocative Efficiency; Cost-Benefit Analysis
    • D63 - Microeconomics - - Welfare Economics - - - Equity, Justice, Inequality, and Other Normative Criteria and Measurement

    Statistics

    Access and download statistics

    Corrections

    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:gamebe:v:155:y:2026:i:c:p:10-26. 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/inca/622836 .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.