IDEAS home Printed from https://ideas.repec.org/a/eee/oprepe/v5y2018icp59-68.html
   My bibliography  Save this article

Stable project allocation under distributional constraints

Author

Listed:
  • Ágoston, Kolos Csaba
  • Biró, Péter
  • Szántó, Richárd

Abstract

In a two-sided matching market when agents on both sides have preferences the stability of the solution is typically the most important requirement. However, we may also face some distributional constraints with regard to the minimum number of assignees or the distribution of the assignees according to their types. These two requirements can be challenging to reconcile in practice. In this paper we describe two real applications, a project allocation problem and a workshop assignment problem, both involving some distributional constraints. We used integer programming techniques to find reasonably good solutions with regard to the stability and the distributional constraints. Our approach can be useful in a variety of different applications, such as resident allocation with lower quotas, controlled school choice or college admissions with affirmative action.

Suggested Citation

  • Ágoston, Kolos Csaba & Biró, Péter & Szántó, Richárd, 2018. "Stable project allocation under distributional constraints," Operations Research Perspectives, Elsevier, vol. 5(C), pages 59-68.
    • Handle: RePEc:eee:oprepe:v:5:y:2018:i:c:p:59-68
    DOI: 10.1016/j.orp.2018.01.003
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S2214716018300022
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.orp.2018.01.003?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. Atila Abdulkadiroğlu & Parag A. Pathak & Alvin E. Roth, 2005. "The New York City High School Match," American Economic Review, American Economic Association, vol. 95(2), pages 364-367, May.
    2. Augustine Kwanashie & David F. Manlove, 2014. "An Integer Programming Approach to the Hospitals/Residents Problem with Ties," Operations Research Proceedings, in: Dennis Huisman & Ilse Louwerse & Albert P.M. Wagelmans (ed.), Operations Research Proceedings 2013, edition 127, pages 263-269, Springer.
    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. Federico Echenique & M. Bumin Yenmez, 2015. "How to Control Controlled School Choice," American Economic Review, American Economic Association, vol. 105(8), pages 2679-2694, August.
    5. Roth, Alvin E, 1986. "On the Allocation of Residents to Rural Hospitals: A General Property of Two-Sided Matching Markets," Econometrica, Econometric Society, vol. 54(2), pages 425-427, March.
    6. Kolos Csaba Agoston & Peter Biro & Iain McBride, 2016. "Integer programming methods for special college admissions problems," CERS-IE WORKING PAPERS 1632, Institute of Economics, Centre for Economic and Regional Studies.
    7. Robert W. Irving & David F. Manlove, 2008. "Approximation algorithms for hard variants of the stable marriage and hospitals/residents problems," Journal of Combinatorial Optimization, Springer, vol. 16(3), pages 279-292, October.
    8. Atila Abdulkadiroğlu & Parag A. Pathak & Alvin E. Roth & Tayfun Sönmez, 2005. "The Boston Public School Match," American Economic Review, American Economic Association, vol. 95(2), pages 368-371, May.
    9. Kamada, Yuichiro & Kojima, Fuhito, 2017. "Stability concepts in matching under distributional constraints," Journal of Economic Theory, Elsevier, vol. 168(C), pages 107-142.
    10. Blum, Yosef & Roth, Alvin E. & Rothblum, Uriel G., 1997. "Vacancy Chains and Equilibration in Senior-Level Labor Markets," Journal of Economic Theory, Elsevier, vol. 76(2), pages 362-411, October.
    11. Fırat, M. & Briskorn, D. & Laugier, A., 2016. "A Branch-and-Price algorithm for stable workforce assignments with hierarchical skills," European Journal of Operational Research, Elsevier, vol. 251(2), pages 676-685.
    12. Tamás Fleiner & Naoyuki Kamiyama, 2016. "A Matroid Approach to Stable Matchings with Lower Quotas," Mathematics of Operations Research, INFORMS, vol. 41(2), pages 734-744, May.
    13. Pentico, David W., 2007. "Assignment problems: A golden anniversary survey," European Journal of Operational Research, Elsevier, vol. 176(2), pages 774-793, January.
    14. Kojima, Fuhito, 2012. "School choice: Impossibilities for affirmative action," Games and Economic Behavior, Elsevier, vol. 75(2), pages 685-693.
    15. Roth, Alvin E, 1984. "The Evolution of the Labor Market for Medical Interns and Residents: A Case Study in Game Theory," Journal of Political Economy, University of Chicago Press, vol. 92(6), pages 991-1016, December.
    16. Bó, Inácio, 2016. "Fair implementation of diversity in school choice," Games and Economic Behavior, Elsevier, vol. 97(C), pages 54-63.
    17. Cao, Nguyen Vi & Fragnière, Emmanuel & Gauthier, Jacques-Antoine & Sapin, Marlène & Widmer, Eric D., 2010. "Optimizing the marriage market: An application of the linear assignment model," European Journal of Operational Research, Elsevier, vol. 202(2), pages 547-553, April.
    18. Diebold, Franz & Bichler, Martin, 2017. "Matching with indifferences: A comparison of algorithms in the context of course allocation," European Journal of Operational Research, Elsevier, vol. 260(1), pages 268-282.
    19. Elliott Peranson & Alvin E. Roth, 1999. "The Redesign of the Matching Market for American Physicians: Some Engineering Aspects of Economic Design," American Economic Review, American Economic Association, vol. 89(4), pages 748-780, September.
    20. 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.
    21. Yuichiro Kamada & Fuhito Kojima, 2017. "Recent Developments in Matching with Constraints," American Economic Review, American Economic Association, vol. 107(5), pages 200-204, May.
    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. Reischmann, Tobias & Klein, Thilo & Giegerich, Sven, 2021. "An iterative deferred acceptance mechanism for decentralized, fast and fair childcare assignment," ZEW Discussion Papers 21-095, ZEW - Leibniz Centre for European Economic Research.
    2. Péter Biró & Flip Klijn & Xenia Klimentova & Ana Viana, 2021. "Shapley-Scarf Housing Markets: Respecting Improvement, Integer Programming, and Kidney Exchange," Working Papers 1235, Barcelona School of Economics.
    3. Tobias Reischmann & Thilo Klein & Sven Giegerich, 2021. "A deferred acceptance mechanism for decentralized, fast, and fair childcare assignment," The Journal of Mechanism and Institution Design, Society for the Promotion of Mechanism and Institution Design, University of York, vol. 6(1), pages 59-100, December.
    4. P'eter Bir'o & M'arton Gyetvai, 2021. "Online voluntary mentoring: Optimising the assignment of students and mentors," Papers 2102.06671, arXiv.org.

    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. Ágoston, Kolos Csaba & Biró, Péter & Kováts, Endre & Jankó, Zsuzsanna, 2022. "College admissions with ties and common quotas: Integer programming approach," European Journal of Operational Research, Elsevier, vol. 299(2), pages 722-734.
    2. Biró, Péter & Gudmundsson, Jens, 2021. "Complexity of finding Pareto-efficient allocations of highest welfare," European Journal of Operational Research, Elsevier, vol. 291(2), pages 614-628.
    3. 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.
    4. Kojima, Fuhito & Tamura, Akihisa & Yokoo, Makoto, 2018. "Designing matching mechanisms under constraints: An approach from discrete convex analysis," Journal of Economic Theory, Elsevier, vol. 176(C), pages 803-833.
    5. 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.
    6. Tomoeda, Kentaro, 2018. "Finding a stable matching under type-specific minimum quotas," Journal of Economic Theory, Elsevier, vol. 176(C), pages 81-117.
    7. Haris Aziz & Bettina Klaus, 2017. "Random Matching under Priorities: Stability and No Envy Concepts," Cahiers de Recherches Economiques du Département d'Econométrie et d'Economie politique (DEEP) 17.09, Université de Lausanne, Faculté des HEC, DEEP.
    8. Echenique, Federico & Miralles, Antonio & Zhang, Jun, 2021. "Fairness and efficiency for allocations with participation constraints," Journal of Economic Theory, Elsevier, vol. 195(C).
    9. Yun Liu, 2017. "On the welfare effects of affirmative actions in school choice," Review of Economic Design, Springer;Society for Economic Design, vol. 21(2), pages 121-151, June.
    10. Dur, Umut & Pathak, Parag A. & Sönmez, Tayfun, 2020. "Explicit vs. statistical targeting in affirmative action: Theory and evidence from Chicago's exam schools," Journal of Economic Theory, Elsevier, vol. 187(C).
    11. 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.
    12. Kóczy Á., László, 2009. "Központi felvételi rendszerek. Taktikázás és stabilitás [Central admission systems. Stratagems and stability]," Közgazdasági Szemle (Economic Review - monthly of the Hungarian Academy of Sciences), Közgazdasági Szemle Alapítvány (Economic Review Foundation), vol. 0(5), pages 422-442.
    13. Bloch, Francis & Cantala, David & Gibaja, Damián, 2020. "Matching through institutions," Games and Economic Behavior, Elsevier, vol. 121(C), pages 204-231.
    14. Hatfield, John William & Kojima, Fuhito, 2010. "Substitutes and stability for matching with contracts," Journal of Economic Theory, Elsevier, vol. 145(5), pages 1704-1723, September.
    15. Alvin E. Roth, 2010. "Marketplace Institutions Related to the Timing of Transactions," NBER Working Papers 16556, National Bureau of Economic Research, Inc.
    16. Haeringer, Guillaume & Klijn, Flip, 2009. "Constrained school choice," Journal of Economic Theory, Elsevier, vol. 144(5), pages 1921-1947, September.
    17. Alvin Roth, 2008. "Deferred acceptance algorithms: history, theory, practice, and open questions," International Journal of Game Theory, Springer;Game Theory Society, vol. 36(3), pages 537-569, March.
    18. Aygün, Orhan & Turhan, Bertan, 2020. "Dynamic reserves in matching markets," Journal of Economic Theory, Elsevier, vol. 188(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. Kawagoe, Toshiji & Matsubae, Taisuke & Takizawa, Hirokazu, 2018. "The Skipping-down strategy and stability in school choice problems with affirmative action: Theory and experiment," Games and Economic Behavior, Elsevier, vol. 109(C), pages 212-239.

    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:oprepe:v:5:y:2018:i:c:p:59-68. 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.journals.elsevier.com/operations-research-perspectives .

    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.