IDEAS home Printed from https://ideas.repec.org/a/wsi/serxxx/v64y2019i03ns0217590816500351.html
   My bibliography  Save this article

A Note On Asymmetries In Friendship Networks

Author

Listed:
  • QUQIONG HE

    (School of Economics and the Center for Econometric Analysis and Forecasting, Dongbei University of Finance and Economics, China)

  • SUDIPTA SARANGI

    (#x2020;Virginia Tech, Blacksburg VA 24061-0316 and DIW Berlin, 10117 Berlin, Germany)

  • ZHENGJIA SUN

    (#x2021;Louisiana State University, Baton Rouge LA 70803, USA)

Abstract

We generalize the analysis of Brueckner’s [(2006). Friendship networks. Journal of Regional Science, 847–865] friendship networks under different types of asymmetries. We first study cost asymmetries by allowing for cost-magnetic agents. These are players whose linking costs are the lowest. Next we focus on network-based asymmetries by allowing for knows-everyone agents. We identify conditions under which Nash networks are interlinked stars in both these cases. We also find that for asymmetric situations (whether in costs, values, or architectures), the equilibrium effort choices regarding the links between different types of agents are robust across the various friendship network models.

Suggested Citation

  • Quqiong He & Sudipta Sarangi & Zhengjia Sun, 2019. "A Note On Asymmetries In Friendship Networks," The Singapore Economic Review (SER), World Scientific Publishing Co. Pte. Ltd., vol. 64(03), pages 799-811, June.
  • Handle: RePEc:wsi:serxxx:v:64:y:2019:i:03:n:s0217590816500351
    DOI: 10.1142/S0217590816500351
    as

    Download full text from publisher

    File URL: http://www.worldscientific.com/doi/abs/10.1142/S0217590816500351
    Download Restriction: Access to full text is restricted to subscribers

    File URL: https://libkey.io/10.1142/S0217590816500351?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. Pascal Billand & Christophe Bravard & Sudipta Sarangi, 2010. "The Insider-Outsider Model Reexamined," Games, MDPI, vol. 1(4), pages 1-16, October.
    2. Haller, Hans & Sarangi, Sudipta, 2005. "Nash networks with heterogeneous links," Mathematical Social Sciences, Elsevier, vol. 50(2), pages 181-201, September.
    3. 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.
    4. Bloch, Francis & Dutta, Bhaskar, 2009. "Communication networks with endogenous link strength," Games and Economic Behavior, Elsevier, vol. 66(1), pages 39-56, May.
    5. Galeotti, Andrea & Goyal, Sanjeev & Kamphorst, Jurjen, 2006. "Network formation with heterogeneous players," Games and Economic Behavior, Elsevier, vol. 54(2), pages 353-372, February.
    6. Aditi Roy & Sudipta Sarangi, 2009. "Revisiting Friendship Networks," Economics Bulletin, AccessEcon, vol. 29(4), pages 2640-2647.
    7. Hans Haller & Jurjen Kamphorst & Sudipta Sarangi, 2007. "(Non-)existence and Scope of Nash Networks," Economic Theory, Springer;Society for the Advancement of Economic Theory (SAET), vol. 31(3), pages 597-604, 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. Haller, Hans, 2012. "Network extension," Mathematical Social Sciences, Elsevier, vol. 64(2), pages 166-172.
    2. Breitmoser, Yves & Vorjohann, Pauline, 2013. "Efficient structure of noisy communication networks," Mathematical Social Sciences, Elsevier, vol. 66(3), pages 396-409.
    3. Billand, Pascal & Bravard, Christophe & Sarangi, Sudipta, 2012. "Existence of Nash networks and partner heterogeneity," Mathematical Social Sciences, Elsevier, vol. 64(2), pages 152-158.
    4. Chenghong Luo & Ana Mauleon & Vincent Vannetelbosch, 2021. "Network formation with myopic and farsighted players," Economic Theory, Springer;Society for the Advancement of Economic Theory (SAET), vol. 71(4), pages 1283-1317, June.
    5. Haller, Hans & Hoyer, Britta, 2019. "The common enemy effect under strategic network formation and disruption," Journal of Economic Behavior & Organization, Elsevier, vol. 162(C), pages 146-163.
    6. Goeree, Jacob K. & Riedl, Arno & Ule, Aljaz, 2009. "In search of stars: Network formation among heterogeneous agents," Games and Economic Behavior, Elsevier, vol. 67(2), pages 445-466, November.
    7. Pascal Billand & Christophe Bravard & Sudipta Sarangi, 2008. "Existence of Nash networks in one-way flow models," Economic Theory, Springer;Society for the Advancement of Economic Theory (SAET), vol. 37(3), pages 491-507, December.
    8. Kinateder, Markus & Merlino, Luca Paolo, 2022. "Local public goods with weighted link formation," Games and Economic Behavior, Elsevier, vol. 132(C), pages 316-327.
    9. Jacques Durieu & Hans Haller & Philippe Solal, 2011. "Nonspecific Networking," Games, MDPI, vol. 2(1), pages 1-27, February.
    10. Joost Vandenbossche & Thomas Demuynck, 2013. "Network Formation with Heterogeneous Agents and Absolute Friction," Computational Economics, Springer;Society for Computational Economics, vol. 42(1), pages 23-45, June.
    11. Harmsen - van Hout, Marjolein J.W. & Herings, P. Jean-Jacques & Dellaert, Benedict G.C., 2013. "Communication network formation with link specificity and value transferability," European Journal of Operational Research, Elsevier, vol. 229(1), pages 199-211.
    12. Pascal Billand & Christophe Bravard & Sudipta Sarangi & J. Kamphorst, 2011. "Confirming information flows in networks," Post-Print halshs-00672351, HAL.
    13. Gersbach, Hans & Haller, Hans, 2022. "Gainers and losers from market integration," Mathematical Social Sciences, Elsevier, vol. 116(C), pages 32-39.
    14. Michael D König & Stefano Battiston & Mauro Napoletano & Frank Schweitzer, 2008. "The Efficiency and Evolution of R&D Networks," Working Papers hal-00973077, HAL.
    15. Isabel Melguizo, 2023. "Group representation concerns and network formation," Bulletin of Economic Research, Wiley Blackwell, vol. 75(1), pages 151-179, January.
    16. Pascal Billand & Christophe Bravard & Sudipta Sarangi, 2012. "On the interaction between heterogeneity and decay in two-way flow models," Theory and Decision, Springer, vol. 73(4), pages 525-538, October.
    17. Ping Sun & Elena Parilina, 2022. "Impact of Utilities on the Structures of Stable Networks with Ordered Group Partitioning," Dynamic Games and Applications, Springer, vol. 12(4), pages 1131-1162, December.
    18. Safi, Shahir, 2022. "Listen before you link: Optimal monitoring rules for communication networks," Games and Economic Behavior, Elsevier, vol. 133(C), pages 230-247.
    19. Olaizola, Norma & Valenciano, Federico, 2013. "Network formation under linking constraints," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 392(20), pages 5194-5205.
    20. Charoensook, Banchongsan, 2015. "On the Interaction between Player Heterogeneity and Partner Heterogeneity in Strict Nash Networks," MPRA Paper 61205, University Library of Munich, Germany.

    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:wsi:serxxx:v:64:y:2019:i:03:n:s0217590816500351. 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: Tai Tone Lim (email available below). General contact details of provider: http://www.worldscinet.com/ser/ser.shtml .

    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.