IDEAS home Printed from https://ideas.repec.org/p/arx/papers/2309.04181.html
   My bibliography  Save this paper

Concave many-to-one matching

Author

Listed:
  • Chao Huang

Abstract

We propose a notion of concavity in two-sided many-to-one matching, which is an analogue to the balancedness condition in cooperative games. A stable matching exists when the market is concave. We provide a class of concave markets. In the proof of the existence theorem, we use Scarf's algorithm to find a stable schedule matching, which is of independent interest.

Suggested Citation

  • Chao Huang, 2023. "Concave many-to-one matching," Papers 2309.04181, arXiv.org.
    • Handle: RePEc:arx:papers:2309.04181
    as

    Download full text from publisher

    File URL: http://arxiv.org/pdf/2309.04181
    File Function: Latest version
    Download Restriction: no
    ---><---

    References listed on IDEAS

    as
    1. Kesten, Onur & Unver, Utku, 2015. "A theory of school choice lotteries," Theoretical Economics, Econometric Society, vol. 10(2), May.
    2. 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.
    3. Thành Nguyen & Rakesh Vohra, 2018. "Near-Feasible Stable Matchings with Couples," American Economic Review, American Economic Association, vol. 108(11), pages 3154-3169, November.
    4. Ma, Jinpeng, 1998. "Competitive Equilibrium with Indivisibilities," Journal of Economic Theory, Elsevier, vol. 82(2), pages 458-468, October.
    5. Kominers, Scott Duke, 2012. "On the correspondence of contracts to salaries in (many-to-many) matching," Games and Economic Behavior, Elsevier, vol. 75(2), pages 984-989.
    6. Thành Nguyen & Rakesh Vohra, 2019. "Stable Matching with Proportionality Constraints," Operations Research, INFORMS, vol. 67(6), pages 1503-1519, November.
    7. Yeon‐Koo Che & Jinwoo Kim & Fuhito Kojima, 2019. "Stable Matching in Large Economies," Econometrica, Econometric Society, vol. 87(1), pages 65-110, January.
    8. Marzena Rostek & Nathan Yoder, 2020. "Matching With Complementary Contracts," Econometrica, Econometric Society, vol. 88(5), pages 1793-1827, September.
    9. Echenique, Federico & Yenmez, M. Bumin, 2007. "A solution to matching with preferences over colleagues," Games and Economic Behavior, Elsevier, vol. 59(1), pages 46-71, April.
    10. John William Hatfield & Paul R. Milgrom, 2005. "Matching with Contracts," American Economic Review, American Economic Association, vol. 95(4), pages 913-935, September.
    11. Kelso, Alexander S, Jr & Crawford, Vincent P, 1982. "Job Matching, Coalition Formation, and Gross Substitutes," Econometrica, Econometric Society, vol. 50(6), pages 1483-1504, November.
    12. Echenique, Federico & Oviedo, Jorge, 2004. "Core many-to-one matchings by fixed-point methods," Journal of Economic Theory, Elsevier, vol. 115(2), pages 358-376, April.
    13. Mourad Baïou & Michel Balinski, 2002. "The Stable Allocation (or Ordinal Transportation) Problem," Mathematics of Operations Research, INFORMS, vol. 27(3), pages 485-503, August.
    14. Huang, Chao, 2023. "Stable matching: an integer programming approach," Theoretical Economics, Econometric Society, vol. 18(1), January.
    15. Mourad Baïou & Michel Balinski, 2002. "Erratum: The Stable Allocation (or Ordinal Transportation) Problem," Mathematics of Operations Research, INFORMS, vol. 27(4), pages 662-680, November.
    16. Kominers, Scott Duke, 2010. "Matching with preferences over colleagues solves classical matching," Games and Economic Behavior, Elsevier, vol. 68(2), pages 773-780, March.
    17. Lloyd S. Shapley, 1967. "On balanced sets and cores," Naval Research Logistics Quarterly, John Wiley & Sons, vol. 14(4), pages 453-460.
    18. 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.
    19. Tamás Fleiner, 2003. "A Fixed-Point Approach to Stable Matchings and Some Applications," Mathematics of Operations Research, INFORMS, vol. 28(1), pages 103-126, February.
    20. Schlegel, Jan Christoph, 2015. "Contracts versus salaries in matching: A general result," Journal of Economic Theory, Elsevier, vol. 159(PA), pages 552-573.
    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. Chao Huang, 2022. "Firm-worker hypergraphs," Papers 2211.06887, arXiv.org, revised Nov 2023.
    2. Chao Huang, 2022. "Two-sided matching with firms' complementary preferences," Papers 2205.05599, arXiv.org, revised May 2022.
    3. Chao Huang, 2021. "Unidirectional substitutes and complements," Papers 2108.12572, arXiv.org.
    4. Chao Huang, 2021. "Stable matching: an integer programming approach," Papers 2103.03418, arXiv.org, revised Apr 2022.
    5. Avataneo, Michelle & Turhan, Bertan, 2021. "Slot-specific priorities with capacity transfers," Games and Economic Behavior, Elsevier, vol. 129(C), pages 536-548.
    6. Schlegel, Jan Christoph, 2020. "Equivalent choice functions and stable mechanisms," Games and Economic Behavior, Elsevier, vol. 123(C), pages 41-53.
    7. Pycia, Marek & Yenmez, M. Bumin, 2019. "Matching with Externalities," CEPR Discussion Papers 13994, C.E.P.R. Discussion Papers.
    8. Hai Nguyen & Thành Nguyen & Alexander Teytelboym, 2021. "Stability in Matching Markets with Complex Constraints," Management Science, INFORMS, vol. 67(12), pages 7438-7454, December.
    9. Bando, Keisuke, 2014. "A modified deferred acceptance algorithm for many-to-one matching markets with externalities among firms," Journal of Mathematical Economics, Elsevier, vol. 52(C), pages 173-181.
    10. Schlegel, Jan Christoph, 2015. "Contracts versus salaries in matching: A general result," Journal of Economic Theory, Elsevier, vol. 159(PA), pages 552-573.
    11. 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.
    12. Hatfield, John William & Kominers, Scott Duke, 2017. "Contract design and stability in many-to-many matching," Games and Economic Behavior, Elsevier, vol. 101(C), pages 78-97.
    13. 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).
    14. 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.
    15. Kominers, Scott Duke & Sönmez, Tayfun, 2016. "Matching with slot-specific priorities: theory," Theoretical Economics, Econometric Society, vol. 11(2), May.
    16. Juárez, Noelia & Neme, Pablo & Oviedo, Jorge, 2022. "Lattice structure of the random stable set in many-to-many matching markets," Games and Economic Behavior, Elsevier, vol. 132(C), pages 255-273.
    17. Hassidim, Avinatan & Romm, Assaf & Shorrer, Ran I., 2019. "Contracts are not salaries in the hidden-substitutes domain," Economics Letters, Elsevier, vol. 181(C), pages 40-42.
    18. Kyle Greenberg & Parag A. Pathak & Tayfun Sönmez, 2020. "Mechanism Design meets Priority Design: Redesigning the US Army’s Branching Process Through Market Design," Boston College Working Papers in Economics 1035, Boston College Department of Economics.
    19. Kyle Greenberg & Parag A. Pathak & Tayfun Sonmez, 2021. "Mechanism Design meets Priority Design: Redesigning the US Army's Branching Process," Papers 2106.06582, arXiv.org.
    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

    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:arx:papers:2309.04181. 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: arXiv administrators (email available below). General contact details of provider: http://arxiv.org/ .

    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.