IDEAS home Printed from https://ideas.repec.org/a/eee/matsoc/v79y2016icp53-60.html
   My bibliography  Save this article

The stability and efficiency of direct and star networks in a loan game

Author

Listed:
  • Mao, Liang

Abstract

We analyze a loan game where identical lenders and identical borrowers first form a loan network by creating bilateral links and then trade in this network. To predict the outcome of the loan game, we make two important assumptions: (i) players trade and split the surplus according to the Myerson value in any given loan network, and (ii) certain networks–networks that are pairwise stable and/or efficient under the Myerson value–are more likely to be formed. Two basic network structures, direct networks and star networks, are common in reality and sometimes coexist in a loan market. We explain these phenomena by showing that, if the link cost of each trade is small enough, these two networks are both efficient and internally stable, but they are not necessarily externally stable.

Suggested Citation

  • Mao, Liang, 2016. "The stability and efficiency of direct and star networks in a loan game," Mathematical Social Sciences, Elsevier, vol. 79(C), pages 53-60.
  • Handle: RePEc:eee:matsoc:v:79:y:2016:i:c:p:53-60
    DOI: 10.1016/j.mathsocsci.2015.10.009
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0165489615001043
    Download Restriction: Full text for ScienceDirect subscribers only

    File URL: https://libkey.io/10.1016/j.mathsocsci.2015.10.009?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. Furusawa, Taiji & Konishi, Hideo, 2007. "Free trade networks," Journal of International Economics, Elsevier, vol. 72(2), pages 310-335, July.
    2. Herings, P.J.J. & van der Laan, G. & Talman, A.J.J. & Yang, Z.F., 2010. "The average tree solution for cooperative games with communication structure," Other publications TiSEM 24359ac5-6399-42ee-8f0b-7, Tilburg University, School of Economics and Management.
    3. Paul Belleflamme & Francis Bloch, 2004. "Market sharing agreements and collusive networks," International Economic Review, Department of Economics, University of Pennsylvania and Osaka University Institute of Social and Economic Research Association, vol. 45(2), pages 387-411, May.
    4. Jackson, Matthew O. & Wolinsky, Asher, 1996. "A Strategic Model of Social and Economic Networks," Journal of Economic Theory, Elsevier, vol. 71(1), pages 44-74, October.
    5. Johnson, C. & Gilles, R.P., 1999. "Spatial Social Networks," Discussion Paper 1999-87, Tilburg University, Center for Economic Research.
    6. Corominas-Bosch, Margarida, 2004. "Bargaining in a network of buyers and sellers," Journal of Economic Theory, Elsevier, vol. 115(1), pages 35-77, March.
    7. Roger B. Myerson, 1977. "Graphs and Cooperation in Games," Mathematics of Operations Research, INFORMS, vol. 2(3), pages 225-229, August.
    8. Herings, P.J.J. & van der Laan, G. & Talman, A.J.J. & Yang, Z., 2010. "The average tree solution for cooperative games with communication structure," Games and Economic Behavior, Elsevier, vol. 68(2), pages 626-633, March.
    9. Johnson, C. & Gilles, R.P., 1999. "Spatial Social Networks," Other publications TiSEM 5106db3c-8785-4ab3-8d20-1, Tilburg University, School of Economics and Management.
    10. Herings, P. Jean Jacques & van der Laan, Gerard & Talman, Dolf, 2008. "The average tree solution for cycle-free graph games," Games and Economic Behavior, Elsevier, vol. 62(1), pages 77-92, January.
    11. repec:fth:tilbur:9987 is not listed on IDEAS
    12. Rachel E. Kranton & Deborah F. Minehart, 2001. "A Theory of Buyer-Seller Networks," American Economic Review, American Economic Association, vol. 91(3), pages 485-508, 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. Matthew O. Jackson, 2003. "A Survey of Models of Network Formation: Stability and Efficiency," Game Theory and Information 0303011, University Library of Munich, Germany.
    2. Matthew O. Jackson, 2002. "The Stability and Efficiency of Economic and Social Networks," Microeconomics 0211011, University Library of Munich, Germany.
    3. Johari, Ramesh & Mannor, Shie & Tsitsiklis, John N., 2006. "A contract-based model for directed network formation," Games and Economic Behavior, Elsevier, vol. 56(2), pages 201-224, August.
    4. Alessio D'Ignazio & Emanuele Giovannetti, 2006. "From Exogenous To Endogenous Economic Networks: Internet Applications," Journal of Economic Surveys, Wiley Blackwell, vol. 20(5), pages 757-796, December.
    5. van den Brink, René & van der Laan, Gerard & Moes, Nigel, 2013. "A strategic implementation of the Average Tree solution for cycle-free graph games," Journal of Economic Theory, Elsevier, vol. 148(6), pages 2737-2748.
    6. Slikker, M. & Gilles, R.P. & Norde, H.W. & Tijs, S.H., 2000. "Directed Communication Networks," Discussion Paper 2000-84, Tilburg University, Center for Economic Research.
    7. Jean-François Caulier & Ana Mauleon & Vincent Vannetelbosch, 2013. "Contractually stable networks," International Journal of Game Theory, Springer;Game Theory Society, vol. 42(2), pages 483-499, May.
    8. Sofia Priazhkina & Samuel Palmer & Pablo Martín-Ramiro & Román Orús & Samuel Mugel & Vladimir Skavysh, 2024. "Digital Payments in Firm Networks: Theory of Adoption and Quantum Algorithm," Staff Working Papers 24-17, Bank of Canada.
    9. Liying Kang & Anna Khmelnitskaya & Erfang Shan & Dolf Talman & Guang Zhang, 2021. "The average tree value for hypergraph games," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 94(3), pages 437-460, December.
    10. Suzuki, T. & Talman, A.J.J., 2011. "Solution Concepts for Cooperative Games with Circular Communication Structure," Other publications TiSEM d863606f-a58a-4f92-894d-e, Tilburg University, School of Economics and Management.
    11. Richard Baron & Sylvain Béal & Eric Rémila & Philippe Solal, 2011. "Average tree solutions and the distribution of Harsanyi dividends," International Journal of Game Theory, Springer;Game Theory Society, vol. 40(2), pages 331-349, May.
    12. René Brink & P. Herings & Gerard Laan & A. Talman, 2015. "The Average Tree permission value for games with a permission tree," Economic Theory, Springer;Society for the Advancement of Economic Theory (SAET), vol. 58(1), pages 99-123, January.
    13. Noriaki Matsushima, 2009. "Vertical Mergers And Product Differentiation," Journal of Industrial Economics, Wiley Blackwell, vol. 57(4), pages 812-834, December.
    14. Béal, Sylvain & Rémila, Eric & Solal, Philippe, 2015. "Characterization of the Average Tree solution and its kernel," Journal of Mathematical Economics, Elsevier, vol. 60(C), pages 159-165.
    15. Liying Kang & Anna Khmelnitskaya & Erfang Shan & Dolf Talman & Guang Zhang, 2023. "The two-step average tree value for graph and hypergraph games," Annals of Operations Research, Springer, vol. 323(1), pages 109-129, April.
    16. Slikker, M. & Gilles, R.P. & Norde, H.W. & Tijs, S.H., 2000. "Directed Communication Networks," Other publications TiSEM 00f2df6e-3a8e-4ed3-84cf-2, Tilburg University, School of Economics and Management.
    17. Sylvain Béal & Eric Rémila & Philippe Solal, 2012. "Compensations in the Shapley value and the compensation solutions for graph games," International Journal of Game Theory, Springer;Game Theory Society, vol. 41(1), pages 157-178, February.
    18. Anna Khmelnitskaya & Gerard van der Laan & Dolf Talman, 2016. "Centrality Rewarding Shapley and Myerson Values for Undirected Graph Games," Tinbergen Institute Discussion Papers 16-070/II, Tinbergen Institute.
    19. Béal, Sylvain & Rémila, Eric & Solal, Philippe, 2012. "Weighted component fairness for forest games," Mathematical Social Sciences, Elsevier, vol. 64(2), pages 144-151.
    20. Sylvain Béal & Eric Rémila & Philippe Solal, 2022. "Allocation rules for cooperative games with restricted communication and a priori unions based on the Myerson value and the average tree solution," Journal of Combinatorial Optimization, Springer, vol. 43(4), pages 818-849, May.

    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:eee:matsoc:v:79:y:2016:i:c:p:53-60. 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: Catherine Liu (email available below). General contact details of provider: http://www.elsevier.com/locate/inca/505565 .

    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.