Norm Convergence in Populations of Dynamically Interacting Agents

Agent Based Modelling (ABM) is a methodology used to study the behaviour of norms in complex systems. Agent based simulations are capable of generating populations of heterogeneous, self-interested agents that interact with one another. Emergent norm behaviour in the system may then be understood as a result of these individual interactions. Agents observe the behaviour of their group and update their belief based on those of others. Social networks have been shown to play an important role in norm convergence. In this model agents interact on a fixed social network with members of their own social group plus a second random network that is composed of a subset of the remaining population. Random interactions are based on a weighted selection algorithm that uses an individual's path distance on the network. This means that friends-of-friends are more likely to randomly interact with one another than agents with a higher degree of separation. Using this method we investigate the effect that random interactions have on the dissemination of social norms when agents are primarily influenced by their social network. We discover that increasing the frequency and quality of random interactions results in an increase in the rate of norm convergence.

[1]  Manfred Kochen,et al.  Small World , 2002 .

[2]  Bart Verspagen,et al.  The Small worlds of Strategic Technology Alliances , 2004 .

[3]  Rino Falcone,et al.  Introduction: Agents and Norms: How to fill the gap? , 1999, Artificial Intelligence and Law.

[4]  Malik Shahzad Kaleem Awan,et al.  Gastro-Intestinal Tract Inspired Computational Paradigm , 2007 .

[5]  X. Gabaix.  Zipf's Law for Cities: An Explanation , 1999 .

[6]  Moshe Tennenholtz,et al.  On Social Laws for Artificial Agent Societies: Off-Line Design , 1995, Artif. Intell..

[7]  D. Watts.  Networks, Dynamics, and the Small‐World Phenomenon1 , 1999, American Journal of Sociology.

[8]  Jie Wu,et al.  Small Worlds: The Dynamics of Networks between Order and Randomness , 2003 .

[9]  Sandip Sen,et al.  Norm emergence under constrained interactions in diverse societies , 2008, AAMAS.

[10]  Per Bak,et al.  Small Worlds: The Dynamics of Networks between Order and Randomness, by Duncan J. Watts , 2000 .

[11]  M. Newman.  Random Graphs as Models of Networks , 2002, cond-mat/0202208.

[12]  Joel A. C. Baum,et al.  Where Do Small Worlds Come From? , 2003 .

[13]  Downloaded from , 1997 .

[14]  F. Benjamin Zhan,et al.  Shortest Path Algorithms: An Evaluation Using Real Road Networks , 1998, Transp. Sci..

[15]  Donald B. Johnson,et al.  A Note on Dijkstra's Shortest Path Algorithm , 1973, JACM.

[16]  Michael Luck,et al.  A normative framework for agent-based systems , 2006, Comput. Math. Organ. Theory.

[17]  Hazhir Rahmandad,et al.  Heterogeneity and Network Structure in the Dynamics of Diffusion: Comparing Agent-Based and Differential Equation Models , 2004, Manag. Sci..

[18]  Bastin Tony Roy Savarimuthu,et al.  Norm emergence in agent societies formed by dynamically changing networks , 2009, Web Intell. Agent Syst..

[19]  Magnus Henrekson,et al.  Bottom-Up vs. Top-Down Policies Towards the Commercialization of University Intellectual Property , 2003 .

[20]  Sandip Sen,et al.  Effects of interaction history and network topology on rate of convention emergence , 2009 .

[21]  José Manuel Galán,et al.  Techniques to Understand Computer Simulations: Markov Chain Analysis , 2009, J. Artif. Soc. Soc. Simul..

[22]  LeeJeho,et al.  Reconsideration of the Winner-Take-All Hypothesis , 2006 .

[23]  Duncan J. Watts,et al.  Collective dynamics of ‘small-world’ networks , 1998, Nature.

[24]  Jongseok Lee,et al.  Reconsideration of the Winner-Take-All Hypothesis: Complex Networks and Local Bias , 2006, Manag. Sci..

[25]  Agata Fronczak,et al.  Average path length in random networks. , 2002, Physical review. E, Statistical, nonlinear, and soft matter physics.

[26]  Mark Levene,et al.  A stochastic evolutionary growth model for social networks , 2007, Comput. Networks.

[27]  B. Bollobás.  The evolution of random graphs , 1984 .