IDEAS home Printed from https://ideas.repec.org/a/spr/comaot/v18y2012i4d10.1007_s10588-011-9105-7.html
   My bibliography  Save this article

How behaviors spread in dynamic social networks

Author

Listed:
  • Yu Zhang

    (Trinity University)

  • Yu Wu

    (Stanford University)

Abstract

In this paper, we explore how decentralized local interactions of autonomous agents in a network relate to collective behaviors. Earlier work in this area has modeled social networks with fixed agent relations. We instead focus on dynamic social networks in which agents can rationally adjust their neighborhoods based on their individual interests. We propose a new connection evaluation theory, the Highest Weighted Reward (HWR) rule: agents dynamically choose their neighbors in order to maximize their own utilities based on rewards from previous interactions. We prove that, in the two-action pure coordination game, our system would stabilize to a clustering state in which all relationships in the network are rewarded with an optimal payoff. Our experiments verify this theory and also reveal additional interesting patterns in the network.

Suggested Citation

  • Yu Zhang & Yu Wu, 2012. "How behaviors spread in dynamic social networks," Computational and Mathematical Organization Theory, Springer, vol. 18(4), pages 419-444, December.
    • Handle: RePEc:spr:comaot:v:18:y:2012:i:4:d:10.1007_s10588-011-9105-7
    DOI: 10.1007/s10588-011-9105-7
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10588-011-9105-7
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.
    File URL: https://libkey.io/10.1007/s10588-011-9105-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. David Banks, 2009. "Dynamic network models: introduction to new and interdisciplinary approaches," Computational and Mathematical Organization Theory, Springer, vol. 15(4), pages 259-260, December.
    2. S. Redner, 1998. "How popular is your paper? An empirical study of the citation distribution," The European Physical Journal B: Condensed Matter and Complex Systems, Springer;EDP Sciences, vol. 4(2), pages 131-134, July.
    3. Eric A. Vance & Elizabeth A. Archie & Cynthia J. Moss, 2009. "Social networks in African elephants," Computational and Mathematical Organization Theory, Springer, vol. 15(4), pages 273-293, December.
    4. López-Pintado, Dunia, 2008. "Diffusion in complex social networks," Games and Economic Behavior, Elsevier, vol. 62(2), pages 573-590, March.
    5. Yonghong Chen & Steven L. Bressler & Mingzhou Ding, 2009. "Dynamics on networks: assessing functional connectivity with Granger causality," Computational and Mathematical Organization Theory, Springer, vol. 15(4), pages 329-350, December.
    6. Peter D. Hoff, 2009. "Multiplicative latent factor models for description and prediction of social networks," Computational and Mathematical Organization Theory, Springer, vol. 15(4), pages 261-272, December.
    7. Erev, Ido & Roth, Alvin E, 1998. "Predicting How People Play Games: Reinforcement Learning in Experimental Games with Unique, Mixed Strategy Equilibria," American Economic Review, American Economic Association, vol. 88(4), pages 848-881, September.
    8. Paul Davidsson, 2002. "Agent Based Social Simulation: a Computer Science View," Journal of Artificial Societies and Social Simulation, Journal of Artificial Societies and Social Simulation, vol. 5(1), pages 1-7.
    9. Terrill L. Frantz & Marcelo Cataldo & Kathleen M. Carley, 2009. "Robustness of centrality measures under uncertainty: Examining the role of network topology," Computational and Mathematical Organization Theory, Springer, vol. 15(4), pages 303-328, December.
    10. Mark S. Handcock & Martina Morris, 2009. "A curved exponential family model for complex networks," Computational and Mathematical Organization Theory, Springer, vol. 15(4), pages 294-302, December.
    11. Emily M. Jin & Michelle Girvan & M. E. J. Newman, 2001. "The Structure of Growing Social Networks," Working Papers 01-06-032, Santa Fe Institute.
    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. Jianjun Lu & Shozo Tokinaga, 2016. "Cluster fluctuation in two-dimensional lattices with local interactions," Computational and Mathematical Organization Theory, Springer, vol. 22(2), pages 237-259, June.

    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. Claes Andersson & Koen Frenken & Alexander Hellervik, 2006. "A Complex Network Approach to Urban Growth," Environment and Planning A, , vol. 38(10), pages 1941-1964, October.
    2. Zhang, Xin-Jie & Tang, Yong & Xiong, Jason & Wang, Wei-Jia & Zhang, Yi-Cheng, 2020. "Ranking game on networks: The evolution of hierarchical society," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 540(C).
    3. Andrea Galeotti & Brian W. Rogers, 2013. "Strategic Immunization and Group Structure," American Economic Journal: Microeconomics, American Economic Association, vol. 5(2), pages 1-32, May.
    4. Noah Gans & George Knox & Rachel Croson, 2007. "Simple Models of Discrete Choice and Their Performance in Bandit Experiments," Manufacturing & Service Operations Management, INFORMS, vol. 9(4), pages 383-408, December.
    5. Terry E. Daniel & Eyran J. Gisches & Amnon Rapoport, 2009. "Departure Times in Y-Shaped Traffic Networks with Multiple Bottlenecks," American Economic Review, American Economic Association, vol. 99(5), pages 2149-2176, December.
    6. Iftekhar, M. S. & Tisdell, J. G., 2018. "Learning in repeated multiple unit combinatorial auctions: An experimental study," Working Papers 267301, University of Western Australia, School of Agricultural and Resource Economics.
    7. Ianni, A., 2002. "Reinforcement learning and the power law of practice: some analytical results," Discussion Paper Series In Economics And Econometrics 203, Economics Division, School of Social Sciences, University of Southampton.
    8. Manuel Förster & Michel Grabisch & Agnieszka Rusinowska, 2012. "Ordered Weighted Averaging in Social Networks," Documents de travail du Centre d'Economie de la Sorbonne 12056, Université Panthéon-Sorbonne (Paris 1), Centre d'Economie de la Sorbonne.
    9. Benaïm, Michel & Hofbauer, Josef & Hopkins, Ed, 2009. "Learning in games with unstable equilibria," Journal of Economic Theory, Elsevier, vol. 144(4), pages 1694-1709, July.
    10. Oechssler, Jorg & Schipper, Burkhard, 2003. "Can you guess the game you are playing?," Games and Economic Behavior, Elsevier, vol. 43(1), pages 137-152, April.
    11. Erhao Xie, 2019. "Monetary Payoff and Utility Function in Adaptive Learning Models," Staff Working Papers 19-50, Bank of Canada.
    12. B Kelsey Jack, 2009. "Auctioning Conservation Contracts in Indonesia - Participant Learning in Multiple Trial Rounds," CID Working Papers 35, Center for International Development at Harvard University.
    13. Isabelle Brocas & Juan D. Carrillo, 2022. "The development of randomization and deceptive behavior in mixed strategy games," Quantitative Economics, Econometric Society, vol. 13(2), pages 825-862, May.
    14. James Choi & David Laibson & Brigitte Madrain & Andrew Metrick, 2007. "Reinforcement Learning in Investment Behavior," Levine's Bibliography 122247000000001737, UCLA Department of Economics.
    15. Enkhtaivan, Bolortuya & Davaadorj, Zagdbazar, 2021. "Do they recall their past? CEOs’ liquidity policies across firms as they switch jobs," Journal of Behavioral and Experimental Finance, Elsevier, vol. 29(C).
    16. Anthony Ziegelmeyer & Frédéric Koessler & Kene Boun My & Laurent Denant-Boèmont, 2008. "Road Traffic Congestion and Public Information: An Experimental Investigation," Journal of Transport Economics and Policy, University of Bath, vol. 42(1), pages 43-82, January.
    17. DeJong, D.V. & Blume, A. & Neumann, G., 1998. "Learning in Sender-Receiver Games," Other publications TiSEM 4a8b4f46-f30b-4ad2-bb0c-1, Tilburg University, School of Economics and Management.
    18. Sergiu Hart & Andreu Mas-Colell, 2013. "A Simple Adaptive Procedure Leading To Correlated Equilibrium," World Scientific Book Chapters, in: Simple Adaptive Strategies From Regret-Matching to Uncoupled Dynamics, chapter 2, pages 17-46, World Scientific Publishing Co. Pte. Ltd..
    19. Marco LiCalzi & Roland Mühlenbernd, 2022. "Feature-weighted categorized play across symmetric games," Experimental Economics, Springer;Economic Science Association, vol. 25(3), pages 1052-1078, June.
    20. Grabisch, Michel & Rusinowska, Agnieszka, 2011. "Influence functions, followers and command games," Games and Economic Behavior, Elsevier, vol. 72(1), pages 123-138, May.

    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:comaot:v:18:y:2012:i:4:d:10.1007_s10588-011-9105-7. 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.