IDEAS home Printed from https://ideas.repec.org/a/eee/gamebe/v105y2017icp1-8.html
   My bibliography  Save this article

Guaranteed size ratio of ordinally efficient and envy-free mechanisms in the assignment problem

Author

Listed:
  • Huang, Chao
  • Tian, Guoqiang

Abstract

In the assignment problem where agents can stay unassigned, the size of the assignment is an important consideration for designers. Bogomolnaia and Moulin (2015) show that there is a tension between size and fairness: the guaranteed size ratio of any envy-free mechanism is at most rm, which converges decreasingly to 1−1e≈63.2% as the maximum size increases. They then ask whether rm is also the guaranteed size ratio for any ordinally efficient and envy-free mechanism. We study this issue and show that the lower bound of the guaranteed size ratio of ordinally efficient and envy-free mechanisms converges to 12 as the maximum size increases, which means that almost half of the maximum size is wasted at the lower bound. Moreover, the exact lower bound is m+12m when the maximum size m is odd.

Suggested Citation

  • Huang, Chao & Tian, Guoqiang, 2017. "Guaranteed size ratio of ordinally efficient and envy-free mechanisms in the assignment problem," Games and Economic Behavior, Elsevier, vol. 105(C), pages 1-8.
    • Handle: RePEc:eee:gamebe:v:105:y:2017:i:c:p:1-8
    DOI: 10.1016/j.geb.2017.07.001
    as

    Download full text from publisher

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

    References listed on IDEAS

    as
    1. 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.
    2. Bogomolnaia, Anna, 2015. "Random assignment: Redefining the serial rule," Journal of Economic Theory, Elsevier, vol. 158(PA), pages 308-318.
    3. 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.
    4. Erdil, Aytek, 2014. "Strategy-proof stochastic assignment," Journal of Economic Theory, Elsevier, vol. 151(C), pages 146-162.
    5. Bogomolnaia, Anna & Moulin, Herve, 2015. "Size versus fairness in the assignment problem," Games and Economic Behavior, Elsevier, vol. 90(C), pages 119-127.
    6. Hervé Crès & Hervé Moulin, 2001. "Scheduling with Opting Out: Improving upon Random Priority," Operations Research, INFORMS, vol. 49(4), pages 565-577, August.
    7. 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.
    8. 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.
    9. Eric Budish & Yeon-Koo Che & Fuhito Kojima & Paul Milgrom, 2013. "Designing Random Allocation Mechanisms: Theory and Applications," American Economic Review, American Economic Association, vol. 103(2), pages 585-623, April.
    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. Zhang, Jun, 2023. "Strategy-proof allocation with outside option," Games and Economic Behavior, Elsevier, vol. 137(C), pages 50-67.

    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. Bogomolnaia, Anna & Moulin, Herve, 2015. "Size versus fairness in the assignment problem," Games and Economic Behavior, Elsevier, vol. 90(C), pages 119-127.
    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. Basteck, Christian & Ehlers, Lars, 2023. "Strategy-proof and envy-free random assignment," Journal of Economic Theory, Elsevier, vol. 209(C).
    4. 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.
    5. Yajing Chen & Patrick Harless & Zhenhua Jiao, 2021. "The probabilistic rank random assignment rule and its axiomatic characterization," Papers 2104.09165, arXiv.org.
    6. Balbuzanov, Ivan, 2022. "Constrained random matching," Journal of Economic Theory, Elsevier, vol. 203(C).
    7. 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.
    8. Ping Zhan, 2023. "A Simple Characterization of Assignment Mechanisms on Set Constraints," SN Operations Research Forum, Springer, vol. 4(2), pages 1-15, June.
    9. 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.
    10. Shende, Priyanka & Purohit, Manish, 2023. "Strategy-proof and envy-free mechanisms for house allocation," Journal of Economic Theory, Elsevier, vol. 213(C).
    11. 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.
    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. Noda, Shunya, 2020. "Size versus truncation robustness in the assignment problem," Journal of Mathematical Economics, Elsevier, vol. 87(C), pages 1-5.
    14. 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.
    15. Basteck, Christian & Ehlers, Lars, 2024. "On (constrained) Efficiency of strategy-proof random assignment," VfS Annual Conference 2024 (Berlin): Upcoming Labor Market Challenges 302429, Verein für Socialpolitik / German Economic Association.
    16. Cho, Wonki Jo & Doğan, Battal, 2016. "Equivalence of efficiency notions for ordinal assignment problems," Economics Letters, Elsevier, vol. 146(C), pages 8-12.
    17. 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.
    18. Yoshio Sano & Ping Zhan, 2021. "Extended Random Assignment Mechanisms on a Family of Good Sets," SN Operations Research Forum, Springer, vol. 2(4), pages 1-30, December.
    19. Alexander Nesterov, "undated". "Fairness and Efficiency in a Random Assignment: Three Impossibility Results," BDPEMS Working Papers 2014006, Berlin School of Economics.
    20. Mennle, Timo & Seuken, Sven, 2021. "Partial strategyproofness: Relaxing strategyproofness for the random assignment problem," Journal of Economic Theory, Elsevier, vol. 191(C).

    More about this item

    Keywords

    Size of assignment; Ordinal efficiency; Envy-freeness;
    All these keywords.

    JEL classification:

    • D63 - Microeconomics - - Welfare Economics - - - Equity, Justice, Inequality, and Other Normative Criteria and Measurement
    • D70 - Microeconomics - - Analysis of Collective Decision-Making - - - General

    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:105:y:2017:i:c:p:1-8. 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.