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

Complexity of Stability in Trading Networks

Author

Listed:
  • Tam'as Fleiner
  • Zsuzsanna Jank'o
  • Ildik'o Schlotter
  • Alexander Teytelboym

Abstract

Efficient computability is an important property of solution concepts in matching markets. We consider the computational complexity of finding and verifying various solution concepts in trading networks-multi-sided matching markets with bilateral contracts-under the assumption of full substitutability of agents' preferences. It is known that outcomes that satisfy trail stability always exist and can be found in linear time. Here we consider a slightly stronger solution concept in which agents can simultaneously offer an upstream and a downstream contract. We show that deciding the existence of outcomes satisfying this solution concept is an NP-complete problem even in a special (flow network) case of our model. It follows that the existence of stable outcomes--immune to deviations by arbitrary sets of agents-is also an NP-hard problem in trading networks (and in flow networks). Finally, we show that even verifying whether a given outcome is stable is NP-complete in trading networks.

Suggested Citation

  • Tam'as Fleiner & Zsuzsanna Jank'o & Ildik'o Schlotter & Alexander Teytelboym, 2018. "Complexity of Stability in Trading Networks," Papers 1805.08758, arXiv.org, revised Feb 2019.
    • Handle: RePEc:arx:papers:1805.08758
    as

    Download full text from publisher

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

    References listed on IDEAS

    as
    1. John William Hatfield & Scott Duke Kominers & Alexandru Nichifor & Michael Ostrovsky & Alexander Westkamp, 2013. "Stability and Competitive Equilibrium in Trading Networks," Journal of Political Economy, University of Chicago Press, vol. 121(5), pages 966-1005.
    2. 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.
    3. Echenique, Federico, 2007. "Counting combinatorial choice rules," Games and Economic Behavior, Elsevier, vol. 58(2), pages 231-245, February.
    4. Atila Abdulkadiroglu & Tayfun Sönmez, 2003. "School Choice: A Mechanism Design Approach," American Economic Review, American Economic Association, vol. 93(3), pages 729-747, June.
    5. Adachi, Hiroyuki, 2017. "Stable matchings and fixed points in trading networks: A note," Economics Letters, Elsevier, vol. 156(C), pages 65-67.
    6. Eric J. McDermid & David F. Manlove, 2010. "Keeping partners together: algorithmic results for the hospitals/residents problem with couples," Journal of Combinatorial Optimization, Springer, vol. 19(3), pages 279-303, April.
    7. Tamás Fleiner & Ravi Jagadeesan & Zsuzsanna Jankó & Alexander Teytelboym, 2019. "Trading Networks With Frictions," Econometrica, Econometric Society, vol. 87(5), pages 1633-1661, September.
    8. 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.
    9. 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.
    10. 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.
    11. 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.
    12. Ahmet Alkan, 2002. "A class of multipartner matching markets with a strong lattice structure," Economic Theory, Springer;Society for the Advancement of Economic Theory (SAET), vol. 19(4), pages 737-746.
    13. , & ,, 2006. "A theory of stability in many-to-many matching markets," Theoretical Economics, Econometric Society, vol. 1(2), pages 233-273, June.
    14. Roth, Alvin E, 1984. "The Evolution of the Labor Market for Medical Interns and Residents: A Case Study in Game Theory," Journal of Political Economy, University of Chicago Press, vol. 92(6), pages 991-1016, December.
    15. Sotomayor, Marilda, 1999. "Three remarks on the many-to-many stable matching problem," Mathematical Social Sciences, Elsevier, vol. 38(1), pages 55-70, July.
    16. Westkamp, Alexander, 2010. "Market Structure and Matching with Contracts," Bonn Econ Discussion Papers 02/2010, University of Bonn, Bonn Graduate School of Economics (BGSE).
    17. Westkamp, Alexander, 2010. "Market structure and matching with contracts," Journal of Economic Theory, Elsevier, vol. 145(5), pages 1724-1738, September.
    18. Orhan Ayg?n & Tayfun S?nmez, 2013. "Matching with Contracts: Comment," American Economic Review, American Economic Association, vol. 103(5), pages 2050-2051, August.
    19. Michael Ostrovsky, 2008. "Stability in Supply Chain Networks," American Economic Review, American Economic Association, vol. 98(3), pages 897-923, June.
    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. Tamás Fleiner & Zsuzsanna Jankó & Ildikó Schlotter & Alexander Teytelboym, 2023. "Complexity of stability in trading networks," International Journal of Game Theory, Springer;Game Theory Society, vol. 52(3), pages 629-648, September.
    2. Tam'as Fleiner & Zsuzsanna Jank'o & Akihisa Tamura & Alexander Teytelboym, 2015. "Trading Networks with Bilateral Contracts," Papers 1510.01210, arXiv.org, revised May 2018.
    3. 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.
    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. Tamás Fleiner & Ravi Jagadeesan & Zsuzsanna Jankó & Alexander Teytelboym, 2019. "Trading Networks With Frictions," Econometrica, Econometric Society, vol. 87(5), pages 1633-1661, September.
    7. Yenmez, M. Bumin, 2018. "A college admissions clearinghouse," Journal of Economic Theory, Elsevier, vol. 176(C), pages 859-885.
    8. Bando, Keisuke & Hirai, Toshiyuki, 2021. "Stability and venture structures in multilateral matching," Journal of Economic Theory, Elsevier, vol. 196(C).
    9. Agustin G. Bonifacio & Nadia Guiñazú & Noelia Juarez & Pablo Neme & Jorge Oviedo, 2024. "The lattice of envy-free many-to-many matchings with contracts," Theory and Decision, Springer, vol. 96(1), pages 113-134, February.
    10. Juan F. Fung & Chia-Ling Hsu, 2021. "A cumulative offer process for supply chain networks," Review of Economic Design, Springer;Society for Economic Design, vol. 25(1), pages 93-109, June.
    11. 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.
    12. 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.
    13. Dimakopoulos, Philipp D. & Heller, C.-Philipp, 2019. "Matching with waiting times: The German entry-level labor market for lawyers," Games and Economic Behavior, Elsevier, vol. 115(C), pages 289-313.
    14. Adachi, Hiroyuki, 2017. "Stable matchings and fixed points in trading networks: A note," Economics Letters, Elsevier, vol. 156(C), pages 65-67.
    15. 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.
    16. Chen, Peter & Egesdal, Michael & Pycia, Marek & Yenmez, M. Bumin, 2016. "Median stable matchings in two-sided markets," Games and Economic Behavior, Elsevier, vol. 97(C), pages 64-69.
    17. 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.
    18. Avataneo, Michelle & Turhan, Bertan, 2021. "Slot-specific priorities with capacity transfers," Games and Economic Behavior, Elsevier, vol. 129(C), pages 536-548.
    19. 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.
    20. 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.

    More about this item

    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:1805.08758. 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.