IDEAS home Printed from https://ideas.repec.org/a/eee/jetheo/v141y2008i1p276-281.html
   My bibliography  Save this article

A constructive proof of the ordinal efficiency welfare theorem

Author

Listed:
  • Manea, Mihai

Abstract

We provide a non-geometric constructive short proof of the ordinal efficiency welfare theorem.

Suggested Citation

  • Manea, Mihai, 2008. "A constructive proof of the ordinal efficiency welfare theorem," Journal of Economic Theory, Elsevier, vol. 141(1), pages 276-281, July.
    • Handle: RePEc:eee:jetheo:v:141:y:2008:i:1:p:276-281
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0022-0531(07)00127-5
    Download Restriction: Full text for ScienceDirect subscribers only
    ---><---

    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. 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.
    2. Shapley, Lloyd & Scarf, Herbert, 1974. "On cores and indivisibility," Journal of Mathematical Economics, Elsevier, vol. 1(1), pages 23-37, March.
    3. 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.
    4. McLennan, Andrew, 2002. "Ordinal Efficiency and the Polyhedral Separating Hyperplane Theorem," Journal of Economic Theory, Elsevier, vol. 105(2), pages 435-449, August.
    5. ,, 2009. "Asymptotic ordinal inefficiency of random serial dictatorship," Theoretical Economics, Econometric Society, vol. 4(2), June.
    6. Abdulkadiroglu, Atila & Sonmez, Tayfun, 2003. "Ordinal efficiency and dominated sets of assignments," Journal of Economic Theory, Elsevier, vol. 112(1), pages 157-172, 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. 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. Schlegel, J. C. & Mamageishvili, A., 2017. "Welfare theorems for random assignments with priorities," Working Papers 17/05, Department of Economics, City University London.
    3. Christopher P Chambers & Federico Echenique, 2021. "Empirical Welfare Economics," Papers 2108.03277, arXiv.org, revised Jun 2024.
    4. Schlegel, Jan Christoph & Mamageishvili, Akaki, 2020. "Welfare theorems for random assignments with priorities," Games and Economic Behavior, Elsevier, vol. 124(C), pages 62-81.
    5. 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.
    6. Ping Zhan, 2023. "Simultaneous eating algorithm and greedy algorithm in assignment problems," Journal of Combinatorial Optimization, Springer, vol. 45(5), pages 1-24, July.
    7. Tom Demeulemeester & Juan S. Pereyra, 2022. "Rawlsian Assignments," Papers 2207.02930, arXiv.org, revised Oct 2024.
    8. Kojima, Fuhito & Manea, Mihai, 2010. "Incentives in the probabilistic serial mechanism," Journal of Economic Theory, Elsevier, vol. 145(1), pages 106-123, January.
    9. 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.
    10. 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.
    11. Basteck, Christian, 2018. "Fair solutions to the random assignment problem," Journal of Mathematical Economics, Elsevier, vol. 79(C), pages 163-172.
    12. Carroll, Gabriel, 2010. "An efficiency theorem for incompletely known preferences," Journal of Economic Theory, Elsevier, vol. 145(6), pages 2463-2470, November.
    13. repec:cty:dpaper:10.1016/j.geb.2020.08.009 is not listed on IDEAS
    14. repec:cty:dpaper:18702 is not listed on IDEAS
    15. Doğan, Battal & Yıldız, Kemal, 2016. "Efficiency and stability of probabilistic assignments in marriage problems," Games and Economic Behavior, Elsevier, vol. 95(C), pages 47-58.
    16. Federico Echenique & Joseph Root & Fedor Sandomirskiy, 2022. "Efficiency in Random Resource Allocation and Social Choice," Papers 2203.06353, arXiv.org, revised Aug 2022.
    17. Kojima, Fuhito, 2009. "Random assignment of multiple indivisible objects," Mathematical Social Sciences, Elsevier, vol. 57(1), pages 134-142, January.
    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. Harless, Patrick, 2019. "Efficient rules for probabilistic assignment," Journal of Mathematical Economics, Elsevier, vol. 84(C), pages 107-116.

    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. Kesten, Onur, 2009. "Why do popular mechanisms lack efficiency in random environments?," Journal of Economic Theory, Elsevier, vol. 144(5), pages 2209-2226, September.
    2. 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.
    3. Kojima, Fuhito & Manea, Mihai, 2010. "Incentives in the probabilistic serial mechanism," Journal of Economic Theory, Elsevier, vol. 145(1), pages 106-123, January.
    4. 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.
    5. 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.
    6. YIlmaz, Özgür, 2010. "The probabilistic serial mechanism with private endowments," Games and Economic Behavior, Elsevier, vol. 69(2), pages 475-491, July.
    7. 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.
    8. 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.
    9. 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.
    10. Atila Abdulkadiroglu & Tayfun Sönmez, 2003. "School Choice: A Mechanism Design Approach," American Economic Review, American Economic Association, vol. 93(3), pages 729-747, June.
    11. Harless, Patrick, 2019. "Efficient rules for probabilistic assignment," Journal of Mathematical Economics, Elsevier, vol. 84(C), pages 107-116.
    12. Kojima, Fuhito, 2009. "Random assignment of multiple indivisible objects," Mathematical Social Sciences, Elsevier, vol. 57(1), pages 134-142, January.
    13. 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.
    14. Liu, Peng, 2020. "Random assignments on sequentially dichotomous domains," Games and Economic Behavior, Elsevier, vol. 121(C), pages 565-584.
    15. Carroll, Gabriel, 2010. "An efficiency theorem for incompletely known preferences," Journal of Economic Theory, Elsevier, vol. 145(6), pages 2463-2470, November.
    16. Kesten, Onur & Unver, Utku, 2015. "A theory of school choice lotteries," Theoretical Economics, Econometric Society, vol. 10(2), May.
    17. 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.
    18. Chambers, Christopher P., 2004. "Consistency in the probabilistic assignment model," Journal of Mathematical Economics, Elsevier, vol. 40(8), pages 953-962, December.
    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. 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.

    More about this item

    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:jetheo:v:141:y:2008:i:1:p:276-281. 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/622869 .

    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.