Person: Fu, Feng
Email Address
AA Acceptance Date
Birth Date
Search Results
Publication Imitation Dynamics of Vaccination Behaviour on Social Networks
(Royal Society of London, 2011) Fu, Feng; Rosenbloom, Daniel Scholes; Wang, Longfei; Nowak, MartinThe problem of achieving widespread immunity to infectious diseases by voluntary vaccination is often presented as a public-goods dilemma, as an individual's vaccination contributes to herd immunity, protecting those who forgo vaccination. The temptation to free-ride brings the equilibrium vaccination level below the social optimum. Here, we present an evolutionary game-theoretic approach to this problem, exploring the roles of individual imitation behaviour and population structure in vaccination. To this end, we integrate an epidemiological process into a simple agent-based model of adaptive learning, where individuals use anecdotal evidence to estimate costs and benefits of vaccination. In our simulations, we focus on parameter values that are realistic for a flu-like infection. Paradoxically, as agents become more adept at imitating successful strategies, the equilibrium level of vaccination falls below the rational individual optimum. In structured populations, the picture is only somewhat more optimistic: vaccination is widespread over a range of low vaccination costs, but coverage plummets after cost exceeds a critical threshold. This result suggests parallels to historical scenarios in which vaccination coverage provided herd immunity for some time, but then rapidly dropped. Our work sheds light on how imitation of peers shapes individual vaccination choices in social networks.
Publication Reputation-Based Partner Choice Promotes Cooperation in Social Networks
(American Physical Society, 2008) Fu, Feng; Hauert, Christoph; Nowak, Martin; Wang, LongWe investigate the cooperation dynamics attributed to the interplay between the evolution of individual strategies and evolution of individual partnerships. We focus on the effect of reputation on an individual’s partner-switching process. We assume that individuals can either change their strategies by imitating their partners or adjust their partnerships based on local information about reputations. We manipulate the partner switching in two ways; that is, individuals can switch from the lowest reputation partners, either to their partners’ partners who have the highest reputation (i.e., ordering in partnership) or to others randomly chosen from the entire population (i.e., randomness in partnership). We show that when individuals are able to alter their behavioral strategies and their social interaction partnerships on the basis of reputation, cooperation can prevail. We find that the larger temptation to defect and the denser the partner network, the more frequently individuals need to shift their partnerships in order for cooperation to thrive. Furthermore, an increasing tendency of switching to partners’ partners is more likely to lead to a higher level of cooperation. We show that when reputation is absent in such partner-switching processes, cooperation is much less favored than that of the reputation involved. Moreover, we investigate the effect of discounting an individual’s reputation on the evolution of cooperation. Our results highlight the importance of the consideration of reputation (indirect reciprocity) on the promotion of cooperation when individuals can adjust their partnerships.
Publication Evolutionary Dynamics on Graphs: Efficient Method for Weak Selection
(American Physical Society, 2009) Fu, Feng; Wang, Long; Nowak, Martin; Hauert, ChristophInvestigating the evolutionary dynamics of game theoretical interactions in populations where individuals are arranged on a graph can be challenging in terms of computation time. Here, we propose an efficient method to study any type of game on arbitrary graph structures for weak selection. In this limit, evolutionary game dynamics represents a first-order correction to neutral evolution. Spatial correlations can be empirically determined under neutral evolution and provide the basis for formulating the game dynamics as a discrete Markov process by incorporating a detailed description of the microscopic dynamics based on the neutral correlations. This framework is then applied to one of the most intriguing questions in evolutionary biology: the evolution of cooperation. We demonstrate that the degree heterogeneity of a graph impedes cooperation and that the success of tit for tat depends not only on the number of rounds but also on the degree of the graph. Moreover, considering the mutation-selection equilibrium shows that the symmetry of the stationary distribution of states under weak selection is skewed in favor of defectors for larger selection strengths. In particular, degree heterogeneity—a prominent feature of scale-free networks—generally results in a more pronounced increase in the critical benefit-to-cost ratio required for evolution to favor cooperation as compared to regular graphs. This conclusion is corroborated by an analysis of the effects of population structures on the fixation probabilities of strategies in general 2×2 games for different types of graphs. Computer simulations confirm the predictive power of our method and illustrate the improved accuracy as compared to previous studies.
Publication Strategy Selection in Structured Populations
(Elsevier, 2009) Tarnita, Corina; Ohtsuki, Hisashi; Antal, Tibor; Fu, Feng; Nowak, MartinEvolutionary game theory studies frequency dependent selection. The fitness of a strategy is not constant, but depends on the relative frequencies of strategies in the population. This type of evolutionary dynamics occurs in many settings of ecology, infectious disease dynamics, animal behavior and social interactions of humans. Traditionally evolutionary game dynamics are studied in well-mixed populations, where the interaction between any two individuals is equally likely. There have also been several approaches to study evolutionary games in structured populations. In this paper we present a simple result that holds for a large variety of population structures. We consider the game between two strategies, A and B, described by the payoff matrix View the MathML source. We study a mutation and selection process. For weak selection strategy A is favored over B if and only if σa+b>c+σd. This means the effect of population structure on strategy selection can be described by a single parameter, σ. We present the values of σ for various examples including the well-mixed population, games on graphs, games in phenotype space and games on sets. We give a proof for the existence of such a σ, which holds for all population structures and update rules that have certain (natural) properties. We assume weak selection, but allow any mutation rate. We discuss the relationship between σ and the critical benefit to cost ratio for the evolution of cooperation. The single parameter, σ, allows us to quantify the ability of a population structure to promote the evolution of cooperation or to choose efficient equilibria in coordination games.