Evolutionary dynamics in finite populations with zealots

Abstract

We investigate evolutionary dynamics of two-strategy matrix games with zealots in finite populations. Zealots are assumed to take either strategy regardless of the fitness. When the strategy selected by the zealots is the same, the fixation of the strategy selected by the zealots is a trivial outcome. We study fixation time in this scenario. We show that the fixation time is divided into three main regimes, in one of which the fixation time is short, and in the other two the fixation time is exponentially long in terms of the population size. Different from the case without zealots, there is a threshold selection intensity below which the fixation is fast for an arbitrary payoff matrix. We illustrate our results with examples of various social dilemma games.

Introduction

A standard assumption underlying evolutionary game dynamics, regardless of whether a player is social agent or gene, is that players tend to imitate successful others. In actual social evolutionary dynamics, however, there may be zealous players that stick to one option according to their idiosyncratic preferences regardless of the payoff that they or their peers earn. Collective social dynamics in the presence of zealots started to be examined for non-game situations such as the voter model representing competition between two equally strong opinions (i.e., neutral invasions) (Mobilia 2003; Galam and Jacobs 2007; Mobilia et al. 2007; Xie et al. 2011; Singh et al. 2012). Zealots seem to be also relevant in evolutionary game dynamics. For example, voluntary immunization behavior of individuals when epidemic spreading possibly occurs in a population can be examined by a public-goods dilemma game (Fu et al. 2011). In this situation, some individuals may behave as zealot such that they try to immunize themselves regardless of the cost of immunization (Liu et al. 2012).

In our previous work, we examined evolutionary dynamics of the prisoner’s dilemma and snowdrift games in infinite populations with zealots (Masuda 2012). Specifically, we assumed zealous cooperators and asked the degree to which the zealous cooperators facilitate cooperation in the entire population. We showed that cooperation prevails if the temptation of unilateral defection is weak or the selection strength is weak. For the prisoner’s dilemma, we analytically obtained the condition of cooperation.

In the present paper, we conduct a finite population analysis of evolutionary dynamics of a general two-person game with zealots. Evolutionary games in finite populations have been recognized as a powerful analytical tool for understanding properties of evolutionary games such as conditions of cooperation in social dilemma games. In addition, the outcome for finite populations is often different from that for infinite populations (Nowak et al. 2004; Taylor et al. 2004; Nowak 2006). We take advantage of this method to understand evolutionary dynamics of games with zealots for general matrix games.

It should be noted that the fixation probability, i.e., the probability that a given strategy eventually dominates the population as a result of stochastic evolutionary dynamics, is a primary quantity to be pursued in evolutionary dynamics in finite populations. Nevertheless, fixation trivially occurs in the presence of zealots if all zealots are assumed to take the same strategy; the zealots’ strategy always fixates. For example, if there is a single zealous cooperator in the population, cooperation always fixates even in the conventional prisoner’s dilemma game. However, in this adverse case, fixation of cooperation is expected to take long time; the relevant question here is the fixation time (Antal and Scheuring 2006; Traulsen et al. 2007; Altrock and Traulsen 2009; Altrock et al. 2010; Assaf and Mobilia 2010; Ewens 2010; Wu et al. 2010; Altrock et al. 2011; Assaf and Mobilia 2012; Kreindler and Young 2013). Here we examine the mean fixation time of the strategy selected by the zealots. This quantity serves as a probe to understand the extent to which zealots influence non-zealous players in the population. The fixation time would be affected by the payoff matrix, population size, number of zealous players, and strength of selection. We derive the asymptotic dependence of the mean fixation time on the population size when the fraction of zealots in the population is fixed. Mathematically, we extend the approach taken in Antal and Scheuring (2006) to the case with zealots.

Model

We assume a well-mixed population of $N+M$ players under evolutionary dynamics defined as follows. In each discrete time unit, each player selects either of the two strategies $A$ or $B$. Each player plays a symmetric two-person game with all the other $N+M-1$ players in a unit time. The payoff matrix of the single game for the row player is given by

1

The fitness of a player on which the selection pressure operates is defined as the payoff summed over the $N+M-1$ opponents.

We assume that $N$ players may flip the strategy according to the Moran process (Moran 1958; Ewens 2010). We call these players the ordinary players. The other $M$ players are zealots that never change the strategy irrespectively of their fitness. Because our primary interest is in the possibility of cooperation in social dilemma games induced by zealous cooperators, we assume that all zealots take strategy $A$; $A$ is identified with cooperation in the case of a social dilemma game. We also assume that $a,b,c,d\ge 0$ for the Moran process to be well-defined.

Because we have assumed a well-mixed population, the state of the evolutionary process is specified by the number of ordinary players selecting $A$, which we denote by $i$. In each time step, we select an ordinary player with the equal probability $1/N$. The strategy of the selected player is updated. Then, we select a player, called the parent, whose strategy replaces that of the previously selected player. The parent is selected with the probability proportional to the fitness among the $N+M$ players including the zealots and the player whose strategy is to be replaced. The population size $N$ is constant over time. It should be noted that a player is updated once on average in time $N$.

Because the zealots always select $A$, the Moran process ends up with the unanimous population of $A$ players (we impose $a>0$ for this to be true). In other words, fixation of $A$ always occurs such that the issue of fixation probability is irrelevant to our model.

Results

We calculate the mean fixation time and its approximation in the case of a large population size by extending the framework developed in Antal and Scheuring (2006) (also see Van Kampen 2007; Redner 2001; Krapivsky et al. 2010; Ewens 2010).

Mean fixation time: exact solution

Consider the state of the population in which $i$ ($0\le i\le N$) ordinary players select strategy $A$. A total of $i+M$ and $N-i$ players, including the zealots, select strategies $A$ and $B$, respectively. The Moran process is equivalent to a random walk on the $i$ space in which $i=0$ is a reflecting boundary, and $i=N$ is the unique absorbing boundary.

The fitness of an $A$ and $B$ player is given by

$$\begin{array}{c}\hfill f_i=\frac{(i+M-1)a+(N-i)b}{N+M-1}\end{array}$$ 2

and

$$\begin{array}{c}\hfill g_i=\frac{(i+M)c+(N-i-1)d}{N+M-1},\end{array}$$ 3

respectively. In a single time step, $i$ increases by one, does not change, or decreases by one. We denote by $T_i^{+}$ and $T_i^{-}$ the probabilities that $i$ shifts to $i+1$ and $i-1$, respectively. These probabilities are given by

