IDEAS home Printed from https://ideas.repec.org/a/nea/journl/y2021i51p12-29.html
   My bibliography  Save this article

Stable systems of schedule contracts

Author

Listed:
  • Danilov, V.

    (Central Economics and Mathematics Institute, Russian Academy of Sciences, Moscow, Russia)

Abstract

The paper studies the systems of paired contracts between agents of two complementary groups (workers and firms, students and universities, depositors and banks). Multiple contracts are allowed, as well as flexible contracts when the contract is concluded with some intensity. Agent preferences are described using choice functions. It is shown that if these choice functions satisfy the condition that we call conservativeness, then there are so-called stable systems of contracts, when it is unprofitable for any pair of counterparties to change the concluded contracts. The existence of a stable system of contracts is established using the transfinite process of sequential approximation, which generalizes the classical Gale?Shapley algorithm. As a result, we relieved of the finiteness conditions of the set of contracts. Such properties of stable systems as polarization and latticeness are also studied.

Suggested Citation

  • Danilov, V., 2021. "Stable systems of schedule contracts," Journal of the New Economic Association, New Economic Association, vol. 51(3), pages 12-29.
    • Handle: RePEc:nea:journl:y:2021:i:51:p:12-29
    DOI: 10.31737/2221-2264-2021-51-3-1
    as

    Download full text from publisher

    File URL: http://www.econorus.org/repec/journl/2021-51-12-29r.pdf
    Download Restriction: no
    File URL: https://libkey.io/10.31737/2221-2264-2021-51-3-1?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
    ---><---

    References listed on IDEAS

    as
    1. Vilmos Komornik & Zsolt Komornik & Christelle Viauroux, 2010. "Stable Schedule Matchings," UMBC Economics Department Working Papers 10-120, UMBC Department of Economics, revised 01 Jul 2011.
    2. Alkan, Ahmet & Gale, David, 2003. "Stable schedule matching under revealed preference," Journal of Economic Theory, Elsevier, vol. 112(2), pages 289-306, October.
    3. Charles Blair, 1988. "The Lattice Structure of the Set of Stable Matchings with Multiple Partners," Mathematics of Operations Research, INFORMS, vol. 13(4), pages 619-628, November.
    4. , & ,, 2006. "A theory of stability in many-to-many matching markets," Theoretical Economics, Econometric Society, vol. 1(2), pages 233-273, June.
    5. 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.
    6. Danilov, V. & Koshevoy, G., 2005. "Mathematics of Plott choice functions," Mathematical Social Sciences, Elsevier, vol. 49(3), pages 245-272, May.
    7. Roth, Alvin E, 1984. "Stability and Polarization of Interests in Job Matching," Econometrica, Econometric Society, vol. 52(1), pages 47-57, January.
    8. Plott, Charles R, 1973. "Path Independence, Rationality, and Social Choice," Econometrica, Econometric Society, vol. 41(6), pages 1075-1091, November.
    9. Sotomayor, Marilda, 1999. "Three remarks on the many-to-many stable matching problem," Mathematical Social Sciences, Elsevier, vol. 38(1), pages 55-70, July.
    10. 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.
    11. 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.
    12. 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.
    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. Vladimir I. Danilov, 2024. "Sequential choice functions and stability problems," Papers 2401.00748, arXiv.org, revised Mar 2024.

    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. Kazuo Murota & Yu Yokoi, 2015. "On the Lattice Structure of Stable Allocations in a Two-Sided Discrete-Concave Market," Mathematics of Operations Research, INFORMS, vol. 40(2), pages 460-473, February.
    2. 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.
    3. Danilov, Vladimir I. & Karzanov, Alexander V., 2023. "Stable and meta-stable contract networks," Journal of Mathematical Economics, Elsevier, vol. 108(C).
    4. 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.
    5. 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.
    6. John William Hatfield & Scott Duke Kominers, 2012. "Matching in Networks with Bilateral Contracts," American Economic Journal: Microeconomics, American Economic Association, vol. 4(1), pages 176-208, February.
    7. Alva, Samson, 2018. "WARP and combinatorial choice," Journal of Economic Theory, Elsevier, vol. 173(C), pages 320-333.
    8. David Cantala, 2011. "Agreement toward stability in matching markets," Review of Economic Design, Springer;Society for Economic Design, vol. 15(4), pages 293-316, December.
    9. Daniel Lehmann, 2019. "Revealed Preferences for Matching with Contracts," Papers 1908.08823, arXiv.org, revised Mar 2020.
    10. 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.
    11. Yang, Yi-You, 2020. "Rationalizable choice functions," Games and Economic Behavior, Elsevier, vol. 123(C), pages 120-126.
    12. 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.
    13. Tam'as Fleiner & Zsuzsanna Jank'o & Akihisa Tamura & Alexander Teytelboym, 2015. "Trading Networks with Bilateral Contracts," Papers 1510.01210, arXiv.org, revised May 2018.
    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. Sean Horan & Vikram Manjunath, 2022. "Lexicographic Composition of Choice Functions," Papers 2209.09293, arXiv.org.
    16. Tamás Fleiner & Ravi Jagadeesan & Zsuzsanna Jankó & Alexander Teytelboym, 2019. "Trading Networks With Frictions," Econometrica, Econometric Society, vol. 87(5), pages 1633-1661, September.
    17. Yenmez, M. Bumin, 2018. "A college admissions clearinghouse," Journal of Economic Theory, Elsevier, vol. 176(C), pages 859-885.
    18. Vilmos Komornik & Christelle Viauroux, 2012. "Conditional Stable Matchings," UMBC Economics Department Working Papers 12-03, UMBC Department of Economics.
    19. Hideo Konishi & M. Utku Ünver, 2003. "Credible Group Stability in Multi-Partner Matching Problems," Working Papers 2003.115, Fondazione Eni Enrico Mattei.
    20. Klaus, Bettina & Walzl, Markus, 2009. "Stable many-to-many matchings with contracts," Journal of Mathematical Economics, Elsevier, vol. 45(7-8), pages 422-434, July.

    More about this item

    Keywords

    choice function; Gale?Shapley algorithm; matching; lattice;
    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
    • D49 - Microeconomics - - Market Structure, Pricing, and Design - - - Other
    • D86 - Microeconomics - - Information, Knowledge, and Uncertainty - - - Economics of Contract Law

    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:nea:journl:y:2021:i:51:p:12-29. 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: Alexey Tcharykov (email available below). General contact details of provider: https://edirc.repec.org/data/nearuea.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.