IDEAS home Printed from https://ideas.repec.org/a/spr/jogath/v42y2013i2p521-539.html
   My bibliography  Save this article

One-to-many non-cooperative matching games

Author

Listed:
  • Yujiro Kawasaki

Abstract

We study a strategic model of wage negotiations between firms and workers. First, we define the stability of an allocation in an environment where firms can employ more than one worker. Secondly, we develop a one-to-many non-cooperative matching game, which is an extension of Kamecke’s one-to-one non-cooperative matching game. The main result shows the equivalence between the stable allocations and the outcomes of the subgame equilibria in the matching game: for any stable allocation in this game there is a subgame perfect equilibrium which induces the allocation on the equilibrium path, and every subgame perfect equilibrium induces a stable allocation on the equilibrium path. Furthermore, as for the existence of a stable allocation, we argue that a stable allocation, as with a subgame perfect equilibrium, does not always exist, but it exists under some conditions, using Kelso and Crawford’s modelling. Copyright Springer-Verlag Berlin Heidelberg 2013

Suggested Citation

  • Yujiro Kawasaki, 2013. "One-to-many non-cooperative matching games," International Journal of Game Theory, Springer;Game Theory Society, vol. 42(2), pages 521-539, May.
    • Handle: RePEc:spr:jogath:v:42:y:2013:i:2:p:521-539
    DOI: 10.1007/s00182-013-0369-7
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1007/s00182-013-0369-7
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1007/s00182-013-0369-7?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. , & ,, 2006. "A theory of stability in many-to-many matching markets," Theoretical Economics, Econometric Society, vol. 1(2), pages 233-273, June.
    2. Alcalde, Jose & Perez-Castrillo, David & Romero-Medina, Antonio, 1998. "Hiring Procedures to Implement Stable Allocations," Journal of Economic Theory, Elsevier, vol. 82(2), pages 469-480, October.
    3. Kamecke, U, 1989. "Non-cooperative Matching Games," International Journal of Game Theory, Springer;Game Theory Society, vol. 18(4), pages 423-431.
    4. John William Hatfield & Paul R. Milgrom, 2005. "Matching with Contracts," American Economic Review, American Economic Association, vol. 95(4), pages 913-935, September.
    5. Roth, Alvin E, 1984. "Stability and Polarization of Interests in Job Matching," Econometrica, Econometric Society, vol. 52(1), pages 47-57, January.
    6. Roth, Alvin E., 1985. "The college admissions problem is not equivalent to the marriage problem," Journal of Economic Theory, Elsevier, vol. 36(2), pages 277-288, August.
    7. 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.
    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. Okada, Akira, 2021. "Stable matching and protocol-free equilibrium," Games and Economic Behavior, Elsevier, vol. 128(C), pages 193-201.

    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. Alcalde, José, 2018. "Beyond the Spanish MIR with consent: (Hidden) cooperation and coordination in matching," Games and Economic Behavior, Elsevier, vol. 110(C), pages 32-49.
    2. Klijn, Flip & Yazıcı, Ayşe, 2014. "A many-to-many ‘rural hospital theorem’," Journal of Mathematical Economics, Elsevier, vol. 54(C), pages 63-73.
    3. Ayşe Yazıcı, 2017. "Probabilistic stable rules and Nash equilibrium in two-sided matching problems," International Journal of Game Theory, Springer;Game Theory Society, vol. 46(1), pages 103-124, March.
    4. Tam'as Fleiner & Zsuzsanna Jank'o & Akihisa Tamura & Alexander Teytelboym, 2015. "Trading Networks with Bilateral Contracts," Papers 1510.01210, arXiv.org, revised May 2018.
    5. Jiao, Zhenhua & Tian, Guoqiang, 2017. "The Blocking Lemma and strategy-proofness in many-to-many matchings," Games and Economic Behavior, Elsevier, vol. 102(C), pages 44-55.
    6. Daniel Lehmann, 2019. "Revealed Preferences for Matching with Contracts," Papers 1908.08823, arXiv.org, revised Mar 2020.
    7. Paula Jaramillo & Çaǧatay Kayı & Flip Klijn, 2014. "On the exhaustiveness of truncation and dropping strategies in many-to-many matching markets," Social Choice and Welfare, Springer;The Society for Social Choice and Welfare, vol. 42(4), pages 793-811, April.
    8. 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.
    9. Assaf Romm, 2014. "Implications of capacity reduction and entry in many-to-one stable matching," Social Choice and Welfare, Springer;The Society for Social Choice and Welfare, vol. 43(4), pages 851-875, December.
    10. 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.
    11. Claus-Jochen Haake & Bettina Klaus, 2010. "Stability and Nash implementation in matching markets with couples," Theory and Decision, Springer, vol. 69(4), pages 537-554, October.
    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. , & ,, 2006. "A theory of stability in many-to-many matching markets," Theoretical Economics, Econometric Society, vol. 1(2), pages 233-273, June.
    14. Konishi, Hideo & Unver, M. Utku, 2006. "Credible group stability in many-to-many matching problems," Journal of Economic Theory, Elsevier, vol. 129(1), pages 57-80, July.
    15. Antonio Romero-Medina & Matteo Triossi, 2023. "Take-it-or-leave-it contracts in many-to-many matching markets," Economic Theory, Springer;Society for the Advancement of Economic Theory (SAET), vol. 75(2), pages 591-623, February.
    16. Jonathan Ma & Scott Duke Kominers, 2018. "Bundling Incentives in (Many-to-Many) Matching with Contracts," Harvard Business School Working Papers 19-011, Harvard Business School.
    17. Okada, Akira, 2021. "Stable matching and protocol-free equilibrium," Games and Economic Behavior, Elsevier, vol. 128(C), pages 193-201.
    18. Tamás Fleiner & Ravi Jagadeesan & Zsuzsanna Jankó & Alexander Teytelboym, 2019. "Trading Networks With Frictions," Econometrica, Econometric Society, vol. 87(5), pages 1633-1661, September.
    19. Claus-Jochen Haake & Bettina Klaus, 2009. "Monotonicity and Nash implementation in matching markets with contracts," Economic Theory, Springer;Society for the Advancement of Economic Theory (SAET), vol. 41(3), pages 393-410, December.
    20. 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.

    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:spr:jogath:v:42:y:2013:i:2:p:521-539. 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: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    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.