IDEAS home Printed from https://ideas.repec.org/p/arx/papers/2511.04142.html

A characterization of strategy-proof probabilistic assignment rules

Author

Listed:
  • Sai Praneeth Donthu
  • Souvik Roy
  • Soumyarup Sadhukhan
  • Gogulapati Sreedurga

Abstract

We study the classical probabilistic assignment problem, where finitely many indivisible objects are to be probabilistically or proportionally assigned among an equal number of agents. Each agent has an initial deterministic endowment and a strict preference over the objects. While the deterministic version of this problem is well understood, most notably through the characterization of the Top Trading Cycles (TTC) rule by Ma (1994), much less is known in the probabilistic setting. Motivated by practical considerations, we introduce a weakened incentive requirement, namely SD-top-strategy-proofness, which precludes only those manipulations that increase the probability of an agent's top-ranked object. Our first main result shows that, on any free pair at the top (FPT) domain (Sen, 2011), the TTC rule is the unique probabilistic assignment rule satisfying SD-Pareto efficiency, SD-individual rationality, and SD-top-strategy-proofness. We further show that this characterization remains valid when Pareto efficiency is replaced by the weaker notion of SD-pair efficiency, provided the domain satisfies the slightly stronger free triple at the top (FTT) condition (Sen, 2011). Finally, we extend these results to the ex post notions of efficiency and individual rationality. Together, our findings generalize the classical deterministic results of Ma (1994) and Ekici (2024) along three dimensions: extending them from deterministic to probabilistic settings, from full strategy-proofness to top-strategy-proofness, and from the unrestricted domain to the more general FPT and FTT domains.

Suggested Citation

  • Sai Praneeth Donthu & Souvik Roy & Soumyarup Sadhukhan & Gogulapati Sreedurga, 2025. "A characterization of strategy-proof probabilistic assignment rules," Papers 2511.04142, arXiv.org.
    • Handle: RePEc:arx:papers:2511.04142
    as

    Download full text from publisher

    File URL: http://arxiv.org/pdf/2511.04142
    File Function: Latest version
    Download Restriction: no
    ---><---

    References listed on IDEAS

    as
    1. Cho, Wonki Jo & Doğan, Battal, 2016. "Equivalence of efficiency notions for ordinal assignment problems," Economics Letters, Elsevier, vol. 146(C), pages 8-12.
    2. Gibbard, Allan, 1977. "Manipulation of Schemes That Mix Voting with Chance," Econometrica, Econometric Society, vol. 45(3), pages 665-681, April.
    3. Shapley, Lloyd & Scarf, Herbert, 1974. "On cores and indivisibility," Journal of Mathematical Economics, Elsevier, vol. 1(1), pages 23-37, March.
    4. Ma, Jinpeng, 1994. "Strategy-Proofness and the Strict Core in a Market with Indivisibilities," International Journal of Game Theory, Springer;Game Theory Society, vol. 23(1), pages 75-83.
    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. Sreedurga Gogulapati & Yadati Narahari & Souvik Roy & Soumyarup Sadhukhan, 2025. "On Probabilistic Assignment Rules," Papers 2507.09550, arXiv.org.
    2. Harless, Patrick & Phan, William, 2022. "Efficient mixtures of priority rules for assigning objects," Games and Economic Behavior, Elsevier, vol. 132(C), pages 73-89.
    3. Abdulkadiroglu, Atila & Sonmez, Tayfun, 1999. "House Allocation with Existing Tenants," Journal of Economic Theory, Elsevier, vol. 88(2), pages 233-260, October.
    4. Tommy Andersson & Lars Ehlers & Lars-Gunnar Svensson & Ryan Tierney, 2022. "Gale’s Fixed Tax for Exchanging Houses," Mathematics of Operations Research, INFORMS, vol. 47(4), pages 3110-3128, November.
    5. Ata Atay & Ana Mauleon & Vincent Vannetelbosch, 2025. "Limited Farsightedness in Priority‐Based Matching," Journal of Public Economic Theory, Association for Public Economic Theory, vol. 27(4), August.
    6. Yajing Chen & Zhenhua Jiao & Chenfeng Zhang & Luosai Zhang, 2021. "The Machiavellian frontier of top trading cycles," Papers 2106.14456, arXiv.org, revised Apr 2024.
    7. Ivan Balbuzanov & Maciej H. Kotowski, 2019. "Endowments, Exclusion, and Exchange," Econometrica, Econometric Society, vol. 87(5), pages 1663-1692, September.
    8. Takamiya, Koji, 2001. "Coalition strategy-proofness and monotonicity in Shapley-Scarf housing markets," Mathematical Social Sciences, Elsevier, vol. 41(2), pages 201-213, March.
    9. Di Feng & Bettina Klaus, 2022. "Preference revelation games and strict cores of multiple‐type housing market problems," International Journal of Economic Theory, The International Society for Economic Theory, vol. 18(1), pages 61-76, March.
    10. Onur Kesten, 2012. "On two kinds of manipulation for school choice problems," Economic Theory, Springer;Society for the Advancement of Economic Theory (SAET), vol. 51(3), pages 677-693, November.
    11. Sonmez, Tayfun & Utku Unver, M., 2005. "House allocation with existing tenants: an equivalence," Games and Economic Behavior, Elsevier, vol. 52(1), pages 153-185, July.
    12. Bettina Klaus & David F. Manlove & Francesca Rossi, 2014. "Matching under Preferences," Cahiers de Recherches Economiques du Département d'économie 14.07, Université de Lausanne, Faculté des HEC, Département d’économie.
    13. Diebold, Franz & Bichler, Martin, 2017. "Matching with indifferences: A comparison of algorithms in the context of course allocation," European Journal of Operational Research, Elsevier, vol. 260(1), pages 268-282.
    14. Aslan, Fatma & Lainé, Jean, 2020. "Competitive equilibria in Shapley–Scarf markets with couples," Journal of Mathematical Economics, Elsevier, vol. 89(C), pages 66-78.
    15. Feng, Di, 2025. "Efficiency in multiple-type housing markets," Journal of Mathematical Economics, Elsevier, vol. 119(C).
    16. Tommy ANDERSSON & Lars EHLERS & Lars-Gunnar SVENSSON, 2014. "Transferring Ownership of Public Housing to Existing Tenants : A Mechanism Design Approach," Cahiers de recherche 09-2014, Centre interuniversitaire de recherche en économie quantitative, CIREQ.
    17. Julien Combe, 2023. "Reallocation with priorities and minimal envy mechanisms," Economic Theory, Springer;Society for the Advancement of Economic Theory (SAET), vol. 76(2), pages 551-584, August.
    18. 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.
    19. Patrick Harless & William Phan, 2020. "On endowments and indivisibility: partial ownership in the Shapley–Scarf model," Economic Theory, Springer;Society for the Advancement of Economic Theory (SAET), vol. 70(2), pages 411-435, September.
    20. Kazuhiko Hashimoto, 2018. "Strategy-proofness and identical preferences lower bound in allocation problem of indivisible objects," Economic Theory, Springer;Society for the Advancement of Economic Theory (SAET), vol. 65(4), pages 1045-1078, June.

    More about this item

    NEP fields

    This paper has been announced in the following NEP Reports:

    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:arx:papers:2511.04142. 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: arXiv administrators (email available below). General contact details of provider: http://arxiv.org/ .

    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.