$$\begin{array}{c}\hfill T_i^{+}=\frac{N-i}{N}\frac{(i+M)f_i}{(i+M)f_i+(N-i)g_i}\end{array}$$ 4

and

$$\begin{array}{c}\hfill T_i^{-}=\frac{i}{N}\frac{(N-i)g_i}{(i+M)f_i+(N-i)g_i}.\end{array}$$ 5

We denote by $t_i$ the mean fixation time when there are initially $i$ ordinary players with strategy $A$. As shown in Ewens (2010), pp. 86–91 (see Appendix A for a full derivation), we obtain

$$\begin{array}{c}\hfill t_i=\sum _{j=i}^{N-1}{q}_j\sum _{k=0}^j\frac{1}{T_k^{+}{q}_k},\end{array}$$ 6

where

$$\begin{array}{c}\hfill q_k=\prod _{j=1}^k\frac{T_j^{-}}{T_j^{+}}.\end{array}$$ 7

In Eq. (7), we interpret $q_0=1$.

Deterministic approximation of the random walk

In this section we classify the deterministic dynamics driven by the expected bias of the random walk (i.e., $T_i^{+}-T_i^{-}$) into three cases, as is done in the analysis of populations without zealots (Taylor et al. 2004; Antal and Scheuring 2006). The obtained classification determines the dependence of the mean fixation time on $N$, as we will show in Sect. 3.3.

We first identify the equilibrium points of the deterministic dynamics, i.e., $i$ satisfying $T_i^{+}=T_i^{-}$. Equations (4) and (5) indicate that $i=N$ always yields $T_i^{+}=T_i^{-}=0$, corresponding to the fact that $i=N$ is the unique absorbing state. Other equilibria are derived from

$$\begin{array}{c}\hfill (i+M)\left[(i+M-1)a+(N-i)b\right]-i\left[(i+M)c+(N-i-1)d\right]=0.\end{array}$$ 8

We set $y\equiv i/N$ ($0\le y<1$), $m\equiv M/N$, and ignore $O(N^{-1})$ terms in Eq. (8) to obtain

$$\begin{array}{c}\hfill f(y)\equiv (a-b-c+d)y^2+\left[2ma+(1-m)b-mc-d\right]y+m^{2}a+mb=0.\\ \hfill \end{array}$$ 9

We define

$$\begin{array}{cc}\hfill \tilde{y}& =-\frac{1}{2(a-b-c+d)}\left[2ma+\left(1-m\right)b-mc-d\right],\hfill \end{array}$$ 10

$$\begin{array}{cc}\hfill D& ={\left[2ma+(1-m)b-mc-d\right]}^2-4m(ma+b)(a-b-c+d),\hfill \end{array}$$ 11

