81,132 research outputs found
Cooperation in anonymous dynamic social networks
Abstract We study the extent to which cooperative behavior can be sustained in large, anonymous, evolving social networks. Individuals strategically form relationships under a social matching protocol and engage in prisoner's dilemma interactions with their partners. We characterize a class of equilibria that support cooperation as a stationary outcome. When cooperation is possible, its level is uniquely determined. While neither community enforcement nor contagion mechanisms have force in our setting, the endogenous dynamics of the social network imply that cooperation allows an individual to gradually accumulate a large network of profitable interactions, while defection results in social marginalization. Even as players become perfectly patient, equilibrium allows for full cooperation, only autarky, or the coexistence of cooperation and defection, depending on payoffs. Smaller levels of cooperation can be sustained by a form of exclusivity among cooperators. * We than
Fashion, Cooperation, and Social Interactions
Fashion plays such a crucial rule in the evolution of culture and society
that it is regarded as a second nature to the human being. Also, its impact on
economy is quite nontrivial. On what is fashionable, interestingly, there are
two viewpoints that are both extremely widespread but almost opposite:
conformists think that what is popular is fashionable, while rebels believe
that being different is the essence. Fashion color is fashionable in the first
sense, and Lady Gaga in the second. We investigate a model where the population
consists of the afore-mentioned two groups of people that are located on social
networks (a spatial cellular automata network and small-world networks). This
model captures two fundamental kinds of social interactions (coordination and
anti-coordination) simultaneously, and also has its own interest to game
theory: it is a hybrid model of pure competition and pure cooperation. This is
true because when a conformist meets a rebel, they play the zero sum matching
pennies game, which is pure competition. When two conformists (rebels) meet,
they play the (anti-) coordination game, which is pure cooperation. Simulation
shows that simple social interactions greatly promote cooperation: in most
cases people can reach an extraordinarily high level of cooperation, through a
selfish, myopic, naive, and local interacting dynamic (the best response
dynamic). We find that degree of synchronization also plays a critical role,
but mostly on the negative side. Four indices, namely cooperation degree,
average satisfaction degree, equilibrium ratio and complete ratio, are defined
and applied to measure people's cooperation levels from various angles. Phase
transition, as well as emergence of many interesting geographic patterns in the
cellular automata network, is also observed.Comment: 21 pages, 12 figure
A Survey of Models of Network Formation: Stability and Efficiency
I survey the recent literature on the formation of networks. I provide definitions of network games, a number of examples of models from the literature, and discuss some of what is known about the (in)compatibility of overall societal welfare with individual incentives to form and sever links
Emergence of communities and diversity in social networks
Communities are common in complex networks and play a significant role in the functioning of social, biological, economic,
and technological systems. Despite widespread interest in detecting community structures in complex networks and exploring the
effect of communities on collective dynamics, a deep understanding of the emergence and prevalence of communities in social
networks is still lacking. Addressing this fundamental problem
is of paramount importance in understanding, predicting, and
controlling a variety of collective behaviors in society. An elusive question is how communities with common internal properties arise in social networks with great individual diversity. Here,
we answer this question using the ultimatum game, which has
been a paradigm for characterizing altruism and fairness. We
experimentally show that stable local communities with different
internal agreements emerge spontaneously and induce social
diversity into networks, which is in sharp contrast to populations with random interactions. Diverse communities and social
norms come from the interaction between responders with inherent heterogeneous demands and rational proposers via local connections, where the former eventually become the community
leaders. This result indicates that networks are significant in the
emergence and stabilization of communities and social diversity.
Our experimental results also provide valuable information about
strategies for developing network models and theories of evolutionary games and social dynamics.This work was supported by the National Nature Science Foundation of China under Grants 61573064, 71631002, 71401037, and 11301032; the Fundamental Research Funds for the Central Universities and Beijing Nova Programme; and the Natural Sciences and Engineering Research Council of Canada (Individual Discovery Grant). The Boston University work was supported by NSF Grants PHY-1505000, CMMI-1125290, and CHE- 1213217, and by Defense Threat Reduction Agency Grant HDTRA1-14-1-0017, and Department of Energy Contract DE-AC07-05Id14517. (61573064 - National Nature Science Foundation of China; 71631002 - National Nature Science Foundation of China; 71401037 - National Nature Science Foundation of China; 11301032 - National Nature Science Foundation of China; Fundamental Research Funds for the Central Universities and Beijing Nova Programme; Natural Sciences and Engineering Research Council of Canada (Individual Discovery Grant); PHY-1505000 - NSF; CMMI-1125290 - NSF; CHE-1213217 - NSF; HDTRA1-14-1-0017 - Defense Threat Reduction Agency; DE-AC07-05Id14517 - Department of Energy)Published versio
Degree Variance and Emotional Strategies Catalyze Cooperation in Dynamic Signed Networks
We study the problem of the emergence of cooperation in dynamic signed
networks where agent strategies coevolve with relational signs and network
topology. Running simulations based on an agent-based model, we compare results
obtained in a regular lattice initialization with those obtained on a
comparable random network initialization. We show that the increased degree
heterogeneity at the outset enlarges the parametric conditions in which
cooperation survives in the long run. Furthermore, we show how the presence of
sign-dependent emotional strategies catalyze the evolution of cooperation with
both network topology initializations.Comment: 16 Pages, Proceeding of the European Conference on Modelling and
Simumatio
Recommended from our members
Self-organizing peer-to-peer social networks
This is the author's accepted manuscript. The final published article is available from the link below. Copyright @ 2008 The Authors.Peer-to-peer (P2P) systems provide a new solution to distributed information and resource sharing because of its outstanding properties in decentralization, dynamics, flexibility, autonomy, and cooperation, summarized as DDFAC in this paper. After a detailed analysis of the current P2P literature, this paper suggests to better exploit peer social relationships and peer autonomy to achieve efficient P2P structure design. Accordingly, this paper proposes Self-organizing peer-to-peer social networks (SoPPSoNs) to self-organize distributed peers in a decentralized way, in which neuron-like agents following extended Hebbian rules found in the brain activity represent peers to discover useful peer connections. The self-organized networks capture social associations of peers in resource sharing, and hence are called P2P social networks. SoPPSoNs have improved search speed and success rate as peer social networks are correctly formed. This has been verified through tests on real data collected from the Gnutella system. Analysis on the Gnutella data has verified that social associations of peers in reality are directed, asymmetric and weighted, validating the design of SoPPSoN. The tests presented in this paper have also evaluated the scalability of SoPPSoN, its performance under varied initial network connectivity and the effects of different learning rules.National Natural Science of Foundation of Chin
Optimal Parochialism: The Dynamics of Trust and Exclusion in Networks
Networks such as ethnic credit associations, close-knit residential neighborhoods, 'old boy' networks, and ethnically linked businesses play an important role in economic life but have been little studied by economists. These networks are often supported by cultural distinctions between insiders and outsiders and engage in exclusionary practices which we call parochialism. We provide an economic analysis of parochial networks in which the losses incurred by not trading with outsiders are offset by an enhanced ability to enforce informal contracts by fostering trust among insiders. We first model one-shot social interactions among self-regarding agents, demonstrating that trust (i.e., cooperating without using information about one's trading partner) is a best response in a mixed-strategy Nash equilibrium if the quality of information about one's partner is sufficiently high. We show that since larger networks have lower quality information about specific individuals and greater trading opportunities, there may be an optimal (payoff-maximizing) network size. We then model the growth and decline of networks, as well as their equilibrium size and number. We show that in the absence of parochialism, networks may not exist, and the appropriate level of parochialism may implement an optimal network size. Finally, we explore the welfare implications and reasons for the evolutionary success of exclusion on parochial and other grounds.
Allocation Rules for Network Games
Previous allocation rules for network games, such as the Myerson Value, implicitly or explicitly take the network structure as fixed. In many situations, however, the network structure can be altered by players. This means that the value of alternative network structures (not just sub-networks) can and should influence the allocation of value among players on any given network structure. I present a family of allocation rules that incorporate information about alternative network structures when allocating value.Networks, Network Games, Allocation Rules, Cooperative Games
- …