IDEAS home Printed from https://ideas.repec.org/p/has/discpr/1733.html

Stable project allocation under distributional constraints

Author

Listed:
  • Kolos Csaba Agoston

    (Department of Operations Research and Actuarial Sciences, Corvinus University of Budapest and Department of Operations Research and Actuarial Sciences, Corvinus University)

  • Peter Biro

    (Institute of Economics, Centre for Economic and Regional Studies, Hungarian Academy of Sciences)

  • Richard Szanto

    (Department of Decision Sciences, Corvinus University of Budapest)

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 kind of 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 addirmative action.

Suggested Citation

  • Kolos Csaba Agoston & Peter Biro & Richard Szanto, 2017. "Stable project allocation under distributional constraints," CERS-IE WORKING PAPERS 1733, Institute of Economics, Centre for Economic and Regional Studies.
    • Handle: RePEc:has:discpr:1733
    as

    Download full text from publisher

    File URL: http://econ.core.hu/file/download/mtdp/MTDP1733.pdf
    Download Restriction: no
    ---><---

    Other versions of this item:

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. is not listed on IDEAS
    2. P'eter Bir'o & M'arton Gyetvai, 2021. "Online voluntary mentoring: Optimising the assignment of students and mentors," Papers 2102.06671, arXiv.org.
    3. Ana Viana & Xenia Klimentova & Péter Biró & Flip Klijn, 2021. "Shapley-Scarf Housing Markets: Respecting Improvement, Integer Programming, and Kidney Exchange," Working Papers 1235, Barcelona School of Economics.
    4. 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.
    5. 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.

    More about this item

    Keywords

    ;
    ;
    ;
    ;
    ;

    JEL classification:

    • C61 - Mathematical and Quantitative Methods - - Mathematical Methods; Programming Models; Mathematical and Simulation Modeling - - - Optimization Techniques; Programming Models; Dynamic Analysis
    • C63 - Mathematical and Quantitative Methods - - Mathematical Methods; Programming Models; Mathematical and Simulation Modeling - - - Computational Techniques
    • C78 - Mathematical and Quantitative Methods - - Game Theory and Bargaining Theory - - - Bargaining Theory; Matching Theory

    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:has:discpr:1733. 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.

    We have no bibliographic references for this item. You can help adding them by using 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: Nora Horvath The email address of this maintainer does not seem to be valid anymore. Please ask Nora Horvath to update the entry or send us the correct address (email available below). General contact details of provider: https://edirc.repec.org/data/iehashu.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.