$$\begin{array}{cc}\hfill y_1^{\ast }& =\left\{\begin{array}{cc}\tilde{y}-\frac{\sqrt{D}}{2(a-b-c+d)}\hfill & (a-b-c+d\ne 0),\hfill \\ -\frac{m(ma+b)}{2ma+(1-m)b-mc-d}\hfill & (a-b-c+d=0),\hfill \end{array}\right.\hfill \end{array}$$ 12

and

$$\begin{array}{cc}\hfill y_2^{\ast }=& \tilde{y}+\frac{\sqrt{D}}{2(a-b-c+d)}.\hfill \end{array}$$ 13

We will use $y_2^{\ast }$ only when $a-b-c+d>0$. In the continuous state limit, the deterministic dynamics driven by $T_i^{+}-T_i^{-}$ is classified into the following three cases, as summarized in Table 1. The derivation is shown in Appendix B.

• Case (i)
  : $f(y)>0$ holds true for all $y$ ($0\le y\le 1$) such that the dynamics starting from any initial condition tends to $y=1$ (Fig. 1a). In an infinite population, $A$ dominates $B$. In a finite population, we expect that the fixation time is short. This case occurs when $c<(m+1)a$ and one of the following conditions is satisfied:

  • $a-b-c+d\le 0$.
  • $a-b-c+d>0$ and $y_1^{\ast }\le 0$ (i.e., $2ma+(-m+1)b-mc-d\ge 0$).
  • $a-b-c+d>0$, $0<y_1^{\ast }<1$ (i.e., $2ma+(-m+1)b-mc-d<0$ and $-(2m+2)a+(m+1)b+(m+2)c-d<0$), and $D\le 0$.
  • $a-b-c+d>0$ and $y_1^{\ast }\ge 1$ (i.e., $-(2m+2)a+(m+1)b+(m+2)c-d\ge 0$).
• Case(ii)

  : $f(y)=0$ has a unique solution $y_1^{\ast }$ ($0<y_1^{\ast }<1$) such that the dynamics starting from any initial condition converges to $y_1^{\ast }$ (Fig. 1b). In an infinite population, $A$ and $B$ coexist. In a finite population, we expect that the fixation time is long. This case occurs when $c>(m+1)a$.

• Case (iii)
  : $f(y)=0$ has two solutions $0<y_1^{\ast }<y_2^{\ast }<1$. Dynamics starting from $0\le y<y_2^{\ast }$ converges to $y_1^{\ast }$, and that starting from $y_2^{\ast }<y<1$ converges to $y=1$ (Fig. 1c). In an infinite population, a mixture of $A$ and $B$ and the pure $A$ configuration are bistable. In a finite population, we expect that the fixation time is long if the dynamics starts with $0\le y<y_2^{\ast }$ and short if it starts with $y_2^{\ast }<y<1$. This case occurs when

  $$\begin{array}{cc}& c<(m+1)a,\hfill \end{array}$$ 14

  $$\begin{array}{cc}& a-b-c+d>0,\hfill \end{array}$$ 15

  $$\begin{array}{cc}& 0<\tilde{y}<1,\hfill \end{array}$$ 16

  and

  $$\begin{array}{c}\hfill D>0\end{array}$$ 17

  are satisfied.

Table 1.

Classification of the three cases of the mean fixation time when $N$ is large

	$a-b-c+d\le 0$	$a-b-c+d>0$
$c<(m+1)a$	Case (i)	Case (i) or (iii)
$c>(m+1)a$	Case (ii)	Case (ii)

Fig. 1.

Schematic classification of the deterministic dynamics driven by $T_i^{+}-T_i^{-}$. a–c Populations with zealots. d–g Populations without zealots. Filled and open circles represent stable and unstable equilibria, respectively. Filled squares represent the absorbing boundary condition. It should be noted that we identify $y=i/N$

The condition given by Eq. (14) is related to the so-called cooperation facilitator assumed in a previous model (Mobilia 2012) as follows. Consider a hypothetical infinite population in which almost all players select $A$, i.e., $y\approx 1$. Then, the payoff that a player with strategy $A$ gains by being matched with the other ordinary players and zealous players is equal to $(m+1)a$. The payoff that a player with strategy $B$ gains by being matched with the other ordinary players, but not zealous players, is equal to $c$. Therefore, Eq. (14) represents the condition for the stability of the homogeneous population of strategy $A$ against invasion by $B$ when zealous players somehow contribute to the payoff of ordinary $A$ players and not to that of ordinary $B$ players. Such a zealous player is equivalent to the cooperation facilitator assumed in  Mobilia (2012).

In the corresponding model without zealots, there are four scenarios: $A$ dominates $B$ (Fig. 1d), $B$ dominates $A$ (Fig. 1e), a mixture of $A$ and $B$ is stable (Fig. 1f), and $A$ and $B$ are bistable (Fig. 1g) (Antal and Scheuring 2006). The cases shown in Fig. 1d, f, and g are analogous to cases (i), (ii), and (iii), respectively, for the game with zealots. The case shown in Fig. 1e never occurs in the game with zealots because $y$ tends to increase in the absence of $A$ owing to the fact that unanimity of $B$ among the ordinary players is a reflecting boundary of our model. In fact, this case corresponds to case (ii) for the presence of zealots (Fig. 1b). If we set $m\to 0$, we obtain case (i) when $a-c>0$ and $b-d>0$, case (ii) when $a-c<0$, and case (iii) when $a-c>0$ and $b-d<0$. As is consistent with Antal and Scheuring (2006), the classification depends only on the $a-c$ and $b-d$ values. However, the scenario in which $B$ dominates $A$ (Fig. 1e) does not happen even with the vanishing density of zealots (i.e., $m\to 0$) because the unanimity of $B$ remains to be a reflecting boundary as long as there is at least one zealot.

Mean fixation time: large $N$ limit

In this section, we analyze the order of the mean fixation time in terms of $N$ when $N$ is large. We assume that the fraction of zealots in the population, i.e., $m=M/N$, is fixed. Because the mean fixation time is by definition the largest for $i=0$, i.e., the initial condition in which all ordinary players select $B$, we focus on $t_0$. To evaluate $t_0$, we rewrite Eq. (6) for $i=0$ as

$$\begin{array}{c}\hfill t_0=\sum _{k=0}^{N-1}\frac{1}{T_k^{+}{q}_k}\sum _{j=k}^{N-1}{q}_j.\end{array}$$ 18

Case (i)

We obtain

$$\begin{array}{c}\hfill \frac{T_i^{-}}{T_i^{+}}=1-\frac{Nf(i/N)}{(i+M)[(i+M-1)a+(N-i)b]},\end{array}$$ 19

where $f(y)$ ($0\le y<1$) is given by Eq. (9). In case (i), $f(y)>0$ holds true. Therefore,

$$\begin{array}{cc}\hfill \frac{T_i^{-}}{T_i^{+}}\le & \underset{0\le y<1}{sup}\left\{1-\frac{f(y)}{(y+m)[(y+m)a+(1-y)b]}\right\}\hfill \\ \hfill \equiv & \mathit{\epsilon }<1\hfill \end{array}$$ 20

is satisfied for $0\le i\le N-1$. By using Eq. (20), we obtain

$$\begin{array}{c}\hfill \frac{1}{q_k}\sum _{j=k}^{N-1}{q}_j=\sum _{j=k}^{N-1}\prod _{\ell =k+1}^j\frac{T_{\ell }^{-}}{T_{\ell }^{+}}\le \sum _{j=k}^{N-1}{\mathit{\epsilon }}^{(j-k-1)}\le \frac{1}{\mathit{\epsilon }}\frac{1}{1-\mathit{\epsilon }}.\end{array}$$ 21

Because the left-hand side of Eq. (21) is at least unity, we obtain

$$\begin{array}{c}\hfill t_0\propto \sum _{k=0}^{N-1}\frac{1}{T_k^{+}}.\end{array}$$ 22

The substitution of $y=i/N$ and $m=M/N$ in Eq. (4) yields

$$\begin{array}{c}\hfill \frac{1}{T_i^{+}}=\frac{1}{1-y}+\frac{(y+m)c+(1-y)d}{(y+m)\left[(y+m)a+(1-y)b\right]}.\end{array}$$ 23

In particular, we obtain

$$\begin{array}{c}\hfill \frac{1}{T_i^{+}}\approx \frac{1}{1-y}(y\approx 1).\end{array}$$ 24

Equation (24) implies that

$$\begin{array}{c}\hfill t_0\propto NlnN.\end{array}$$ 25

This result coincides with the previous result for the absence of zealots (Antal and Scheuring 2006).

Case (ii)

In Case (ii), $T_i^{+}-T_i^{-}>0$ for $0\le i<N{y}_1^{\ast }$ and $T_i^{+}-T_i^{-}<0$ for $N{y}_1^{\ast }<i<N$. Therefore, $q_i$ takes the minimum at $i\approx N{y}_1^{\ast }$. We denote the value of $i$ that satisfies $i<N{y}_1^{\ast }$ and $q_i\approx q_{N-1}$ by $i^{\ast }$. Such an $i^{\ast }$ exists if $q_0\ge q_{N-1}$. If $q_0<q_{N-1}$, we regard that $i^{\ast }=0$. Using the relationship $q_i={\left[\tilde{q}(i/N)\right]}^N$ for a function $\tilde{q}(y)$ ($0\le y<1$) (Antal and Scheuring 2006) (also see Appendix C), we obtain

$$\begin{array}{cc}\hfill t_0=& \sum _{k=0}^{N-1}\frac{1}{T_k^{+}{q}_k}\sum _{j=k}^{N-1}{q}_j\hfill \\ \hfill \sim & \sum _{k=0}^{N-1}\frac{1}{T_k^{+}{q}_k}max\{q_k,q_{N-1}\}\hfill \\ \hfill \sim & \sum _{k=i^{\ast }}^{N-1}\frac{q_{N-1}}{q_k}\hfill \\ \hfill \sim & \sqrt{N}{\left[\frac{\tilde{q}(1)}{\tilde{q}(y^{\ast })}\right]}^N,\hfill \end{array}$$ 26

where

$$\begin{array}{c}\hfill \tilde{q}(y^{\ast })=\underset{0\le y<1}{min}\tilde{q}(y).\end{array}$$ 27

To derive the last line in Eq. (26), we used the steepest descent method (Antal and Scheuring 2006) (also see Appendix D).

Equations (23) and (24) imply that $1/T_k^{+}$ in Eq. (26) is safely ignored near the singularity at $y\approx 1$ because it would contribute at most $\propto NlnN$ to the fixation time. Therefore, we obtain

$$\begin{array}{c}\hfill t_0\propto \sqrt{N}exp(\mathit{\gamma }N),\end{array}$$ 28

where $\mathit{\gamma }>0$ is a constant that depends on $a,b,c,d$, and $m$. The dependence of $\mathit{\gamma }$ on $m$ is shown in Fig. 2 for sample payoff matrices for the prisoner’s dilemma game (solid line) and snowdrift game (dotted line). For both games, $\mathit{\gamma }$ monotonically decreases with $m$, implying that the fixation time decreases with $m$. In particular, $\mathit{\gamma }$ is equal to zero, which corresponds to $t_0\propto NlnN$, when $m$ is larger than a threshold value.

Fig. 2.

The exponent $\mathit{\gamma }$ for the mean fixation time [Eq. (28)] plotted against the density of zealots $m$ for the prisoner’s dilemma game with $a=1$, $b=0$, $c=1.2$, and $d=0$ (solid line) and the snowdrift game with $a=\mathit{\beta }-0.5$, $b=\mathit{\beta }$, $c=\mathit{\beta }-1$, $d=0$, with $\mathit{\beta }=1.5$ (dotted line). We calculated $\mathit{\gamma }$ on the basis of Eqs. (26), (27), and (55)

Case (iii)

In this case, $q_i$ takes a local minimum at $i=N{y}_1^{\ast }$ and a local maximum at $i=N{y}_2^{\ast }$. Therefore, behavior of the random walk in the range $0\le i<N{y}_2^{\ast }$ is qualitatively the same as that for case (ii), and that in the range $N{y}_2^{\ast }<i<N$ is qualitatively the same as that for case (i). Because the former part makes the dominant contribution to the fixation time, the scaling of the mean fixation time is given by Eq. (28).

Case (iii) occurs when strategy $A$ is disadvantageous when it is rare and advantageous when it is frequent. The coordination game provides such an example (Sect. 5.4).

Summary and the borderline case

In summary, the mean fixation time in the limit of large $N$ is given by $t_0\propto NlnN$ in case (i) and $t_0\propto \sqrt{N}exp(\mathit{\gamma }N)$ ($\mathit{\gamma }>0$) in cases (ii) and (iii). For the parameter values on the boundary between the two scaling regimes, the same arguments as those for the model without zealots (Antal and Scheuring 2006) lead to $t_0\propto N^{3/2}$.

Dependence of the mean fixation time on the selection strength

We examine the influence of the selection strength, denoted by $w$, on the mean fixation time. To this end, we redefine the fitness to an $A$ and $B$ player by $1-w+w{f}_i$ and $1-w+w{g}_i$, respectively, where $f_i$ and $g_i$ are given by Eqs. (2) and (3) (e.g., Nowak et al. 2004; Nowak 2006). Consequently, we replace the payoff matrix given by Eq. (1) by

29

Equation (1) is reproduced with $w=1$.

For sufficiently weak selection, we obtain $t_0\propto NlnN$, i.e., case (i), regardless of the payoff matrix. To prove this statement, we note that, by using the payoff matrix shown in Eq. (29), condition $c<(m+1)a$ in the case of $w=1$ is generalized to

$$\begin{array}{c}\hfill c<(m+1)a+m\left(\frac{1}{w}-1\right).\end{array}$$ 30

Therefore, if the original game in the case of $w=1$ belongs case (ii), i.e., $c>(m+1)a$, the game belongs to case (i) or (iii) (Table 1) if Eq. (30), or equivalently,

$$\begin{array}{c}\hfill w<w_1\equiv \frac{m}{c-(m+1)a+m}\end{array}$$ 31

is satisfied. For a fixed payoff matrix, $w_1$ monotonically increases with $m$, consistent with the intuition that existence of zealots would lessen the fixation time.

Next, the sign of $a-b-c+d$ is not affected by the selection strength. Therefore, we assume $a-b-c+d>0$ and prove that a condition for case (iii), i.e., Eq. (17), is violated with a sufficiently small $w$. Because the value of $\tilde{y}$ given by Eq. (10) is also unaffected by $w$, we start with assuming $0<\tilde{y}<1$, which is a necessary condition for case (iii) [Eq. (16); see Appendix B]. The condition $D<0$ in the case of $w=1$, where $D$ is defined by Eq. (11), is generalized to

$$\begin{array}{c}\hfill wD-4(1-w)m(m+1)(a-b-c+d)<0.\end{array}$$ 32

Because the condition imposed on $D$, which distinguishes cases (i) and (iii), is relevant only for $a-b-c+d>0$ (Table 1), Eq. (32) is satisfied for an arbitrary payoff matrix if

$$\begin{array}{c}\hfill w<w_2\equiv \frac{4m(m+1)(a-b-c+d)}{D+4m(m+1)(a-b-c+d)}.\end{array}$$ 33

Therefore, case (iii) is excluded with a sufficiently small $w$ value.

The threshold value of $w$ below which $t_0\propto NlnN$, which we denote by $w_{\mathrm{c}}$, is given by

$$\begin{array}{c}\hfill w_{\mathrm{c}}=\left\{\begin{array}{cc}min\{w_1,w_2,1\}\hfill & (w_1>0,w_2>0),\hfill \\ min\{w_1,1\}\hfill & (w_1>0,w_2<0),\hfill \\ min\{w_2,1\}\hfill & (w_1<0,w_2>0),\hfill \\ 1\hfill & (w_1<0,w_2<0).\hfill \end{array}\right.\end{array}$$ 34

We can alternatively introduce the selection strength by replacing Eqs. (2) and (3) to redefine the fitness by

$$\begin{array}{c}\hfill f_i=exp\left[\mathit{\beta }\frac{(i+M-1)a+(N-i)b}{N+M-1}\right]\end{array}$$ 35

and

$$\begin{array}{c}\hfill g_i=exp\left[\mathit{\beta }\frac{(i+M)c+(N-i-1)d}{N+M-1}\right],\end{array}$$ 36

where $\mathit{\beta }$ is the selection strength (Traulsen et al. 2008). In Appendix E, we show that qualitatively the same result holds true in the sense that there is a threshold value of $\mathit{\beta }$ below which the fixation is fast irrespective of the $a$, $b$, $c$, $d$, and $m$ values. It should be noted that, with Eqs. (35) and (36), $a$, $b$, $c$, and $d$ are allowed to take negative values.

Examples

We compare the mean fixation time for some games with that for the neutral game, i.e., $a=b=c=d>0$. In the absence of zealots, the neural game yields $T_i^{+}=T_i^{-}$ ($1\le i\le N-1$). The random walk is unbiased, and the so-called mean conditional fixation time is equal to $N(N-1)$ (Antal and Scheuring 2006). The mean conditional fixation time is defined as the mean fixation time starting from state $i=1$ under the condition that the absorbing state at $i=N$, not $i=0$, is reached.

The neutral game in the presence of zealots yields $T_0^{+}>T_0^{-}=0$ and $T_i^{+}/T_i^{-}=(i+M)/i$ ($1\le i\le N-1$). Therefore, the random walk is biased toward $i=N$ for all $i$. More precisely, we obtain

$$\begin{array}{c}\hfill t_0=N(N+M)\sum _{0\le k\le i\le N-1}\frac{i!(k+M)!}{k!(i+M)!}\frac{1}{(N-i)(i+M)}.\end{array}$$ 37

As in Antal and Scheuring (2006), we say that fixation is fast (slow) if $t_0$ is smaller (larger) than the value given by Eq. (37). It should be noted that $t_0\propto NlnN$ for the neutral game because it corresponds to $w=0<w_{\mathrm{c}}$.

Constant selection

As a first example, consider the case of frequency-independent selection such that $A$ and $B$ are equipped with fitness $r$ and 1 (under $w=1$), respectively. When $a=b=r$ and $c=d=1$, the threshold selection strength below which $t_0\propto NlnN$, i.e., case (i), holds true is given by

$$\begin{array}{c}\hfill w_{\mathrm{c}}=\left\{\begin{array}{cc}\frac{m}{(m+1)(1-r)}\hfill & \left(r\le \frac{1}{m+1}\right),\hfill \\ 1\hfill & \left(r\ge \frac{1}{m+1}\right).\hfill \end{array}\right.\end{array}$$ 38

If $w>w_{\mathrm{c}}$, case (ii) occurs. Even if $A$ is disadvantageous to $B$, $A$ fixates fast with the help of zealots regardless of the selection strength if $1/(m+1)<r<1$. This condition is more easily satisfied when $m$ is larger.

Prisoner’s dilemma game

Consider the prisoner’s dilemma game with a standard payoff matrix given by $a=1$, $b=0$, $c=T$, and $d=0$, where $T>1$. Strategies $A$ and $B$ represent cooperation and defection, respectively. It should be noted that $a-b-c+d<0$. With a general selection strength, the conditions derived in Sect. 3.2 imply that $t_0\propto NlnN$, i.e., case (i), if $T<1+m/w$, and $t_0\propto \sqrt{N}exp(\mathit{\gamma }N)$ with case (ii) if $T>1+m/w$. This condition coincides with that for the dominance of cooperators in the case of the infinite population (Masuda 2012).

The mean fixation time with $w=1$ and $m=0.2$ obtained by direct calculations of Eq. (18) is shown in Fig. 3a. In this and the following figures, the $t_0$ values are those normalized by that for the neutral game [Eq. (37)]. The behavior of $t_0$ is qualitatively different according to whether $T$ is larger or smaller than $1+m/w=1.2$. If $T<1.2$, the ratio of $t_0$ for the prisoner’s dilemma game to $t_0$ for the neutral game seems to approach a constant as $N\to \infty$. This is consistent with case (i). In contrast, if $T>1.2$, $t_0$ grows rapidly, which is consistent with case (ii). To be more quantitative, $400\sqrt{N}exp(\mathit{\gamma }N)$ divided by the $t_0$ value for the neutral game is shown by the dashed line in Fig. 3a. It should be noted that 400 is a constant for fitting and that $\mathit{\gamma }$ value is theoretically determined as described in Sect. 3.3.2. The theory (dashed line) agrees well with the exact numerical results (thinnest solid line). We remark that the normalized $t_0$ behaves non-monotonically in $N$; it takes a minimum at an intermediate value of $N$.

Fig. 3.

The normalized mean fixation time for the prisoner’s dilemma game as a function of $N$. We set $a=1$, $b=0$, $c=T$, and $d=0$. In a, we set $m=0.2$ and $w=1$. In b, we set $T=1.2$ and $m=0.1$. In c, we set $T=1.2$ and $w=1$. The dashed lines represent $400\sqrt{N}exp(\mathit{\gamma }N)$ divided by the $t_0$ value for the neutral game

Next, to examine the effect of the selection strength, we set $T=1.2$ and $m=0.1$. The mean fixation time as a function of $N$ and $w$ is shown in Fig. 3b. Equation (34) implies that $t_0\propto NlnN$ when $w<w_{\mathrm{c}}=0.5$. Consistent with this result, $t_0$ grows fast as a function of $N$ when $w$ is large (i.e., $w=0.7$ and 1). In particular, for $w=1$, $400\sqrt{N}exp(\mathit{\gamma }N)$ normalized by the $t_0$ value for the neutral game (dashed line in Fig. 3b) agrees well with the exact results (thin solid line). For small $w$ (i.e., $w=0.4$), $t_0$ seems to scale with $NlnN$ (thick solid line).

Figure 3c shows the dependence of $t_0$ on $N$ for different densities of zealots (i.e., $m$). It should be noted that the baseline $t_0$ value derived from the neutral game depends on the value of $m$. Because we set $T=1.2$ and $w=1$ in Fig. 3c, the threshold value of $m$ is equal to 0.2. In fact, the normalized $t_0$ diverges according to $\propto \sqrt{N}exp(\mathit{\gamma }N)$ when $m=0.1$ (dashed line and thick solid line), whereas it seems to converge to a constant value when $m=0.3$ (thin solid line).

Figure 3 indicates that $t_0$ for the prisoner’s dilemma game is always larger than that for the neutral game (i.e., the normalized $t_0$ is larger than unity). This is consistent with the intuition that cooperation is difficult to attain in the prisoner’s dilemma game as compared to the neutral game.

Finally, consider the symmetrized donation game, which is another standard form of the prisoner’s dilemma game, given by $a=b^{\prime }-c^{\prime }$, $b=-c^{\prime }$, $c=b^{\prime }$, and $d=0$, where $b^{\prime }$ is the benefit, and $c^{\prime }(<b^{\prime })$ is the cost. For the Moran process to be well-defined, we require $1-w+wb\ge 0$, i.e., $w<1/(1+c^{\prime })$. For this payoff matrix, we obtain

$$\begin{array}{c}\hfill w_{\mathrm{c}}=\left\{\begin{array}{cc}\frac{m}{m-b^{\prime }+(1+m)c^{\prime }}\hfill & \left(\frac{b^{\prime }}{c^{\prime }}\le \frac{m+1}{m}\right),\hfill \\ 1\hfill & \left(\frac{b^{\prime }}{c^{\prime }}\ge \frac{m+1}{m}\right).\hfill \end{array}\right.\end{array}$$ 39

Fixation occurs fast for a large benefit-to-cost ratio, large $m$, or small selection strength.

Snowdrift game

In this section, we examine the snowdrift game (Maynard Smith 1982; Sugden 1986; Hauert and Doebeli 2004) defined by $a=\mathit{\beta }-0.5$, $b=\mathit{\beta }-1$, $c=\mathit{\beta }$, and $d=0$, where $\mathit{\beta }>1$. Strategies $A$ an $B$ are identified as cooperation and defection, respectively. Each player is tempted to defect if the other player cooperates, as in the prisoner’s dilemma game. However, different from the prisoner’s dilemma game, a player is better off by cooperating if the partner defects; mutual defection is the worst outcome. In the infinite well-mixed population without zealots, the game has the unique mixed Nash equilibrium in which the fraction of cooperation is equal to $(2\mathit{\beta }-2)/(2\mathit{\beta }-1)$.

Numerical evidence for the replicator dynamics, corresponding to an infinite population, suggests that cooperation is dominant if $m$ is large or $w$ is small (Masuda 2012). For the finite population, we obtain

$$\begin{array}{c}\hfill w_{\mathrm{c}}=\left\{\begin{array}{cc}\frac{2m}{3m-2m\mathit{\beta }+1}\hfill & \left(\mathit{\beta }\le \frac{m+1}{2m}\right),\hfill \\ 1\hfill & \left(\mathit{\beta }\ge \frac{m+1}{2m}\right).\hfill \end{array}\right.\end{array}$$ 40

If $w<w_{\mathrm{c}}$, we obtain $t_0\propto NlnN$, i.e., case (i). If $w>w_{\mathrm{c}}$, we obtain $t_0\propto \sqrt{N}exp(\mathit{\gamma }N)$ with case (ii). A large value of $\mathit{\beta }$ or $m$ makes the fixation time smaller. This result makes sense because a large $\mathit{\beta }$ generally favors cooperation.

Coordination game

The coordination game given by $a=d>0$ and $b=c=0$ has two pure Nash equilibria in the infinite well-mixed population without zealots. For a finite population in the presence of zealots, Eq. (34) yields

$$\begin{array}{c}\hfill w_{\mathrm{c}}=\left\{\begin{array}{cc}\frac{8m(m+1)}{a(-4m^2-4m+1)+8m(m+1)}\hfill & \left(0\le m\le \frac{\sqrt{2}-1}{2}\right),\hfill \\ 1\hfill & \left(\frac{\sqrt{2}-1}{2}\le m\le 1\right).\hfill \end{array}\right.\end{array}$$ 41

If $w<w_{\mathrm{c}}$, we obtain $t_0\propto NlnN$, i.e., case (i). It should be noted that any strength of selection $0\le w\le 1$ yields $t_0\propto NlnN$ if there are sufficiently many zealots, similar to the game with constant selection, prisoner’s dilemma game, and snowdrift game. If $w>w_{\mathrm{c}}$, we obtain $t_0\propto \sqrt{N}exp(\mathit{\gamma }N)$ with case (iii).

The mean first-passage time from state 0 (i.e., all ordinary players select $B$) to state $i$, i.e., ${\sum }_{j=0}^{i-1}{\mathit{\sigma }}_j$, is shown in Fig. 4. It should be noted that $t_0$ is equal to this first-passage time to exit $i=N$. We set $N=200$, $a=d=1$, $b=c=0$, $m=0.2$, and $w=1$. Equation (41) implies $w_{\mathrm{c}}=48/49$ for these parameter values. Because $w=1>w_{\mathrm{c}}$, we obtain case (iii).

Fig. 4.

Mean first-passage time for the coordination game. We set $N=200$, $a=d=1$, $b=c=0$, $m=0.2$, and $w=1$

The first-passage time increases slowly as $i$ increases when $i$ is small. It rapidly increases with $i$ for intermediate values of $i$, Once the random walker passes the critical $i$ value, it feels a positive bias such that the first-passage time only gradually increases with $i$ for large $i$. The values of $i$ that separate the three regimes are roughly consistent with the analytical estimates $y_1^{\ast }=0.1$ and $y_2^{\ast }=0.2$ [Eqs. (12), (13)]. It should be noted that the first-passage time shows representative behavior of case (iii) although $w$ is only slightly larger than $w_{\mathrm{c}}$.

Discussion

We extended the results for the fixation time under the Moran process (Antal and Scheuring 2006) to the case of a population with zealous players. Similar to the case without zealots (Antal and Scheuring 2006), we identified three regimes in terms of the payoff matrix, number of zealots, and selection strengths. In one regime, the fixation time is small (i.e., $\propto NlnN$). In the other two regimes, it is large (i.e., $\propto \sqrt{N}exp(\mathit{\gamma }N)$ with $\mathit{\gamma }>0$). We illustrated our results with representative games including the prisoner’s dilemma game, snowdrift game, and coordination game.

Zealots have several impacts on evolutionary dynamics in finite populations. First, fixation of one strategy $A$ always occurs with zealots because we assumed that all zealots permanently take $A$. Second, there is a case in which fixation is fast if the fraction of $A$ players is sufficiently large, whereas fixation is slow if the fraction of $A$ is small. This scenario occurs for the coordination game. In the absence of zealots, the same game shows bistability such that the fixation to the unanimity of $A$ or that of $B$ occurs fast (Antal and Scheuring 2006). Third, for a selection strength smaller than a threshold value, the fixation is fast for any payoff matrix. In the absence of zealots, the dependence of the mean fixation time on $N$ for large $N$ values is completely determined by the signs of $a-c$ and $b-d$ (Antal and Scheuring 2006). Therefore, the scaling of the mean fixation time on $N$ is independent of the selection strength because manipulating the selection strength does not change the sign of the effective $a-c$ or $b-d$ value. If the payoff matrix is given in the slow fixation regime, the fixation is exponentially slow even for a small selection strength. In contrast, in the presence of zealots, slow fixation can be accelerated if we lessen the selection strength.

Mobilia examined the prisoner’s dilemma game with cooperation facilitators (Mobilia 2012). A cooperation facilitator was assumed to cooperate with cooperators and not to play with defectors. The cooperation facilitator and zealous cooperator in the present study are common in that they never change the strategy. However, they are different. First, zealous cooperators are embedded in a well-mixed population such that they myopically cooperate with defectors as well as cooperators. Second, the ordinary players may imitate the zealous cooperator’s strategy (i.e., cooperation). In contrast, players do not imitate the cooperation facilitator’s strategy (i.e., cooperation) in Mobilia’s model. As a consequence, cooperation does not always fixate in his model.

Examination of the case of imperfect zealots, in which zealots change the strategy with a small probability (Masuda 2012), warrants future work.

Appendix A: Derivation of Eq. (6)

Denote by $P_i(t)$ the probability that the random walker starting from state $i$ at time 0 is absorbed to state $N$ at time $t$. The normalization is given by ${\sum }_{t=0}^{\infty }{P}_i(t)=1$. It should be noted that $P_N(0)=1$ and $P_N(t)=0$ ($t\ge 1$). The mean fixation time when $i$ ordinary players initially select strategy $A$ is given by

$$\begin{array}{c}\hfill t_i=\sum _{t=0}^{\infty }t{P}_i(t).\end{array}$$ 42

It should be noted that $t_N=0$.

$P_i(t)$ satisfies the recursion relation given by

$$\begin{array}{c}\hfill P_i(t)=T_i^{-}{P}_{i-1}(t-1)+(1-T_i^{-}-T_i^{+})P_i(t-1)+T_i^{+}{P}_{i+1}(t-1).\end{array}$$ 43

By multiplying both sides of Eq. (43) by $t$ and taking the summation over $t$, we obtain

$$\begin{array}{c}\hfill t_i=T_i^{-}{t}_{i-1}+(1-T_i^{-}-T_i^{+})t_i+T_i^{+}{t}_{i+1}+1.\end{array}$$ 44

In terms of ${\mathit{\sigma }}_i\equiv t_i-t_{i+1}$, Eq. (44) can be rewritten as

$$\begin{array}{c}\hfill T_i^{-}{\mathit{\sigma }}_{i-1}-T_i^{+}{\mathit{\sigma }}_i+1=0.\end{array}$$ 45

The solution of Eq. (45) is given by

$$\begin{array}{c}\hfill {\mathit{\sigma }}_i={\mathit{\sigma }}_0{q}_i+q_i\sum _{k=1}^i\frac{1}{T_k^{+}{q}_k},\end{array}$$ 46

where $0\le i\le N-1$ and $q_i$ is given by Eq. (7).

We set $i=0$ in Eq. (44) and use $T_0^{-}=0$ to obtain

$$\begin{array}{c}\hfill t_0=(1-T_0^{+})t_0+T_0^{+}{t}_1+1.\end{array}$$ 47

Therefore, we obtain

$$\begin{array}{c}\hfill {\mathit{\sigma }}_0=t_0-t_1=\frac{1}{T_0^{+}}.\end{array}$$ 48

Using Eq. (48), we reduce Eq. (46) to

$$\begin{array}{c}\hfill {\mathit{\sigma }}_i=q_i\sum _{k=0}^i\frac{1}{T_k^{+}{q}_k}.\end{array}$$ 49

The mean fixation time is given by

$$\begin{array}{cc}\hfill t_i=& \sum _{j=i}^{N-1}{\mathit{\sigma }}_j+t_N\hfill \\ \hfill =& \sum _{j=i}^{N-1}{q}_j\sum _{k=0}^j\frac{1}{T_k^{+}{q}_k}.\hfill \end{array}$$ 50

Appendix B: Classification of the deterministic dynamics induced by the biased random walk

B.1 When $a-b-c+d<0$

We obtain ${\mathrm{d}}^{2}f(y)/\mathrm{d}{y}^2<0$ for $a-b-c+d<0$. Because

$$\begin{array}{cc}\hfill f(0)& =m^{2}a+mb>0,\hfill \end{array}$$ 51

$$\begin{array}{cc}\hfill f(1)& ={(m+1)}^{2}a-(m+1)c,\hfill \end{array}$$ 52

where we used the assumption $a>0$ in Eq. (51), we distinguish the following two cases. If $c<(m+1)a$, $f(y)>0$ is satisfied for $0\le y\le 1$, yielding case (i) in the main text. If $c>(m+1)a$, a certain $y_1^{\ast }(0<y_1^{\ast }<1)$ exists such that $f(y)>0$ for $0\le y<y_1^{\ast }$, and $f(y)<0$ for $y_1^{\ast }<y\le 1$. Therefore, case (ii) occurs.

B.2 When $a-b-c+d>0$

We obtain ${\mathrm{d}}^{2}f(y)/\mathrm{d}{y}^2>0$ for $a-b-c+d>0$. In this situation, Eq. (51) holds true.

If $f(1)<0$, i.e., $c>(m+1)a$, a certain $y_1^{\ast }$ ($0<y_1^{\ast }<1$) exists such that $f(y)>0$ for $0\le y<y_1^{\ast }$, and $f(y)<0$ for $y_1^{\ast }<y\le 1$. Therefore, case (ii) occurs.

Suppose that $f(1)>0$, i.e., $c<(m+1)a$. To analyze this case, let us write

$$\begin{array}{c}\hfill f(y)=(a-b-c+d){(y-\tilde{y})}^2+m^{2}a+mb-\frac{{\left[2ma+(1-m)b-mc-d\right]}^2}{4(a-b-c+d)},\\ \hfill \end{array}$$ 53

where

$$\begin{array}{c}\hfill \tilde{y}=-\frac{2ma+(1-m)b-mc-d}{2(a-b-c+d)}.\end{array}$$ 54

• (i)If $\tilde{y}\le 0$, i.e., $2ma+(-m+1)b-mc-d\ge 0$, we obtain $f(y)\ge f(0)>0$ for $y\ge 0$. Therefore, case (i) occurs.
• (ii)If $\tilde{y}\ge 1$, i.e., $-(2m+2)a+(m+1)b+(m+2)c-d\ge 0$, then $f(y)\ge f(1)>0$, yielding case (i).
• (iii)
  If $0<\tilde{y}<1$, we have the following two subcases:

  1. If $D={\left[2ma+(1-m)b-mc-d\right]}^2-4m(ma+b)(a-b-c+d)>0$, $f(y)=0$ has two solutions $0<y_1^{\ast }<y_2^{\ast }<1$. In the deterministic dynamics driven by the bias $T_i^{+}-T_i^{-}$, $y_1^{\ast }$ and $y_2^{\ast }$ are stable and unstable, respectively. Therefore, case (iii) occurs.
  2. If $D\le 0$, we obtain $f(y)\ge 0$ for all $0\le y<1$, where the equality holds true only when $D=0$ and $y=\tilde{y}$. Therefore, case (i) occurs.

B.3 When $a-b-c+d=0$

The quadratic term in $f(y)$ disappears when $a-b-c+d=0$. The classification of the dynamics in this case coincides with that for $a-b-c+d<0$.

Appendix C: Derivation of $\tilde{q}(y)$

To derive the relationship $q_i={\left[\tilde{q}(i/N)\right]}^N$, we write

$$\begin{array}{cc}\hfill q_i& =exp\left(\sum _{k=1}^{i}ln\frac{T_k^{-}}{T_k^{+}}\right)\hfill \\ \hfill & =exp\left\{\sum _{k=1}^{i}ln\frac{k\left[(k+M)c+(N-k-1)d\right]}{(k+M)\left[(k+M-1)a+(N-k)b\right]}\right\}\hfill \\ \hfill & \approx exp\left\{N\underset{0}{\overset{y}{\int }}ln\frac{y^{\prime }\left[(y^{\prime }+m)c+(1-y^{\prime })d\right]}{(y^{\prime }+m)\left[(y^{\prime }+m)a+(1-y^{\prime })b\right]}\mathrm{d}{y}^{\prime }\right\},\hfill \end{array}$$ 55

where $y=i/N$ and $y^{\prime }=k/N$. Because the integral on the right-hand side of Eq. (55) is independent of $N$, we obtain $q_i={\left[\tilde{q}(y)\right]}^N$. It should be noted that $\tilde{q}(0)=1$ is consistent with $q_0=1$.

Appendix D: Steepest descent method

As done in Antal and Scheuring (2006), we use the steepest descent method to evaluate ${\sum }_{k=i^{\ast }}^{N-1}(q_{N-1}/q_k)$ in Eq. (26) as follows:

$$\begin{array}{cc}\hfill \sum _{k=i^{\ast }}^{N-1}\frac{q_{N-1}}{q_k}\sim & \sum _{k=i^{\ast }}^{N-1}{\left[\frac{\tilde{q}(1)}{\tilde{q}(k/N)}\right]}^N\hfill \\ \hfill \sim & N\underset{\frac{i^{\ast }}{N}}{\overset{1}{\int }}{\left[\frac{\tilde{q}(1)}{\tilde{q}(y^{\prime })}\right]}^N\mathrm{d}{y}^{\prime }\hfill \\ \hfill =& N{\left[\frac{\tilde{q}(1)}{\tilde{q}(y^{\ast })}\right]}^N\underset{\frac{i^{\ast }}{N}}{\overset{1}{\int }}exp\left[-\frac{ln\frac{\tilde{q}(y^{\prime })}{\tilde{q}(y^{\ast })}}{\frac{1}{N}}\right]\mathrm{d}{y}^{\prime }\hfill \end{array}$$ 56

where $\tilde{q}(y^{\ast })={min}_{0\le y<1}\tilde{q}(y)$. We approximate the integral by a Gaussian integral to obtain

$$\begin{array}{c}\hfill \int exp\left[-\frac{F(y^{\prime })}{\mathit{\lambda }}\right]\mathrm{d}{y}^{\prime }\approx \sqrt{\frac{2\mathit{\pi }\mathit{\lambda }}{F^{″}(y^{\ast })}}exp\left[-\frac{F(y^{\ast })}{\mathit{\lambda }}\right]\end{array}$$ 57

with $F(y^{\prime })=ln\left[\tilde{q}(y^{\prime })/\tilde{q}(y^{\ast })\right]$ and $\mathit{\lambda }=1/N$ such that

$$\begin{array}{c}\hfill \sum _{k=k^{\ast }}^{N-1}\frac{q_{N-1}}{q_k}\sim \sqrt{N}{\left[\frac{\tilde{q}(1)}{\tilde{q}(y^{\ast })}\right]}^N.\end{array}$$ 58

Appendix E: Weak selection introduced via an exponential function leads to fast fixation

Assume that the fitness of an A and B player is given by Eqs. (35) and (36), respectively. Then, we obtain

$$\begin{array}{cc}& \frac{T_i^{-}}{T_i^{+}}=\frac{i{g}_i}{(i+M)f_i}\hfill \\ \hfill & =exp\left\{\mathit{\beta }\frac{\left[(i+M)c+(N-i-1)d\right]-\left[(i+M-1)a+(N-i)b\right]}{N+M-1}+ln\frac{i}{i+M}\right\}.\hfill \\ \hfill \end{array}$$ 59

If $T_i^{-}/T_i^{+}<1$, i.e.,

$$\begin{array}{c}\hfill \mathit{\beta }\frac{\left[(i+M)c+(N-i-1)d\right]-\left[(i+M-1)a+(N-i)b\right]}{N+M-1}+ln\frac{i}{i+M}<0\\ \hfill \end{array}$$ 60

holds true for any $i$ ($1\le i\le N-1$) and $N$, the fixation occurs fast (i.e., $t_0\propto NlnN$). By substituting $y=i/N$ and $m=M/N$ in Eq. (60) and ignoring $O(N^{-1})$ terms, we obtain

$$\begin{array}{c}\hfill \mathit{\beta }\frac{(x+m)(c-a)+(1-x)(d-b)}{1+m}<ln\frac{x+m}{x}.\end{array}$$ 61

Because the right-hand side of Eq. (61) is positive, there exists ${\mathit{\beta }}_{\mathrm{c}}>0$ such that $t_0\propto NlnN$ when $0\le \mathit{\beta }<{\mathit{\beta }}_{\mathrm{c}}$. It should be noted that, in contrast to the assumption throughout the present article, $a$, $b$, $c$, and $d$ are allowed to be negative in the present analysis because $f_i$ and $g_i$ given by Eqs. (35) and (36) are positive irrespective of the $a$, $b$, $c$, and $d$ values.