IDEAS home Printed from https://ideas.repec.org/a/eee/mateco/v84y2019icp107-116.html
   My bibliography  Save this article

Efficient rules for probabilistic assignment

Author

Listed:
  • Harless, Patrick

Abstract

We propose an algorithm to construct sd-efficient probabilistic allocations of objects. Our algorithm proceeds in discrete rounds and distributes probability shares of objects sequentially yielding two natural degrees of freedom: selection rules governing the choice of objects in each round and distribution rules governing the dispensation of probability shares. The transparent procedure tightly connects properties of the rule to these choices making it ideally suited for practical applications. First proving that the algorithm identifies all sd-efficient allocations, we apply the technique to obtain a surprising and “decentralized” representation of the serial rule. Further applications construct new sd-efficient rules.

Suggested Citation

  • Harless, Patrick, 2019. "Efficient rules for probabilistic assignment," Journal of Mathematical Economics, Elsevier, vol. 84(C), pages 107-116.
    • Handle: RePEc:eee:mateco:v:84:y:2019:i:c:p:107-116
    DOI: 10.1016/j.jmateco.2019.07.006
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0304406819300795
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.jmateco.2019.07.006?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 search for a different version of it.

    References listed on IDEAS

    as
    1. H. Peyton Young, 1987. "On Dividing an Amount According to Individual Claims or Liabilities," Mathematics of Operations Research, INFORMS, vol. 12(3), pages 398-414, August.
    2. Ju, Biung-Ghi & Moreno-Ternero, Juan D., 2018. "Entitlement Theory Of Justice And End-State Fairness In The Allocation Of Goods," Economics and Philosophy, Cambridge University Press, vol. 34(3), pages 317-341, November.
    3. Kesten, Onur & Unver, Utku, 2015. "A theory of school choice lotteries," Theoretical Economics, Econometric Society, vol. 10(2), May.
    4. 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.
    5. Abdulkadiroglu, Atila & Sonmez, Tayfun, 2003. "Ordinal efficiency and dominated sets of assignments," Journal of Economic Theory, Elsevier, vol. 112(1), pages 157-172, September.
    6. Thomson, William, 2003. "Axiomatic and game-theoretic analysis of bankruptcy and taxation problems: a survey," Mathematical Social Sciences, Elsevier, vol. 45(3), pages 249-297, July.
    7. 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.
    8. Hylland, Aanund & Zeckhauser, Richard, 1979. "The Efficient Allocation of Individuals to Positions," Journal of Political Economy, University of Chicago Press, vol. 87(2), pages 293-314, April.
    9. Bogomolnaia, Anna, 2015. "Random assignment: Redefining the serial rule," Journal of Economic Theory, Elsevier, vol. 158(PA), pages 308-318.
    10. 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.
    11. Manea, Mihai, 2008. "A constructive proof of the ordinal efficiency welfare theorem," Journal of Economic Theory, Elsevier, vol. 141(1), pages 276-281, July.
    12. 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.
    13. Thomson, William, 2015. "Axiomatic and game-theoretic analysis of bankruptcy and taxation problems: An update," Mathematical Social Sciences, Elsevier, vol. 74(C), pages 41-59.
    14. 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.
    15. McLennan, Andrew, 2002. "Ordinal Efficiency and the Polyhedral Separating Hyperplane Theorem," Journal of Economic Theory, Elsevier, vol. 105(2), pages 435-449, August.
    16. Aumann, Robert J. & Maschler, Michael, 1985. "Game theoretic analysis of a bankruptcy problem from the Talmud," Journal of Economic Theory, Elsevier, vol. 36(2), pages 195-213, August.
    17. Carroll, Gabriel, 2010. "An efficiency theorem for incompletely known preferences," Journal of Economic Theory, Elsevier, vol. 145(6), pages 2463-2470, November.
    18. Clayton Featherstone & Muriel Niederle, 2008. "Ex Ante Efficiency in School Choice Mechanisms: An Experimental Investigation," NBER Working Papers 14618, National Bureau of Economic Research, Inc.
    19. Kesten, Onur, 2009. "Why do popular mechanisms lack efficiency in random environments?," Journal of Economic Theory, Elsevier, vol. 144(5), pages 2209-2226, September.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Ping Zhan, 2023. "Simultaneous eating algorithm and greedy algorithm in assignment problems," Journal of Combinatorial Optimization, Springer, vol. 45(5), pages 1-24, July.

    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. 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.
    2. 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.
    3. Balbuzanov, Ivan, 2022. "Constrained random matching," Journal of Economic Theory, Elsevier, vol. 203(C).
    4. Athanassoglou, Stergios, 2011. "Efficiency under a combination of ordinal and cardinal information on preferences," Journal of Mathematical Economics, Elsevier, vol. 47(2), pages 180-185, March.
    5. 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.
    6. Kojima, Fuhito & Manea, Mihai, 2010. "Incentives in the probabilistic serial mechanism," Journal of Economic Theory, Elsevier, vol. 145(1), pages 106-123, January.
    7. Basteck, Christian, 2018. "Fair solutions to the random assignment problem," Journal of Mathematical Economics, Elsevier, vol. 79(C), pages 163-172.
    8. Afacan, Mustafa Oǧuz, 2018. "The object allocation problem with random priorities," Games and Economic Behavior, Elsevier, vol. 110(C), pages 71-89.
    9. Kesten, Onur & Unver, Utku, 2015. "A theory of school choice lotteries," Theoretical Economics, Econometric Society, vol. 10(2), May.
    10. 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.
    11. Aziz, Haris & Brandl, Florian & Brandt, Felix, 2015. "Universal Pareto dominance and welfare for plausible utility functions," Journal of Mathematical Economics, Elsevier, vol. 60(C), pages 123-133.
    12. 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.
    13. 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.
    14. Yajing Chen & Patrick Harless & Zhenhua Jiao, 2021. "The probabilistic rank random assignment rule and its axiomatic characterization," Papers 2104.09165, arXiv.org.
    15. Kojima, Fuhito, 2009. "Random assignment of multiple indivisible objects," Mathematical Social Sciences, Elsevier, vol. 57(1), pages 134-142, January.
    16. Christopher P Chambers & Federico Echenique, 2021. "Empirical Welfare Economics," Papers 2108.03277, arXiv.org, revised Sep 2022.
    17. Ping Zhan, 2023. "Simultaneous eating algorithm and greedy algorithm in assignment problems," Journal of Combinatorial Optimization, Springer, vol. 45(5), pages 1-24, July.
    18. 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.
    19. Basteck, Christian, 2018. "Fair solutions to the random assignment problem," Journal of Mathematical Economics, Elsevier, vol. 79(C), pages 163-172.
    20. Basteck, Christian & Ehlers, Lars, 2023. "Strategy-proof and envy-free random assignment," Journal of Economic Theory, Elsevier, vol. 209(C).

    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:mateco:v:84:y:2019:i:c:p:107-116. 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.

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