IDEAS home Printed from https://ideas.repec.org/a/eee/matsoc/v88y2017icp3-10.html
   My bibliography  Save this article

Pareto optimal matchings with lower quotas

Author

Listed:
  • Cechlárová, Katarína
  • Fleiner, Tamás

Abstract

We consider the problem of allocating applicants to courses, where each applicant has a capacity, possibly greater than 1, and a subset of acceptable courses that she ranks in a strict order of preference. Each course has a lower and an upper quota, indicating that if it is assigned some applicants then their number has to be between these two bounds. We further suppose that applicants extend their preferences over courses to preferences over bundles of courses lexicographically.

Suggested Citation

  • Cechlárová, Katarína & Fleiner, Tamás, 2017. "Pareto optimal matchings with lower quotas," Mathematical Social Sciences, Elsevier, vol. 88(C), pages 3-10.
    • Handle: RePEc:eee:matsoc:v:88:y:2017:i:c:p:3-10
    DOI: 10.1016/j.mathsocsci.2017.03.007
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0165489617300641
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.mathsocsci.2017.03.007?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. Stergios Athanassoglou & Jay Sethuraman, 2011. "House allocation with fractional endowments," International Journal of Game Theory, Springer;Game Theory Society, vol. 40(3), pages 481-513, August.
    2. Peter C. Fishburn, 1975. "Axioms for Lexicographic Preferences," The Review of Economic Studies, Review of Economic Studies Ltd, vol. 42(3), pages 415-419.
    3. Ehlers, Lars & Hafalir, Isa E. & Yenmez, M. Bumin & Yildirim, Muhammed A., 2014. "School choice with controlled choice constraints: Hard bounds versus soft bounds," Journal of Economic Theory, Elsevier, vol. 153(C), pages 648-683.
    4. Atila Abdulkadiroglu & Tayfun Sonmez, 1998. "Random Serial Dictatorship and the Core from Random Endowments in House Allocation Problems," Econometrica, Econometric Society, vol. 66(3), pages 689-702, May.
    5. , Emin & , Bumin & , Ali, 2013. "Effective affirmative action in school choice," Theoretical Economics, Econometric Society, vol. 8(2), May.
    6. Monte, Daniel & Tumennasan, Norovsambuu, 2013. "Matching with quorums," Economics Letters, Elsevier, vol. 120(1), pages 14-17.
    7. Steven J. Brams & Daniel L. King, 2005. "Efficient Fair Division," Rationality and Society, , vol. 17(4), pages 387-421, November.
    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. Madhav Raghavan, 2017. "Serial Priority in Project Allocation: A Characterisation," Cahiers de Recherches Economiques du Département d'économie 17.17, Université de Lausanne, Faculté des HEC, Département d’économie.
    2. Andreas Darmann & Janosch Döcker & Britta Dorn & Sebastian Schneckenburger, 2022. "Simplified group activity selection with group size constraints," International Journal of Game Theory, Springer;Game Theory Society, vol. 51(1), pages 169-212, March.

    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. Goto, Masahiro & Iwasaki, Atsushi & Kawasaki, Yujiro & Yasuda, Yosuke & Yokoo, Makoto, 2014. "Improving Fairness and Efficiency in Matching with Distributional Constraints: An Alternative Solution for the Japanese Medical Residency Match," MPRA Paper 53409, University Library of Munich, Germany.
    2. Katarina Cechlarova & Bettina Klaus & David F.Manlove, 2018. "Pareto optimal matchings of students to courses in the presence of prerequisites," Cahiers de Recherches Economiques du Département d'économie 16.04, Université de Lausanne, Faculté des HEC, Département d’économie.
    3. 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.
    4. Marek Bojko, 2020. "The Probabilistic Serial and Random Priority Mechanisms with Minimum Quotas," Papers 2012.11028, arXiv.org.
    5. Masahiro Goto & Fuhito Kojima & Ryoji Kurata & Akihisa Tamura & Makoto Yokoo, 2017. "Designing Matching Mechanisms under General Distributional Constraints," American Economic Journal: Microeconomics, American Economic Association, vol. 9(2), pages 226-262, May.
    6. Jingsheng Yu & Jun Zhang, 2020. "Efficient and fair trading algorithms in market design environments," Papers 2005.06878, arXiv.org, revised May 2021.
    7. Echenique, Federico & Miralles, Antonio & Zhang, Jun, 2021. "Fairness and efficiency for allocations with participation constraints," Journal of Economic Theory, Elsevier, vol. 195(C).
    8. Balbuzanov, Ivan, 2022. "Constrained random matching," Journal of Economic Theory, Elsevier, vol. 203(C).
    9. Federico Echenique & Antonio Miralles & Jun Zhang, 2018. "Fairness and Efficiency for Probabilistic Allocations with Endowments," Working Papers 1055, Barcelona School of Economics.
    10. Scott Duke Kominers & Alexander Teytelboym & Vincent P Crawford, 2017. "An invitation to market design," Oxford Review of Economic Policy, Oxford University Press and Oxford Review of Economic Policy Limited, vol. 33(4), pages 541-571.
    11. Aygün, Orhan & Turhan, Bertan, 2021. "How to De-reserve Reserves," ISU General Staff Papers 202103100800001123, Iowa State University, Department of Economics.
    12. Parag A. Pathak & Alex Rees-Jones & Tayfun Sönmez, 2020. "Immigration Lottery Design: Engineered and Coincidental Consequences of H-1B Reforms," NBER Working Papers 26767, National Bureau of Economic Research, Inc.
    13. Hirata, Daisuke & 平田, 大祐 & Kasuya, Yusuke & 糟谷, 祐介 & Okumura, Yasunori & 奥村, 保規, 2023. "Stability, Strategy-Proofness, and Respect for Improvements," Discussion Papers 2023-01, Graduate School of Economics, Hitotsubashi University.
    14. Ivan Balbuzanov & Maciej H. Kotowski, 2019. "Endowments, Exclusion, and Exchange," Econometrica, Econometric Society, vol. 87(5), pages 1663-1692, September.
    15. Jiao, Zhenhua & Tian, Guoqiang, 2018. "Two further impossibility results on responsive affirmative action in school choice," Economics Letters, Elsevier, vol. 166(C), pages 60-62.
    16. Bloch, Francis & Cantala, David & Gibaja, Damián, 2020. "Matching through institutions," Games and Economic Behavior, Elsevier, vol. 121(C), pages 204-231.
    17. 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.
    18. Avataneo, Michelle & Turhan, Bertan, 2021. "Slot-specific priorities with capacity transfers," Games and Economic Behavior, Elsevier, vol. 129(C), pages 536-548.
    19. Isa E. Hafalir & Fuhito Kojima & M. Bumin Yenmez, 2022. "Efficient Market Design with Distributional Objectives," Papers 2301.00232, arXiv.org, revised Mar 2023.
    20. Doğan, Battal, 2016. "Responsive affirmative action in school choice," Journal of Economic Theory, Elsevier, vol. 165(C), pages 69-105.

    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:matsoc:v:88:y:2017:i:c:p:3-10. 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/505565 .

    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.