IDEAS home Printed from https://ideas.repec.org/p/pra/mprapa/56189.html
   My bibliography  Save this paper

Designing Matching Mechanisms under Constraints: An Approach from Discrete Convex Analysis

Author

Listed:
  • Kojima, Fuhito
  • Tamura, Akihisa
  • Yokoo, Makoto

Abstract

In this paper, we consider two-sided, many-to-one matching problems where agents in one side of the market (hospitals) impose some distributional constraints (e.g., a minimum quota for each hospital). We show that when the preference of the hospitals is represented as an M-natural-concave function, the following desirable properties hold: (i) the time complexity of the generalized GS mechanism is O(|X|^3), where |X| is the number of possible contracts, (ii) the generalized Gale & Shapley (GS) mechanism is strategyproof, (iii) the obtained matching is stable, and (iv) the obtained matching is optimal for the agents in the other side (doctors) within all stable matchings. Furthermore, we clarify sufficient conditions where the preference becomes an M-natural-concave function. These sufficient conditions are general enough so that they can cover most of existing works on strategyproof mechanisms that can handle distributional constraints in many-to-one matching problems. These conditions provide a recipe for non-experts in matching theory or discrete convex analysis to develop desirable mechanisms in such settings.

Suggested Citation

  • Kojima, Fuhito & Tamura, Akihisa & Yokoo, Makoto, 2014. "Designing Matching Mechanisms under Constraints: An Approach from Discrete Convex Analysis," MPRA Paper 56189, University Library of Munich, Germany.
    • Handle: RePEc:pra:mprapa:56189
    as

    Download full text from publisher

    File URL: https://mpra.ub.uni-muenchen.de/56189/1/MPRA_paper_56189.pdf
    File Function: original version
    Download Restriction: no
    File URL: https://mpra.ub.uni-muenchen.de/62226/1/MPRA_paper_62226.pdf
    File Function: revised version
    Download Restriction: no
    File URL: https://mpra.ub.uni-muenchen.de/78637/9/MPRA_paper_78637.pdf
    File Function: revised version
    Download Restriction: no
    File URL: https://mpra.ub.uni-muenchen.de/86614/16/MPRA_paper_86614.pdf
    File Function: revised version
    Download Restriction: no
    ---><---

    References listed on IDEAS

    as
    1. 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.
    2. Satoru Fujishige & Akihisa Tamura, 2007. "A Two-Sided Discrete-Concave Market with Possibly Bounded Side Payments: An Approach by Discrete Convex Analysis," Mathematics of Operations Research, INFORMS, vol. 32(1), pages 136-155, February.
    3. John William Hatfield & Paul R. Milgrom, 2005. "Matching with Contracts," American Economic Review, American Economic Association, vol. 95(4), pages 913-935, September.
    4. Tayfun Sönmez & Tobias B. Switzer, 2013. "Matching With (Branch‐of‐Choice) Contracts at the United States Military Academy," Econometrica, Econometric Society, vol. 81(2), pages 451-488, March.
    5. Alvin E. Roth, 2002. "The Economist as Engineer: Game Theory, Experimentation, and Computation as Tools for Design Economics," Econometrica, Econometric Society, vol. 70(4), pages 1341-1378, July.
    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. 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.
    2. Kazuo Murota, 2018. "Multiple Exchange Property for M ♮ -Concave Functions and Valuated Matroids," Mathematics of Operations Research, INFORMS, vol. 43(3), pages 781-788, August.
    3. Goto, Masahiro & Kojima, Fuhito & Kurata, Ryoji & Tamura, Akihisa & Yokoo, Makoto, 2015. "Designing Matching Mechanisms under General Distributional Constraints," MPRA Paper 64000, University Library of Munich, Germany.
    4. Kazuo Murota, 2016. "Discrete convex analysis: A tool for economics and game theory," The Journal of Mechanism and Institution Design, Society for the Promotion of Mechanism and Institution Design, University of York, vol. 1(1), pages 151-273, December.

    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. 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.
    2. 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.
    3. Avataneo, Michelle & Turhan, Bertan, 2021. "Slot-specific priorities with capacity transfers," Games and Economic Behavior, Elsevier, vol. 129(C), pages 536-548.
    4. Afacan, Mustafa Oǧuz, 2020. "Graduate admission with financial support," Journal of Mathematical Economics, Elsevier, vol. 87(C), pages 114-127.
    5. Yao Cheng & Zaifu Yang, 2023. "Stable Matching Mechanisms under Distributional Constraints," Discussion Papers 23/05, Department of Economics, University of York.
    6. Aygün, Orhan & Turhan, Bertan, 2020. "Dynamic reserves in matching markets," Journal of Economic Theory, Elsevier, vol. 188(C).
    7. Chao Huang, 2022. "Firm-worker hypergraphs," Papers 2211.06887, arXiv.org, revised Nov 2023.
    8. 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.
    9. Tello, Benjamín, 2016. "Matching with contracts, substitutes and two-unit demand," Economics Letters, Elsevier, vol. 146(C), pages 85-88.
    10. Tayfun Sönmez & M. Bumin Yenmez, 2019. "Constitutional Implementation of Vertical and Horizontal Reservations in India: A Unified Mechanism for Civil Service Allocation and College Admissions," Boston College Working Papers in Economics 978, Boston College Department of Economics.
    11. 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.
    12. Kamada, Yuichiro & Kojima, Fuhito, 2018. "Stability and strategy-proofness for matching with constraints: a necessary and sufficient condition," Theoretical Economics, Econometric Society, vol. 13(2), May.
    13. Yenmez, M. Bumin, 2018. "A college admissions clearinghouse," Journal of Economic Theory, Elsevier, vol. 176(C), pages 859-885.
    14. Goto, Masahiro & Kojima, Fuhito & Kurata, Ryoji & Tamura, Akihisa & Yokoo, Makoto, 2015. "Designing Matching Mechanisms under General Distributional Constraints," MPRA Paper 64000, University Library of Munich, Germany.
    15. Abdulkadiroglu, Atila & Andersson, Tommy, 2022. "School Choice," Working Papers 2022:4, Lund University, Department of Economics.
    16. Yao Cheng & Zaifu Yang, "undated". "Stable Matching Mechanisms under Distributional Constraints," Discussion Papers 23/03, Department of Economics, University of York.
    17. Kamada, Yuichiro & Kojima, Fuhito, 2017. "Stability concepts in matching under distributional constraints," Journal of Economic Theory, Elsevier, vol. 168(C), pages 107-142.
    18. Alva, Samson & Manjunath, Vikram, 2019. "Strategy-proof Pareto-improvement," Journal of Economic Theory, Elsevier, vol. 181(C), pages 121-142.
    19. Martin Bichler & Alexander Hammerl & Thayer Morrill & Stefan Waldherr, 2021. "How to Assign Scarce Resources Without Money: Designing Information Systems that are Efficient, Truthful, and (Pretty) Fair," Information Systems Research, INFORMS, vol. 32(2), pages 335-355, June.
    20. Yuichiro Kamada & Fuhito Kojima, 2020. "Accommodating various policy goals in matching with constraints," The Japanese Economic Review, Springer, vol. 71(1), pages 101-133, January.

    More about this item

    Keywords

    two-sided matching; many-to-one matching; strategyproof mechanism; deferred acceptance; distributional constraints; discrete convex analysis;
    All these keywords.

    JEL classification:

    • C71 - Mathematical and Quantitative Methods - - Game Theory and Bargaining Theory - - - Cooperative Games
    • C78 - Mathematical and Quantitative Methods - - Game Theory and Bargaining Theory - - - Bargaining Theory; Matching Theory
    • D61 - Microeconomics - - Welfare Economics - - - Allocative Efficiency; Cost-Benefit Analysis

    NEP fields

    This paper has been announced in the following NEP Reports:

    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:pra:mprapa:56189. 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: Joachim Winter (email available below). General contact details of provider: https://edirc.repec.org/data/vfmunde.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.