IDEAS home Printed from https://ideas.repec.org/p/isu/genstf/202311271609320000.html
   My bibliography  Save this paper

Gradual Matching with Affirmative Action

Author

Listed:
  • Manocha, Kriti
  • Turhan, Bertan

Abstract

Admissions to technical colleges in India feature a multi-period matching process and are subject to a complex affirmative action policy. At each period, an assignment is produced, and applicants decide whether to finalize their assignments or participate in the next period with the possibility of updating their submitted rank-ordered lists (ROLs). Building on Haeringer and Iehl´e (2021), we formulate a multi-period college admissions problem where institutions’ choice rules incorporate affirmative action restrictions and are updated consistently. We show that it is safe for applicants to participate in additional periods when their updating rule on ROLs satisfies a mild regularity condition. We also introduce a backward-looking notion of stability for multi-period matching mechanisms that consider affirmative action constraints. We use our results to analyze the multi-stage mechanism currently used in admissions to engineering colleges in India.

Suggested Citation

  • Manocha, Kriti & Turhan, Bertan, "undated". "Gradual Matching with Affirmative Action," ISU General Staff Papers 202311271609320000, Iowa State University, Department of Economics.
    • Handle: RePEc:isu:genstf:202311271609320000
    as

    Download full text from publisher

    File URL: https://dr.lib.iastate.edu/bitstreams/9aece250-47a9-420f-a630-0403e010af59/download
    Download Restriction: no
    ---><---

    References listed on IDEAS

    as
    1. Fuhito Kojima & Mihai Manea, 2010. "Axioms for Deferred Acceptance," Econometrica, Econometric Society, vol. 78(2), pages 633-653, March.
    2. Pereyra, Juan Sebastián, 2013. "A dynamic school choice model," Games and Economic Behavior, Elsevier, vol. 80(C), pages 100-114.
    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. Basteck, Christian & Klaus, Bettina & Kübler, Dorothea, 2021. "How lotteries in school choice help to level the playing field," Games and Economic Behavior, Elsevier, vol. 129(C), pages 198-237.
    2. Can, Burak & Pourpouneh, Mohsen & Storcken, Ton, 2017. "Cost of transformation: a measure on matchings," Research Memorandum 015, Maastricht University, Graduate School of Business and Economics (GSBE).
    3. Yajing Chen & Zhenhua Jiao & Chenfeng Zhang & Luosai Zhang, 2021. "The Machiavellian frontier of top trading cycles," Papers 2106.14456, arXiv.org, revised Apr 2024.
    4. Afacan, Mustafa Og̃uz & Dur, Umut Mert, 2017. "When preference misreporting is Harm[less]ful?," Journal of Mathematical Economics, Elsevier, vol. 72(C), pages 16-24.
    5. Kirill Rudov, 2024. "Fragile Stable Matchings," Papers 2403.12183, arXiv.org.
    6. Yajing Chen, 2016. "New axioms for immediate acceptance," Review of Economic Design, Springer;Society for Economic Design, vol. 20(4), pages 329-337, December.
    7. Ehlers, Lars & Klaus, Bettina, 2016. "Object allocation via deferred-acceptance: Strategy-proofness and comparative statics," Games and Economic Behavior, Elsevier, vol. 97(C), pages 128-146.
    8. Kumano, Taro, 2013. "Strategy-proofness and stability of the Boston mechanism: An almost impossibility result," Journal of Public Economics, Elsevier, vol. 105(C), pages 23-29.
    9. Doğan, Battal & Klaus, Bettina, 2018. "Object allocation via immediate-acceptance: Characterizations and an affirmative action application," Journal of Mathematical Economics, Elsevier, vol. 79(C), pages 140-156.
    10. Kojima, Fuhito, 2013. "Efficient resource allocation under multi-unit demand," Games and Economic Behavior, Elsevier, vol. 82(C), pages 1-14.
    11. van den Brink, René & Núñez, Marina & Robles, Francisco, 2021. "Valuation monotonicity, fairness and stability in assignment problems," Journal of Economic Theory, Elsevier, vol. 195(C).
    12. Lars Ehlers & Bettina Klaus, 2012. "Strategy-Proofness Makes the Difference : Deferred-Acceptance with Responsive Priorities," Cahiers de recherche 15-2012, Centre interuniversitaire de recherche en économie quantitative, CIREQ.
    13. Benoit Decerf, 2023. "A modification aimed at reducing the manipulability and inefficiency of the Boston school choice mechanism," Social Choice and Welfare, Springer;The Society for Social Choice and Welfare, vol. 60(1), pages 75-101, January.
    14. Morimitsu Kurino, 2014. "House Allocation with Overlapping Generations," American Economic Journal: Microeconomics, American Economic Association, vol. 6(1), pages 258-289, February.
    15. Carlsson, Sissa & Thomsen, Stephan L., 2015. "Improving the Allocation of Spots in Child Care Facilities for Toddlers in Germany: A Mechanism Design Approach," IZA Discussion Papers 8976, Institute of Labor Economics (IZA).
    16. Dur, Umut & Paiement, Scott, 2024. "A characterization of the top trading cycles mechanism for the school choice problem," Mathematical Social Sciences, Elsevier, vol. 129(C), pages 93-100.
    17. Afacan, Mustafa Oǧuz, 2024. "Non-vetoed matching with status quo," Journal of Mathematical Economics, Elsevier, vol. 111(C).
    18. Karakaya, Mehmet & Klaus, Bettina & Schlegel, Jan Christoph, 2019. "Top trading cycles, consistency, and acyclic priorities for house allocation with existing tenants," Journal of Economic Theory, Elsevier, vol. 184(C).
    19. Hafalir, Isa E. & Kojima, Fuhito & Yenmez, M. Bumin, 2022. "Interdistrict school choice: A theory of student assignment," Journal of Economic Theory, Elsevier, vol. 201(C).
    20. Battal Doğan & Serhat Doğan & Kemal Yıldız, 2021. "Lexicographic choice under variable capacity constraints," Journal of Public Economic Theory, Association for Public Economic Theory, vol. 23(1), pages 172-196, February.

    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:isu:genstf:202311271609320000. 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: Curtis Balmer (email available below). General contact details of provider: https://edirc.repec.org/data/deiasus.html .

    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.