Preprint
Article

This version is not peer-reviewed.

Broken by Roles, Restored by Mutation: Mirror Spectra and Equivariant Bifurcations in Role-Conditioned Replicator-Mutator Dynamics

Submitted:

28 September 2026

Posted:

29 September 2026

You are already at the latest version

Abstract
A symmetric game acquires an asymmetry as soon as its players can condition their behaviour on an observable but payoff-irrelevant role, such as owner and intruder. Selten's theorem states that no mixed strategy survives as an evolutionarily stable strategy under such role conditioning. We study the dynamical counterpart of this result in the presence of uniform mutation, modelling the two roles as two populations governed by the replicator-mutator dynamic. The system is equivariant under the role swap, its fixed-point subspace carries the role-blind dynamic, and at every symmetric rest point the Jacobian splits into a role-blind block and a transverse block. Without mutation the two spectra are exact mirror images, so the rate at which a symmetric equilibrium attracts in the role-blind game is precisely the rate at which it repels once roles are observed. Mutation shifts both spectra by the same amount. For games whose barycentre is a rest point we prove that the role-conditioned equilibrium is asymptotically stable if and only if the mutation rate exceeds the largest modulus of the real parts of the role-blind spectrum, which for an evolutionarily stable strategy equals its fastest attraction rate. For two-strategy games we obtain closed forms for the threshold, for the critical point, and for the supercritical pitchfork law governing the emerging role conventions, together with a Dulac argument that excludes cycles. For three or more strategies the symmetry-breaking mode can be complex, and an equivariant Hopf bifurcation produces anti-phase role cycles in which the two roles follow the same orbit half a period apart, as we verify for the rock-paper-scissors game. Forced symmetry breaking and finite-population simulations complete the analysis. The results read the emergence of property-like conventions as spontaneous symmetry breaking controlled by the exploration rate.
Keywords: 
;  ;  ;  ;  ;  ;  ;  ;  ;  

1. Introduction

Symmetry is the natural starting point of evolutionary game theory. In the classical setting two randomly matched individuals play the same game, draw their strategies from the same set, and are treated by the payoff matrix in exactly the same way, so that nothing distinguishes one contestant from the other except the strategy chosen. Maynard Smith and Parker observed that real contests are rarely so featureless [1]. Contestants typically differ in an observable way, for instance one of them arrived first, and even when the asymmetry has no bearing on payoffs it can be used as a cue to settle the contest by convention. The “bourgeois” rule, escalate if you are the owner and retreat if you are the intruder, is the paradigmatic example [1,2,3]. Selten then proved the theorem that organises the whole subject: if the two contestants always occupy different roles and can condition their behaviour on the role they occupy, then every evolutionarily stable strategy of the role game is pure [4]. A mixed population state that is perfectly stable when players cannot tell owners from intruders becomes unstable the moment they can. Role information breaks the symmetry of the game, and it breaks it in a specific direction: away from mixing and towards conventions.
The dynamical version of Selten’s theorem is equally well known. The role game of a symmetric game is a bimatrix game, and the natural dynamic for a bimatrix game is the two-population replicator dynamic [5,6,7,8]. Eshel and Akin showed that interior rest points of this dynamic are never asymptotically stable [9], and Hofbauer explained why: after a change of velocity the bimatrix replicator dynamic is divergence free, so it preserves volume and cannot have an attracting interior equilibrium; in the two-strategy case it is even Hamiltonian [7,10]. The mixed equilibria that role conditioning destroys statically are thus also unreachable dynamically. What the classical theory does not say is how much of the symmetric structure survives the introduction of roles, in what precise quantitative sense the mixed equilibrium is destabilised, and what a small amount of behavioural noise does to the picture.
Noise, in the form of mutation, is the second ingredient of this paper. The replicator-mutator equation adds to the replicator dynamic a term that redistributes a fraction of the population uniformly over the strategy set [11,12,13,14]. In biological applications the term represents mutation; in learning applications it represents exploration, and the replicator-mutator dynamic is the mean-field limit of reinforcement learning with Boltzmann exploration and of related multi-agent learning schemes [15,16,17]. For the multi-population replicator dynamic, Bauer, Broom and Alonso showed that the same additive mutation term shifts the Jacobian at any rest point by a multiple of the identity, that mutation equilibria exist for every positive mutation rate, that they are unique and asymptotically stable when mutation is large, and that a Nash equilibrium can be approached by asymptotically stable mutation equilibria only if the Jacobian of the unperturbed dynamic has no eigenvalue with positive real part [18]. On the learning side, Hofbauer and Hopkins proved that a mixed equilibrium of a bimatrix game is asymptotically stable under every perturbed best-response dynamic if and only if the game is linearly equivalent to a zero-sum game [19]; related instability results for purified and perturbed mixed equilibria are due to Fudenberg and Kreps, Ellison and Fudenberg, and Echenique and Edlin [20,21,22]. For the one-population rock-paper-scissors game, Mobilia and then Toupo and Strogatz showed that mutation can create a supercritical Hopf bifurcation and stable limit cycles [23,24].
None of these contributions treats the problem as what it is, namely a problem of symmetry. When a symmetric game is played in roles, the resulting dynamic possesses a canonical symmetry that a generic bimatrix game does not have: the role swap, which exchanges the two populations, together with whatever permutations of the strategy set leave the payoff matrix invariant. The role-blind dynamic is exactly the restriction of the role-conditioned dynamic to the fixed-point subspace of the role swap. Selten’s theorem is then the statement that a symmetric equilibrium loses stability in the directions transverse to that subspace, and the question of what replaces it is a question about symmetry-breaking bifurcations. This paper carries out that analysis with uniform mutation as the bifurcation parameter. The mutation kernel is chosen to respect the full symmetry group, so that it is a symmetry-preserving perturbation and the equivariant machinery of Golubitsky, Stewart and Schaeffer applies without modification [25,26,27].
Our results are the following. First, at every rest point on the fixed-point subspace the Jacobian decomposes into a role-blind block and a transverse block, and without mutation the two blocks are exact negatives of one another. The rate at which an evolutionarily stable state attracts in the role-blind game is therefore the rate at which it repels once roles are observed; the strength of an evolutionarily stable strategy is the exact measure of its fragility under role information. Second, for the class of games whose barycentre is a rest point for every mutation rate, which includes all games with a transitive automorphism group and all two-strategy games with a centred mixed equilibrium, the transition is sharp: the symmetric equilibrium of the role-conditioned dynamic is asymptotically stable if and only if the mutation rate exceeds the largest modulus of the real parts of the role-blind spectrum. For an evolutionarily stable state this critical rate is its fastest attraction rate. The bound of Bauer, Broom and Alonso, which is a supremum over the whole state space, becomes an equality at the symmetric point. Third, for all two-strategy games we solve the problem completely: the critical mutation rate and the critical position of the diagonal rest point have closed forms depending only on the mixed equilibrium and on the payoff scale, the threshold always exceeds the role-blind attraction rate unless the mixed equilibrium is centred, the bifurcation is a supercritical pitchfork whose two branches are the role conventions and whose amplitude obeys an exact square-root law, and a Dulac function excludes periodic orbits for every positive mutation rate. Fourth, for three or more strategies the transverse mode can be complex, and the role swap acts as minus the identity on the critical eigenspace, so that the bifurcation is an equivariant Hopf bifurcation whose periodic orbits carry the spatio-temporal symmetry that the two roles follow the same cycle half a period apart. Temporal symmetry breaking of this kind is impossible with two strategies, which yields a clean dichotomy between conventions and anti-phase cycles. Fifth, we quantify what happens when the symmetry is imperfect, when owners value the resource slightly more than intruders or explore slightly differently, and what happens in finite populations, where the broken symmetry is restored on long time scales by rare convention switches whose waiting time grows exponentially with population size.
The stakes of these results extend in three directions. In the theory of conventions the emergence of property-like rules from anonymous interaction has been analysed by Hume, by Sugden, by Young, by Skyrms and by Gintis [28,29,30,31,32,33]. Our analysis phrases that emergence as spontaneous symmetry breaking with an exact control parameter: above the critical exploration rate the symmetric mixed state, in which owners and intruders behave alike and fight with the same frequency, is the unique attractor; below it two mirror-image conventions appear, and small asymmetries in payoffs or in exploration select between them. In the theory of learning the mutation rate is the exploration rate, and the threshold gives the amount of exploration required for two learners in fixed roles to keep converging to the quantal-response-like equilibrium rather than settling on a convention or cycling out of phase [34,35]. In biology the same results describe owner-intruder contests and cyclic dominance in populations of side-blotched lizards and bacteria [36,37].
The paper is organised as follows. Section 2 sets up the model, identifies the symmetry group and proves the two structural lemmas that drive everything else. Section 3 presents the mirror theorem, the critical exploration rate, the complete solution of two-strategy games, the equivariant bifurcation dichotomy with the rock-paper-scissors example, numerical verification, forced symmetry breaking and finite populations. Section 4 discusses the results and Section 5 concludes.

2. Materials and Methods

2.1. Symmetric Games Played in Roles

Let A ∈ R n × n be the payoff matrix of a symmetric two-player game with n pure strategies, where A i j is the payoff to a player using strategy i against an opponent using strategy j . Population states live in the simplex Δ = { x ∈ R n : x i ≥ 0 ,   ∑ i x i = 1 } , whose tangent space is T 0 = { ξ ∈ R n :   1 ⊤ ξ = 0 } , with 1 the vector of ones. We write b = 1 / n for the barycentre of Δ and P = d i a g p for the diagonal matrix of a vector p . The role-blind, or classical, replicator dynamic on Δ is [7,38]
x ˙ i = x i A x i − x ⊤ A x ,     i = 1 , … , n .
An interior rest point p of Equation (1) is an interior Nash equilibrium, characterised by A p i = p ⊤ A p for all i . Such a point is an evolutionarily stable state if and only if ξ ⊤ A ξ < 0 for every non-zero ξ ∈ T 0 , and every evolutionarily stable state is an asymptotically stable rest point of Equation (1) [7,39]. We shall mostly need the weaker dynamical property that p is a hyperbolic sink, that is, that the Jacobian of Equation (1) restricted to T 0 has all eigenvalues in the open left half-plane.
Following Selten, we now suppose that in every contest one player occupies role I and the other role II, that the roles are observable, and that they are payoff-irrelevant: a player using i against j receives A i j whichever role she occupies [4]. Because behaviour can be conditioned on the role, the relevant object is the bimatrix game A , A ⊤ in which the role-I player’s payoff matrix is A and the role-II player’s payoff matrix is A ⊤ , and the relevant dynamic is the two-population replicator dynamic [5,6,7]. Writing x ∈ Δ for the distribution of strategies used in role I and y ∈ Δ for that in role II, the dynamic reads
x ˙ i = x i A y i − x ⊤ A y ,     y ˙ i = y i A x i − y ⊤ A x .
Two remarks on the modelling choice are in order. First, if every individual is a pair of role-specific behaviours drawn from one population, the state space is the simplex over the n 2 pairs and the replicator dynamic acts there; however, the Wright manifold of product distributions is invariant under that dynamic, and on it the dynamic reduces exactly to Equation (2) for the marginals [8,40]. Equation (2) is therefore the description of a single population without linkage between the two role-specific traits as much as the description of two separate populations. Second, it is classical that no interior rest point of Equation (2) is asymptotically stable: with the velocity change d τ = d t / ∏ i x i ∏ j y j the vector field becomes divergence free, so the flow preserves volume [7,9,10]. This is the dynamical form of Selten’s theorem, and the first purpose of the present paper is to state exactly what it costs.

2.2. Uniform Mutation as a Symmetry-Preserving Perturbation

We add to each population a mutation term of the additive form introduced by Hadeler and by Hofbauer for selection-mutation models [11,12] and used by Bauer, Broom and Alonso for multi-population games [18]: at rate M ≥ 0 individuals abandon their strategy and redraw one uniformly from the n available. The role-blind replicator-mutator dynamic is
x ˙ i = x i A x i − x ⊤ A x + M 1 n − x i ,
and the role-conditioned replicator-mutator dynamic is the pair
x ˙ i = x i A y i − x ⊤ A y + M 1 n − x i ,
y ˙ i = y i A x i − y ⊤ A x + M 1 n − y i .
Three properties of Equations (4) and (5) are immediate and will be used without further comment. The simplex product Δ × Δ is forward invariant, and for M > 0 the vector field points strictly inward on its boundary, so all rest points are interior and at least one exists by Brouwer’s theorem [18]. The mutation term is minus the Euclidean gradient of the convex function M / 2 ∥ x − b ∥ 2 , so it adds − M times the identity to the Jacobian of the mutation-free field at every point [18]; what is not immediate, and what Lemma 3 below provides, is the exact form of the Jacobian at a rest point once the movement of the rest point with M is taken into account. Finally, the additive form is the weak-selection limit of the multiplicative replicator-mutator equation of Page and Nowak in which mutation acts on offspring [13,18]; all statements below that concern the sign of eigenvalues at the barycentre hold verbatim for the multiplicative form with background fitness, because the two forms have the same linearisation there up to a positive factor. In the learning interpretation M is the ratio of the exploration rate to the selection intensity [16,17], and in Section 3.7 we show that the Wright-Fisher process with selection intensity β and mutation probability u per birth has Equation (4) as its mean-field limit with M = u / β .
The choice of a uniform mutation kernel is not a convenience but the heart of the method. A kernel that redistributes towards an arbitrary interior vector c instead of b would single out some strategies over others and would therefore break the permutation symmetries of the game; a kernel that differs between the two roles would break the role swap. The uniform kernel, applied identically in both roles, preserves every symmetry of the game, and consequently the mutation rate is a symmetry-preserving bifurcation parameter. Section 3.6 examines what happens when this assumption is relaxed.

2.3. The Symmetry Group and Two Structural Lemmas

Let A u t A = { Q ∈ S n : Q A Q ⊤ = A } be the group of permutation matrices that leave the payoff matrix invariant, and let σ x , y = y , x be the role swap. The group
Γ = A u t A × Z 2 ,     Q , σ ϵ ⋅ x , y = Q x , Q y     or     Q y , Q x ,
acts linearly on R n × R n and leaves Δ × Δ invariant. For a generic payoff matrix A u t A is trivial and Γ = Z 2 ; for the rock-paper-scissors game A u t A = Z 3 and Γ ≅ Z 6 ; for a pure coordination game with equal payoffs A u t A = S n . Throughout, F M denotes the vector field of Equations (4) and (5) and f M that of Equation (3).
Lemma 1. 
For every  M ≥ 0  the vector field  F M   is  Γ -equivariant:  F M γ z = γ F M z   for all  γ ∈ Γ   and  z ∈ Δ × Δ . The fixed-point subspace of the role swap,  F i x σ = { x , x : x ∈ Δ } , is invariant under the flow, and the restriction of  F M   to  F i x σ   is the role-blind dynamic:  F M x , x = f M x , f M x . In particular  p , p   is a rest point of  F M   if and only if  p   is a rest point of  f M .
Proof. 
Equivariance under σ is read off from Equations (4) and (5), which are exchanged by x , y ↦ y , x . For Q ∈ A u t A we have A Q y = Q A Q ⊤ Q y = Q A y , so A Q y i = A y Q − 1 i ; the average payoff x ⊤ A y is invariant, and Q b = b , so each component of the field is permuted in the same way as the state. Invariance of F i x σ follows from equivariance, since F M σ z = σ F M z implies that F M z ∈ F i x σ whenever z ∈ F i x σ . Setting y = x in Equation (4) gives Equation (3). □
The second lemma is the algebraic core of the paper. It concerns the Jacobian of F M at a rest point p , p on the fixed-point subspace, viewed as a linear map on the tangent space T 0 × T 0 .
Lemma 2. 
Let  p , p  be a rest point of  F M   with  p   interior. Write  D = ∂ x F M x p , p   for the derivative of the role-I field with respect to the role-I state and  B = ∂ y F M x p , p   for its derivative with respect to the role-II state. Then the Jacobian of  F M   at  p , p   has the block form
J M p , p = D B B D ,     D = d i a g A p − p ⊤ A p 1 − p   A p ⊤ − M I ,     B = P − p p ⊤ A ,
it commutes with  σ , and its spectrum on  T 0 × T 0   is the union of the spectra of the two operators
J ∥ = D + B   on   the   symmetric   subspace   E + = { ξ , ξ } , J ⊥ = D − B   on   the   antisymmetric   subspace   E − = { ξ , − ξ } ,
where  J ∥   is exactly the Jacobian of the role-blind dynamic  f M   at  p   restricted to  T 0 .
Proof. 
Differentiating Equation (4) gives ∂ x ˙ i / ∂ x j = δ i j A y i − x ⊤ A y − x i A y j − M δ i j and ∂ x ˙ i / ∂ y j = x i A i j − x i A ⊤ x j , which at x = y = p are the stated D and B . By equivariance, or by direct computation, ∂ y F M y p , p = D and ∂ x F M y p , p = B . A block matrix of this form commutes with the swap and acts on ξ , ξ as D + B ξ and on ξ , − ξ as D − B ξ ; since E + ⊕ E − = T 0 × T 0 , the spectrum splits as claimed. Finally, by the chain rule the Jacobian of x ↦ F M x x , x = f M x is ∂ x F M x + ∂ y F M x = D + B . □
Lemma 2 says that the question “does role information matter for the stability of p ?” has a precise linear-algebraic meaning: it matters if and only if the transverse operator J ⊥ = J ∥ − 2 B has spectrum in the right half-plane while J ∥ does not. The transverse operator is not a new object to be computed from scratch; it is the role-blind Jacobian corrected by twice the cross-population block.

2.4. Numerical Methods

All computations were carried out in Python 3.12 with NumPy, SciPy and Matplotlib; the scripts that reproduce every figure and table are provided as Supplementary Materials. Rest points were located by multi-start Newton iteration on a grid of initial conditions (SciPy fsolve with tolerance 10 − 12 ) and classified by the eigenvalues of the numerical Jacobian projected onto an orthonormal basis of T 0 × T 0 . Trajectories were integrated with the eighth-order Dormand-Prince scheme (DOP853) at relative tolerance 10 − 10 and absolute tolerance 10 − 12 . Periods of limit cycles were estimated from the spacing of maxima and refined by minimising ∥ γ t + T − γ t ∥ over T with cubic-spline interpolation; phase shifts between components were estimated by the same minimisation. Finite populations were simulated with a Wright-Fisher process with two role-specific subpopulations of size N , selection intensity β and per-birth mutation probability u , described in Section 3.7.

3. Results

3.1. The Mirror Theorem

The first result makes the mutation block D of Lemma 2 explicit at a rest point and shows that it is a pure damping term whose size is measured in the Shahshahani metric ⟨ ξ , η ⟩ p = ξ ⊤ P − 1 η on T 0 , the Riemannian structure with respect to which the replicator dynamic is a gradient for partnership games [7,41].
Lemma 3. 
Let  p  be an interior rest point of the role-blind replicator-mutator dynamic (3) for some  M ≥ 0 , and let  Π p = I − p 1 ⊤   be the projection of  R n   onto  T 0   along  p . Then on  T 0
D = − M n   Π p P − 1 ,
the operator  Π p P − 1   is self-adjoint and positive definite for  ⟨ ⋅ , ⋅ ⟩ p , and its spectrum lies in the interval  1 / p m a x , 1 / p m i n . Consequently every eigenvalue  d   of  D   is real and satisfies  − M / n p m i n ≤ d ≤ − M / n p m a x , and  D = − M I   when  p = b .
Proof. 
The rest point condition p i A p i − p ⊤ A p + M 1 / n − p i = 0 gives g i : = A p i − p ⊤ A p = M 1 − 1 / n p i . For ξ ∈ T 0 , Lemma 2 gives D ξ i = g i − M ξ i − p i ∑ j A p j ξ j . Now g i − M = − M / n p i , and ∑ j A p j ξ j = ∑ j g j ξ j + p ⊤ A p 1 ⊤ ξ = ∑ j g j ξ j = − M / n ∑ j ξ j / p j , because 1 ⊤ ξ = 0 . Hence D ξ i = − M / n ξ i / p i − p i   1 ⊤ P − 1 ξ = − M / n Π p P − 1 ξ i , which is Equation (9). For ξ , η ∈ T 0 , ⟨ ξ , Π p P − 1 η ⟩ p = ξ ⊤ P − 2 η − 1 ⊤ ξ 1 ⊤ P − 1 η = ξ ⊤ P − 2 η , which is symmetric in ξ and η and positive for ξ = η ≠ 0 ; the Rayleigh quotient ξ ⊤ P − 2 ξ / ξ ⊤ P − 1 ξ is a weighted average of the numbers 1 / p i with weights ξ i 2 / p i , whence the spectral bounds. If p = b then P − 1 = n I and Π b P − 1 ξ = n ξ for ξ ∈ T 0 . □
With D in hand, the mirror theorem is a one-line consequence of Lemma 2.
Theorem 4 (Mirror theorem). 
Let  M = 0   and let  p   be an interior Nash equilibrium of  A . Then  D = 0   on  T 0 , so that
J ⊥ p = − J ∥ p = − B = − P − p p ⊤ A   on   T 0 ,
and the spectrum of the role-conditioned Jacobian at  p , p   is the union of the role-blind spectrum and its negative. In particular, if  λ   is an eigenvalue of the role-blind replicator dynamic at  p , then  − λ   is an eigenvalue of the role-conditioned dynamic at  p , p   in a direction transverse to  F i x σ .
Proof. 
Lemma 3 with M = 0 gives D = 0 , and Lemma 2 gives J ∥ = B and J ⊥ = − B . □
Corollary 5 (Dynamical Selten theorem, quantified). 
Let  M = 0   and let  p   be an interior Nash equilibrium of  A   that is a hyperbolic sink of the role-blind replicator dynamic, with eigenvalues  λ 1 , … , λ n − 1   on  T 0 . Then  p , p   is a hyperbolic saddle of the role-conditioned dynamic (2) whose unstable manifold has dimension  n − 1 , is transverse to  F i x σ , and along which trajectories separate at the rates  − R λ 1 , … , − R λ n − 1 . If instead  R λ k = 0   for all  k , as for zero-sum games, then  p , p   is non-hyperbolic and elliptic in every direction. In no case is  p , p   asymptotically stable.
Proof. 
By Theorem 4 the eigenvalues of J M p , p are λ k on E + and − λ k on E − . If all R λ k < 0 the stable eigenspace is E + and the unstable eigenspace is E − , which is transverse to F i x σ and has dimension n − 1 . If all R λ k = 0 every eigenvalue is purely imaginary. Since the spectrum is symmetric about the imaginary axis in every case, asymptotic stability is impossible, in agreement with the volume-preservation argument of [9,10]. □
Corollary 5 sharpens Selten’s theorem in a way that its static formulation cannot express. An evolutionarily stable state is not merely destabilised by role information; it is destabilised in exactly as many directions as it has, and in each direction the speed of divergence equals the speed of convergence that the same direction had before roles were observed. The “strength” of an evolutionarily stable strategy, its rate of attraction, is precisely the strength of the pull away from it once the population can tell owners from intruders. It is this exact mirroring, rather than the mere non-existence of mixed ESS, that fixes the amount of mutation needed to restore the symmetric equilibrium.

3.2. The Critical Exploration Rate

When mutation is switched on, the two blocks of Lemma 2 are shifted by the same damping operator D , and for the cleanest class of games the shift is exactly − M times the identity. That class is defined by the requirement that the barycentre b be a rest point for every M , which by Equation (3) is equivalent to A b being a constant vector, that is, to A having equal row sums. It contains every game whose automorphism group acts transitively on the strategies, such as cyclic games and pure coordination games with equal payoffs, and every two-strategy game whose mixed equilibrium is p * = 1 / 2 . For such a matrix A 1 = n c   1 for some scalar c , the line spanned by 1 is A -invariant, and we denote by μ 2 , … , μ n the eigenvalues of the induced map on the quotient space R n / s p a n 1 , that is, the eigenvalues of A other than the one belonging to 1 , counted with multiplicity.
Theorem 6 (Critical exploration rate). 
Let  A   have equal row sums. Then for every  M ≥ 0   the point  b   is a rest point of Equation (3) and  b , b   a rest point of Equations (4) and (5), and on the tangent spaces
s p e c   J ∥ b = { μ k n − M } k = 2 n ,     s p e c   J ⊥ b = { − μ k n − M } k = 2 n .
Consequently the role-conditioned equilibrium  b , b   is a hyperbolic sink if and only if
M > M c : = 1 n m a x 2 ≤ k ≤ n | R   μ k | ,
whereas the role-blind equilibrium  b   is a hyperbolic sink if and only if  M > M ∥ : = 1 n m a x k R   μ k   (with the convention that this holds for all  M ≥ 0   when  m a x k R μ k < 0 ). In particular, if  b   is a hyperbolic sink of the role-blind replicator dynamic, then  M ∥ = 0   and
M c = 1 n m a x k − R   μ k ,
the fastest rate at which the role-blind dynamic attracts to  b .
Proof. 
Since A b = c 1 , the replicator term of Equation (3) vanishes at b and so does the mutation term, so b is a rest point for every M , and Lemma 1 lifts this to b , b . By Lemma 3, D = − M I on T 0 . By Lemma 2, B = P − p p ⊤ A = 1 / n I − b 1 ⊤ A = 1 / n Π b A at p = b . We claim that the eigenvalues of Π b A on T 0 are exactly μ 2 , … , μ n . Indeed, Π b A maps T 0 into itself because 1 ⊤ Π b = 0 . If ξ ∈ T 0 is an eigenvector of the quotient map, so that A ξ = μ ξ + α 1 for some scalar α , then Π b A ξ = μ ξ + α 1 − b   1 ⊤ μ ξ + α 1 = μ ξ + α 1 − α n b = μ ξ , since 1 ⊤ ξ = 0 and n b = 1 ; the same computation on generalised eigenvectors shows that the two maps have the same characteristic polynomial, since Π b A on T 0 is conjugate to the quotient map under the isomorphism T 0 ≅ R n / s p a n 1 . Therefore J ∥ = B − M I and J ⊥ = − B − M I have the spectra in Equation (11). Hyperbolic sinks require all real parts negative: for J ⊥ this is M > m a x k − R μ k / n and for J ∥ it is M > m a x k R μ k / n ; the role-conditioned point needs both, which is Equation (12), and Equation (13) follows when all R μ k < 0 . □
Corollary 7 (Three regimes). 
Under the hypotheses of Theorem 6 let  r + = m a x k R μ k   and  r − = m a x k − R μ k . Exactly one of the following holds. (i) Attractor type,  r + < 0 : the role-blind equilibrium is stable for every  M ≥ 0 , the role-conditioned equilibrium only for  M > r − / n > 0 ; roles matter, and the interval  ( 0 , r − / n ]   of exploration rates is where they matter. (ii) Repeller type,  r + > 0   and  r + ≥ r − : both equilibria become stable at the same value  M = r + / n ; role information is irrelevant to stability. (iii) Neutral type,  r + = r − = 0 , which includes all zero-sum games: both equilibria are stable for every  M > 0 , and arbitrarily small mutation stabilises both.
Proof. 
Immediate from Equation (11). □
Remark 1. 
Corollary 7(iii) is the replicator-mutator counterpart of the result of Hofbauer and Hopkins that mixed equilibria of bimatrix games are stable under all perturbed best-response dynamics exactly when the game is linearly equivalent to a zero-sum game [19], and of the observation of Bauer, Broom and Alonso that the mixed equilibrium of matching pennies is an attracting mutation limit [18]. Theorem 6 adds the quantitative statement for games that are not zero-sum: the mixed equilibrium is an attracting mutation limit of the role-conditioned dynamic in the sense of [18] if and only if M c = 0 , and otherwise it is attracting precisely above the explicit level M c . The general lower bound of [18], Lemma 3.8, is the supremum of the real parts of the Jacobian spectrum over the whole state space; at the barycentre Theorem 6 replaces the supremum by the exact value m a x k R μ k / n .
Remark 2. 
The equal-row-sum hypothesis is what makes  D = − M I  and keeps the rest point fixed as  M   varies. For a general interior rest point  p M   the transverse operator is  J ⊥ = − M / n Π p M P M − 1 − P M − p M p M ⊤ A , and the critical rate is the smallest  M   at which its spectral abscissa vanishes. It is still well defined, but it depends on how  p M   moves, and Section 3.3 shows in the two-strategy case that it always exceeds the naive mirror value obtained by freezing  p M   at  p * .

3.3. Two-Strategy Games: The Complete Solution

For n = 2 every symmetric game is characterised, up to the addition of constants to columns, by the two numbers a = A 11 − A 21 and d = A 22 − A 12 . Writing x and y for the frequencies of strategy 1 in roles I and II, the payoff advantage of strategy 1 against an opponent playing 1 with probability y is Δ y = a y − d 1 − y = s y − p * , where s = a + d and p * = d / s is the mixed equilibrium when 0 < p * < 1 . The game is of anti-coordination type, and p * is an evolutionarily stable state, when s < 0 ; it is of coordination type when s > 0 . Equations (4) and (5) become
x ˙ = x 1 − x Δ y + M 1 2 − x ,     y ˙ = y 1 − y Δ x + M 1 2 − y ,
and the Hawk-Dove game with resource value V and fighting cost C > V , for which A 11 = V − C / 2 , A 12 = V , A 21 = 0 and A 22 = V / 2 , has a = V − C / 2 , d = − V / 2 , s = − C / 2 and p * = V / C .
Proposition 8 (Exact threshold for two strategies). 
Let  s < 0   and  0 < p * < 1 , and put  q = p * 1 − p * . For every  M ≥ 0   the role-blind dynamic has a unique rest point  p M ∈ 0,1 , which is globally asymptotically stable on  0,1 . The symmetric rest point  p M , p M   of Equation (14) is a hyperbolic sink if and only if  M > M c , where
M c = 2 s   p * 1 − p * 1 + 2 p * 1 − p * = 2 s   q 2 1 + 2 q ,
and at  M = M c   the diagonal rest point sits at
p c = p * 1 − p * − p * 1 − 2 p *   p * ≠ 1 / 2 ,     p c = 1 / 2   p * = 1 / 2 .
Moreover  M c ≥ s   p * 1 − p * , the attraction rate of  p *   in the role-blind replicator dynamic, with equality if and only if  p * = 1 / 2 . For the Hawk-Dove game,  M c = V C − V / C + 2 V C − V , which equals  C / 8 = V / 4   when  C = 2 V .
Proof. 
Uniqueness and global stability of p M : assume p * ≤ 1 / 2 , the other case being symmetric. The rest points of the role-blind dynamic are the zeros of h M p = p 1 − p Δ p + M 1 / 2 − p . On ( 0 , p * ] the cubic term is non-negative, since Δ p = s p − p * ≥ 0 there, and the mutation term is positive, so h M > 0 unless p * = 1 / 2 and p = 1 / 2 ; on [ 1 / 2 , 1 ) both terms are non-positive and not simultaneously zero, so h M < 0 . On p * , 1 / 2 one computes h M ’ p = s   g p − M with g p = − 3 p 2 + 2 1 + p * p − p * , a concave quadratic with g p * = p * 1 − p * > 0 and g 1 / 2 = 1 / 4 > 0 , so g > 0 and h M ’ < 0 on that interval. Hence h M has exactly one zero p M , located in p * , 1 / 2 , h M is positive to its left and negative to its right, and the one-dimensional flow converges to p M from every interior initial condition. Differentiating h M p M = 0 gives d p M / d M = p M − 1 / 2 / h M ’ p M , so p M increases strictly and continuously from p * towards 1 / 2 as M grows, and tends to 1 / 2 as M → ∞ . For the transverse eigenvalue, Lemma 2 gives on the one-dimensional tangent space D = 1 − 2 p Δ p − M and B = p 1 − p Δ ’ p = s   p 1 − p , where we abbreviate p = p M . Using the rest point condition Δ p = M p − 1 / 2 / p 1 − p ,
D = − M   1 − 2 p 2 + 2 p 1 − p 2 p 1 − p = − M   p 2 + 1 − p 2 2 p 1 − p ,
which is the n = 2 instance of Lemma 3. The transverse eigenvalue J ⊥ = D − B vanishes when
M = − 2 s   p 2 1 − p 2 p 2 + 1 − p 2 .
Eliminating M between Equation (18) and the rest point condition M = p 1 − p Δ p / p − 1 / 2 gives Δ p p 2 + 1 − p 2 + 2 s   p 1 − p p − 1 / 2 = 0 . Substituting Δ p = s p − p * , dividing by s and expanding, all cubic terms cancel and one is left with the quadratic
1 − 2 p *   p 2 + 2 p *   p − p * = 0 ,
whose unique root in 0 , 1 is p c in Equation (16); the other root is negative. A direct check gives p c − p * = q 1 − 2 q / 1 − 2 p * > 0 and 1 / 2 − p c = 1 / 2 − q / 1 − 2 p * > 0 , so p c lies strictly between p * and 1 / 2 and is therefore reached by the branch p M at exactly one value of M , which we call M c . Along the branch J ⊥ is continuous, positive at M = 0 by Theorem 4 (it equals s q 2 there), negative for large M because D ≤ − M dominates the bounded term − B , and vanishes only at M c ; hence p M , p M is a hyperbolic sink exactly when M > M c . Inserting p c into Equation (18) and simplifying with q 2 = p * 1 − p * and 1 − 2 p * 2 = 1 − 4 q 2 gives p c 1 − p c = q / 1 + 2 q and p c 2 + 1 − p c 2 = 1 / 1 + 2 q , whence M c = 2 s [ q / 1 + 2 q ] 2 1 + 2 q = 2 s q 2 / 1 + 2 q , which is Equation (15). Finally M c / s q 2 = 2 / 1 + 2 q ≥ 1 because q ≤ 1 / 2 , with equality only at q = 1 / 2 , that is at p * = 1 / 2 . For the Hawk-Dove parametrisation, s = C / 2 and q 2 = V C − V / C 2 . □
Proposition 8 has a striking corollary for the general problem left open in Remark 2. Freezing the rest point at p * and applying the mirror theorem would predict a threshold equal to the role-blind attraction rate s q 2 . The true threshold is larger by the factor 2 / 1 + 2 q , which ranges from 1 at a centred equilibrium to 2 as the equilibrium approaches the boundary of the simplex. Mutation pushes the diagonal rest point towards the centre, which increases the cross-population coupling B = s p M 1 − p M , and the additional damping D does not fully compensate. The critical point p c itself lies strictly between p * and 1 / 2 (Figure 3).
The centred case p * = 1 / 2 is fully explicit and provides the reference example for the whole paper.
Proposition 9 (Pitchfork law). 
Let  a = d < 0 , so that  p * = 1 / 2 ,  s = 2 a   and  M c = a / 2 . Then for every  M ≥ 0   the point  1 / 2,1 / 2   is a rest point of Equation (14), with transverse eigenvalue  λ ⊥ = M c − M   and role-blind eigenvalue  λ ∥ = − M c + M . For  0 ≤ M < M c   there are exactly two further interior rest points, exchanged by the role swap, given by
x − y = ± 1 − M / M c ,     x + y = 1 ,
and their Jacobian has eigenvalues  − a   and  − 2 M c − M , so they are hyperbolic sinks. At  M = M c   the three rest points merge in a supercritical  Z 2 -symmetric pitchfork bifurcation, and for  M > M c   the symmetric rest point is the unique rest point and is a hyperbolic sink.
Proof. 
Set x = 1 / 2 + ξ , y = 1 / 2 + η and note Δ y = a 2 y − 1 = 2 a η . Equation (14) becomes ξ ˙ = 2 a η 1 / 4 − ξ 2 − M ξ and η ˙ = 2 a ξ 1 / 4 − η 2 − M η . The antisymmetric line η = − ξ is invariant, since on it η ˙ = − ξ ˙ , and the flow on it is ξ ˙ = ξ − a / 2 − M + 2 a ξ 2 = ξ M c − M − 2 a ξ 2 because a = − a . Its non-zero rest points exist exactly for M < M c and satisfy ξ 2 = M c − M / 2 a = 1 / 4 1 − M / M c , which gives Equation (20) with x − y = 2 ξ . The cubic coefficient − 2 a is negative, so the pitchfork is supercritical. The Jacobian at ξ , − ξ is α β β α with α = 4 a ξ 2 − M and β = 2 a 1 / 4 − ξ 2 ; inserting ξ 2 = 1 / 4 − M / 2 a gives α = − a + M and β = − M , so the eigenvalues α ± β are − a and − a + 2 M = − 2 M c − M . That there are no other interior rest points is elementary. Write u = 1 / 4 − ξ 2 and v = 1 / 4 − η 2 , so that the rest point equations read 2 a η u = M ξ and 2 a ξ v = M η . If ξ = 0 the first equation forces η = 0 , and symmetrically; if ξ η ≠ 0 , dividing the two equations gives η 2 u = ξ 2 v , that is η 2 = ξ 2 . On the diagonal η = ξ ≠ 0 the first equation becomes 2 a 1 / 4 − ξ 2 = M , impossible because the left side is negative; on the anti-diagonal η = − ξ it becomes 2 a 1 / 4 − ξ 2 = M , which is the branch already found. Hence the rest points are exactly the symmetric point and, for M < M c , the two conventions. □
The last result of this subsection shows that in two-strategy games the symmetry can break only statically: no periodic orbit exists for any positive mutation rate, so that the Hopf scenario of the next subsection is a genuinely higher-dimensional phenomenon.
Proposition 10 (No cycles for two strategies). 
For every symmetric two-strategy game and every  M > 0 , the role-conditioned replicator-mutator dynamic (14) has no periodic orbit in the open square  0,1 2 . Consequently every trajectory converges to a rest point.
Proof. 
Take the Dulac function φ x , y = [ x 1 − x y 1 − y ] − 1 , the classical multiplier that renders the mutation-free bimatrix field divergence free [10]. The divergence of φ F M is
∇   ⋅ φ F M = − M x − 1 / 2 2 + 1 / 4 x 2 1 − x 2   y 1 − y + y − 1 / 2 2 + 1 / 4 y 2 1 − y 2   x 1 − x < 0 ,
because the replicator parts contribute ∂ x Δ y / y 1 − y + ∂ y Δ x / x 1 − x = 0 and ∂ x 1 / 2 − x / x 1 − x = − x − 1 / 2 2 + 1 / 4 / x 1 − x 2 . By the Bendixson-Dulac criterion there is no periodic orbit in the simply connected open square [42]. The square is forward invariant and the rest points are isolated for M > 0 , so by the Poincaré-Bendixson theorem every ω -limit set is a rest point or a cycle of rest points joined by connecting orbits; the latter is excluded by the same integral of the divergence over the region it would bound. □
Remark 3. 
For coordination games,  s > 0 , the roles of the two blocks are exchanged:  J ⊥ = D − B  is negative for every  M ≥ 0 , while  J ∥ = D + B  vanishes at exactly the value given by Equation (18) with  − 2 s  replaced by  2 s . Hence the threshold  2 s   q 2 / 1 + 2 q  is the level of mutation at which the role-blind dynamic loses its bistability and the mixed state becomes the unique attractor, and role conditioning never changes the stability of the diagonal point. This is Corollary 7(ii) for  n = 2 : roles matter for anti-coordination, not for coordination, in agreement with the instability of mixed equilibria of games with strategic complements under a wide class of dynamics [22].

3.4. Equivariant Bifurcations for Three or More Strategies

For n ≥ 3 the transverse operator J ⊥ acts on a space of dimension n − 1 ≥ 2 , and its critical eigenvalue at M = M c may be real or may be a complex pair. The role swap acts as − I on the antisymmetric subspace E − , which by Theorem 6 contains the critical eigenspace, and this single fact determines the type of bifurcation.
Theorem 11 (Equivariant dichotomy). 
Let  A   have equal row sums and let  b   be a hyperbolic sink of the role-blind replicator dynamic, so that  M c > 0   is given by Equation (13). Suppose that the maximum in Equation (13) is attained by a single real eigenvalue or by a single complex-conjugate pair  μ , μ ‾   of  A , and that the corresponding eigenspace is one- or two-dimensional. Then as  M   decreases through  M c   the symmetric equilibrium  b , b   of the role-conditioned dynamic loses stability along  E −   with transversality coefficient  d   R λ ⊥ / d M = − 1 , and generically one of the following occurs.
(a) Real case. The bifurcation is a  Z 2 -symmetric pitchfork. For  M   on one side of  M c   there is, near  b , b , exactly one pair of additional rest points  { z , σ z }   off  F i x σ , the two role conventions, and no other rest points. If the pitchfork is supercritical the conventions exist for  M < M c   and are asymptotically stable.
(b) Complex case. The bifurcation is an equivariant Hopf bifurcation. For  M   on one side of  M c   there is a branch of periodic orbits  γ M   of period close to  2 π n / I μ   with the spatio-temporal symmetry
σ γ M t = γ M t + T M / 2 ,   that   is ,   y t = x t + T M / 2 :
the two roles follow the same cycle half a period apart. If the bifurcation is supercritical the orbits exist for  M < M c   and are orbitally asymptotically stable. If moreover  A u t A   acts non-trivially on the critical eigenspace, the orbits carry the corresponding additional spatio-temporal symmetries.
(c) For  n = 2   only case (a) can occur.
Proof. 
By Theorem 6 the eigenvalues of J ⊥ are − μ k / n − M , so the critical eigenvalue crosses the imaginary axis at M c with d R λ ⊥ / d M = − 1 , while all eigenvalues of J ∥ remain in the left half-plane for M ≥ 0 . The critical eigenspace lies in E − , on which σ acts as − I . Restricting the Γ -equivariant field to a centre manifold, which can be chosen Γ -invariant, yields a reduced Z 2 -equivariant bifurcation problem in which the non-trivial group element acts by − 1 . In case (a) the reduced problem is one-dimensional and odd in the state variable, so its normal form is ξ ˙ = M c − M ξ ∓ κ ξ 3 + … with κ ≠ 0 generically; this is the pitchfork, and the two non-trivial branches are exchanged by σ [25,27]. In case (b) the critical eigenspace is two-dimensional and Z 2 × S 1 acts on it in the standard way, with σ acting as the phase shift by π ; the equivariant Hopf theorem [26], Theorem XVI 4.1, then yields a branch of periodic solutions whose isotropy subgroup is the twisted subgroup { i d , 0 , σ , π } , which is Equation (22). The role-blind block being stable, no bifurcation takes place inside F i x σ and the bifurcating solutions cannot lie in it. For (c), E − is one-dimensional when n = 2 , and Proposition 10 excludes periodic orbits altogether. □
The dichotomy has a memorable reading. Role information can break the symmetry of a mixed equilibrium in two ways only: statically, by splitting the population into two mirror-image conventions, or temporally, by making the two roles run through the same cycle out of phase. Two-strategy games admit only the first; the second requires at least three strategies and a rotational component in the role-blind dynamic. The rock-paper-scissors game provides the canonical instance.
Proposition 12 (Rock-paper-scissors in roles). 
Let
A = 0 − l w w 0 − l − l w 0 ,     w , l > 0 ,
so that  b = 1 / 3,1 / 3,1 / 3   is the unique interior equilibrium and is an evolutionarily stable state if and only if  w > l . The non-trivial eigenvalues of  A   are  μ = l − w / 2 ± i 3 / 2 l + w , and therefore
s p e c   J ∥ b = l − w 6 − M ± i   l + w 2 3 ,     s p e c   J ⊥ b = w − l 6 − M ± i   l + w 2 3 .
If  w > l , the role-blind equilibrium is stable for every  M ≥ 0  and the role-conditioned equilibrium is stable if and only if  M > M c = w − l / 6 , at which value an equivariant Hopf bifurcation with critical frequency  ω c = l + w / 2 3  and period  T c = 4 π 3 / l + w  creates cycles satisfying  y t = x t + T / 2  and, with  ρ  the cyclic permutation of strategies, the discrete rotating-wave relation  x i + 1 t = x i t + T / 3 . If  l > w , the transverse block is stable for every  M ≥ 0  and it is the role-blind block that undergoes a Hopf bifurcation at  M = l − w / 6 ; this is the one-population bifurcation analysed by Mobilia and by Toupo and Strogatz [23,24], and role conditioning leaves it untouched. If   l = w   the game is zero-sum and both equilibria are stable for every   M > 0  .
Proof. 
The matrix is circulant with first row 0 , − l , w , so its eigenvalues are − l ω k + w ω 2 k with ω = e 2 π i / 3 , k = 0 , 1 , 2 : the value w − l for k = 0 belongs to 1 , and the pair l − w / 2 ± i 3 / 2 l + w to the two-dimensional space T 0 . Theorem 6 gives Equation (24) and the thresholds. For w > l the critical pair of J ⊥ is complex, so Theorem 11(b) applies. The automorphism ρ acts on T 0 as rotation by 2 π / 3 and σ as rotation by π , so Γ ≅ Z 6 acts on the critical eigenspace by rotations and the Hopf problem is Z 6 × S 1 -equivariant with Γ acting through a character; the equivariant Hopf theorem yields a branch with the maximal twisted isotropy { γ , θ γ } , θ σ = π , θ ρ = ± 2 π / 3 , whose orbits satisfy σ γ t = γ t + T / 2 and ρ γ t = γ t ± T / 3 , the stated relations. The evolutionary stability claim is the standard fact that ξ ⊤ A ξ = − w − l / 2 ∥ ξ ∥ 2 on T 0 [7]. The remaining cases follow from Corollary 7. □
Whether the Hopf bifurcation of Proposition 12 is supercritical, and whether the pitchforks of Theorem 11(a) are, requires the cubic coefficient of the reduced problem; we determine both numerically in the next subsection and find them supercritical in all cases examined.

3.5. Numerical Verification

Table 1 collects the thresholds predicted by Theorem 6 and Proposition 8 for the games used in this paper, together with the type of symmetry breaking that Theorem 11 predicts below the threshold. Every entry was checked against the eigenvalues of the numerical Jacobian at the symmetric rest point; the agreement is to the number of digits printed.
Figure 1 shows the phase portraits of the Hawk-Dove game with V = 2 and C = 4 , for which M c = 1 / 2 , on the two sides of the threshold. Below the threshold the symmetric state is a saddle whose unstable manifold is the anti-diagonal direction, exactly as Corollary 5 predicts, and every trajectory off the diagonal converges to one of the two conventions; above the threshold the symmetric state attracts the whole open square. Figure 2a superimposes the numerically continued rest points on the closed form of Proposition 9; the two agree to 4 × 10 − 15 , the precision of the root finder, at all 81 values of M examined. Figure 2b displays the mirror spectra of Theorem 4 and their parallel shift under mutation. Table 2 reports the pointwise checks.
Figure 3 tests Proposition 8 away from the centred case. For Hawk-Dove games with V / C ranging from 0.1 to 0.9 the numerically determined threshold, obtained by locating the zero of the transverse eigenvalue along the branch p M by bisection, coincides with the closed form C   q 2 / 1 + 2 q to six digits ( M c / C = 0.05625 , 0.08889 , 0.10957 , 0.12123 and 0.12500 for V / C = 0.1 , 0.2 , 0.3 , 0.4 and 0.5 , the curve being symmetric about V / C = 1 / 2 ), and the same agreement was obtained for anti-coordination games with unequal a and d , for instance a = − 3 , d = − 1 , where both methods give M c = 0.803848 against a role-blind attraction rate of 0.75 . The panel also shows the general inequality of Proposition 8: the true threshold lies above the role-blind attraction rate everywhere except at p * = 1 / 2 , where the two curves touch. We also verified numerically that the pitchfork is supercritical for V / C ∈ { 0.2 , 0.5 , 0.8 } , the pair of conventions existing for M just below and not just above M c , and that for the coordination game a = d = 1 the transverse eigenvalue is negative for every M while the role-blind eigenvalue changes sign at M = a / 2 , as stated in Remark 3.
For the rock-paper-scissors game with w = 1 and l = 0.5 , Proposition 12 gives M c = 1 / 12 ≈ 0.0833 , ω c = 0.4330 and T c = 14.510 . Figure 4 and Table 3 summarise the simulations. Below the threshold, trajectories started near the symmetric state converge to a limit cycle on which the two roles oscillate in anti-phase and the three strategies of each role follow one another with a delay of one third of the period. The squared amplitude of the cycle is proportional to M c − M near the threshold and a linear fit over 0.07 ≤ M < M c extrapolates to zero at M = 0.0832 , against the predicted 0.0833 ; the period tends to T c as M → M c . The bifurcation is therefore supercritical. The spatio-temporal symmetries were tested by finding, for the cycle at M = 0.06 with period T = 14.97467 , the time shift τ that minimises the root-mean-square difference between x i t + τ and y i t and between x i t + τ and x i + 1 t : the minimisers are τ / T = 0.500000 and τ / T = 0.333333 with residuals below 6 × 10 − 9 , that is, the relations y t = x t + T / 2 and x i + 1 t = x i t + T / 3 of Proposition 12 hold to the accuracy of the integration. Above the threshold the symmetric state attracts, and for the zero-sum game w = l it attracts for mutation rates as small as 10 − 3 , as Corollary 7(iii) requires. For l > w the roles of the two blocks are exchanged and only the role-blind block loses stability, again as predicted.

3.6. Forced Symmetry Breaking

The equivariant analysis assumes that the symmetry is exact. In applications it rarely is: owners often value a contested resource more than intruders, and learners in different roles may explore at different rates. Both effects break the role swap while leaving the mathematics of Section 3.3 available as the organising centre, and both are captured by the universal unfolding of the pitchfork [25]: the reduced dynamics on the symmetry-breaking mode becomes
ξ ˙ = M c − M   ξ − κ   ξ 3 + δ ,
where κ > 0 is the cubic coefficient of Proposition 9, κ = 2 a for the centred Hawk-Dove game, and δ is proportional to the size of the asymmetry. The perfect pitchfork is replaced by a smooth branch that connects the unique high-mutation equilibrium to the convention favoured by the asymmetry, and by a disconnected branch on which the disfavoured convention and the saddle are born together in a saddle-node bifurcation at M s n = M c − 3 κ / 4 1 / 3 δ 2 / 3 , the displacement scaling with the universal exponent 2 / 3 .
We tested this picture with two perturbations of the Hawk-Dove game V = 2 , C = 4 . In the first, role I values the resource at V I = 1 + ε V while role II values it at V , so that the game becomes a genuinely asymmetric contest in the sense of Maynard Smith and Parker and of Hammerstein [1,3]. In the second, the payoffs are symmetric but role I explores with a bias towards Hawk, its mutation kernel being 1 / 2 + η , 1 / 2 − η instead of 1 / 2 , 1 / 2 . Figure 5 shows the rest points as functions of M for ε ∈ { 0 , 0.02 , 0.10 } . In both perturbations the branch connected to the high-mutation equilibrium bends towards the owner-Hawk convention, the bourgeois convention of the biological literature, and the owner-Dove convention survives only below a saddle-node. Locating the saddle-node by bisection on the number of rest points gives M s n = 0.4827 , 0.4727 , 0.4570 , 0.4219 and 0.3783 for ε = 0.005 , 0.01 , 0.02 , 0.05 and 0.10 , so that the displacement M c − M s n divided by ε 2 / 3 equals 0.591 , 0.588 , 0.584 , 0.575 and 0.565 : constant to within a slowly varying correction, confirming the two-thirds law. For the exploration bias the displacements are 0.0266 , 0.0414 , 0.0636 and 0.1087 for η = 0.005 , 0.01 , 0.02 and 0.05 , with the same exponent and a larger prefactor: a bias of two percent in what owners explore has an effect on the bifurcation diagram comparable to a payoff premium of about eight percent. In the language of conventions, small asymmetries do not create the conventions, which exist by symmetry breaking alone; they select between them, and they open a window of mutation rates in which only the favoured convention exists.

3.7. Finite Populations

The deterministic dynamic is the large-population limit of stochastic processes, and it is natural to ask which of its symmetry-breaking predictions survive at finite size [43]. We consider a Wright-Fisher process with two role-specific subpopulations of N individuals each [44]. In every generation each individual of role I is replaced by an offspring whose parent is drawn from role I with probability proportional to x i 1 + β   A y i , where β > 0 is the selection intensity and y the current composition of role II; the offspring then mutates with probability u to a strategy drawn uniformly at random. Role II is updated in the same way against x . The expected change of x i over one generation is 1 − u x i f i / f ‾ − x i + u 1 / n − x i with f i = 1 + β A y i , so that to first order in β and u
E Δ x i = β   x i A y i − x ⊤ A y + u 1 n − x i ,
and in the time unit of 1 / β generations the drift is the role-conditioned replicator-mutator field with
M = u β .
We simulated the Hawk-Dove game V = 2 , C = 4 with β = 0.1 and u = 0.025 , hence M = 0.25 < M c , for which the deterministic conventions are x H − y H = ± 1 − M / M c = ± 0.7071 . Figure 6 and Table 4 report the results. For every N the process spends most of its time near one of the two conventions and switches between them at random times, so that the stationary distribution is bimodal and symmetric under the role swap. The mean lifetime of a convention, measured as the mean time between crossings of the levels ± 0.2 , grows from 152 generations at N = 25 to 2266 at N = 200 and 28 , 421 at N = 400 ; at N = 800 no switch occurred in 10 6 generations. Between N = 100 and N = 400 the logarithm of the lifetime grows linearly in N with slope 0.013 per individual, the signature of a large-deviation escape over the saddle on the diagonal. The time-averaged distance x H − y H from the diagonal is 0.60 – 0.66 , below the deterministic value because of sampling noise around the conventions and time spent in transit.
In finite populations, then, the symmetry broken in the deterministic limit is restored in the long run, in the sense that the invariant distribution of the process is invariant under the role swap and the time average of x H − y H is zero, while the typical state of the population at any moment is a convention. Which of the two conventions is in force is a matter of history, and the length of that history grows exponentially with the population size. The finite-population picture thus reconciles the symmetric prediction of the stochastic model with the broken symmetry of the deterministic one in the same way as a finite ferromagnet reconciles its zero average magnetisation with the ordered states it actually occupies. It also connects the present analysis to the stochastic evolution of conventions in the sense of Young and of Kandori, Mailath and Rob [31,45]: in those models rare mutations drive transitions between conventions and select the risk-dominant one; here, by symmetry, the two conventions are equally stochastically stable, and it is the forced symmetry breaking of Section 3.6 that decides which of them the population inhabits most of the time.

4. Discussion

The results of this paper rest on one observation, that the role game of a symmetric game has more symmetry than a generic bimatrix game, and on one computation, the block decomposition of Lemma 2. Everything else is a consequence. The mirror theorem says that role information does not merely destabilise a mixed evolutionarily stable state, as Selten’s theorem asserts, but destabilises it with a precise exchange rate: every unit of attraction in the role-blind game becomes a unit of repulsion in the role game, direction by direction. Uniform mutation is the natural symmetry-preserving perturbation, and Theorem 6 turns the exchange rate into a threshold: for games whose barycentre is an equilibrium the role-conditioned equilibrium is stable exactly when the exploration rate exceeds the fastest attraction rate of the role-blind equilibrium. The closed forms of Proposition 8 show that away from the barycentre the threshold is larger still, because mutation moves the equilibrium towards the centre and thereby strengthens the cross-population coupling that drives the instability. The equivariant dichotomy of Theorem 11 classifies what appears below the threshold: static conventions when the critical mode is real, anti-phase cycles when it is complex, and never the second in two-strategy games.
These results sit naturally alongside three existing lines of work. Bauer, Broom and Alonso established the general theory of mutation limits for multi-population replicator-mutator dynamics, including the fact that large mutation stabilises a unique equilibrium and that a Nash equilibrium can be a limit of asymptotically stable mutation equilibria only if the mutation-free Jacobian has no eigenvalue with positive real part [18]. For symmetric games in roles, Theorem 4 shows that this necessary condition fails at every mixed evolutionarily stable state, since the transverse spectrum is the negative of a stable spectrum, and Theorem 6 gives the exact mutation rate at which stability sets in; the supremum bound of their Lemma 3.8 becomes an equality at the barycentre. Hofbauer and Hopkins showed that a mixed equilibrium of a bimatrix game is stable under all perturbed best-response dynamics if and only if the game is linearly equivalent to a zero-sum game [19]; Corollary 7(iii) is the replicator-mutator analogue for role games, and the rest of Corollary 7 quantifies the non-zero-sum case. Finally, the Hopf bifurcations found by Mobilia and by Toupo and Strogatz in the one-population rock-paper-scissors game with mutation [23,24] are, in our notation, bifurcations of the role-blind block when l > w . Proposition 12 shows that the role-conditioned game has a second Hopf bifurcation, in the transverse block, that occurs precisely in the complementary regime w > l in which the one-population game is stably mixed, and that its cycles have a symmetry the one-population cycles cannot have: the two roles run through the same cycle half a period apart. Whether the two Hopf bifurcations interact when w and l are close, producing mode interactions of the type studied in equivariant bifurcation theory [26], is an interesting question that we leave open.
The interpretation in terms of conventions deserves a word. Hume argued that property is a convention that arises from repeated interaction without any promise or contract, and Sugden, Young, Skyrms and Gintis have given that argument an evolutionary form in which the convention “the possessor keeps it” emerges because it coordinates expectations [28,29,30,31,32,33]. The present analysis adds a quantitative dimension. Above the threshold, owners and intruders are indistinguishable in their behaviour, each escalating with the same frequency p M , and contests are settled by force in a fraction p M 2 of encounters; this is the symmetric state that Hobbes described as the war of all against all [46]. Below the threshold a convention forms, and in the centred Hawk-Dove game the fraction of encounters that end in a fight drops from 1 / 4 to M / 4 M c , since at the conventions x H y H = 1 / 4 − ξ 2 = M / 4 M c by Equation (20). Symmetry breaking is therefore efficient in the strict sense that the average payoff rises, and the size of the gain is governed by how far the exploration rate lies below the critical one. The convention that forms is not determined by the symmetric model, and Section 3.6 shows how little asymmetry is needed to determine it: a small premium in what owners value, or a small bias in what they explore, suffices to make the bourgeois convention the only one that exists over a window of exploration rates. This is in keeping with the biological record, in which ownership conventions are common and the anti-bourgeois convention rare [2,47].
In the learning interpretation the mutation rate is an exploration rate and the symmetric mutation equilibrium is the analogue of a quantal response or logit equilibrium [34]. Two learners who always occupy the same roles, a buyer and a seller or a server and a client, and who explore below the critical rate will not learn the mixed equilibrium of their game even if that equilibrium is evolutionarily stable for anonymous players; they will learn a convention, or, with three or more actions and a rotational component in the payoffs, they will cycle out of phase. The cycles are reminiscent of those found for logit dynamics in rock-paper-scissors games by Hommes and Ochea [35] and of the learning cycles and chaos studied by Sato and Crutchfield and by Sato, Akiyama and Farmer [16,48], but the symmetry y t = x t + T / 2 is specific to role games and is a testable signature: if the two roles of a learning system are observed to follow the same periodic pattern with a half-period lag, the underlying game is, to a good approximation, symmetric. In biology the same signature would distinguish role-driven cycles from the one-population cycles of cyclic dominance observed in side-blotched lizards and in bacterial communities [36,37].
The analysis has limitations that indicate directions for further work. The mutation kernel is uniform and identical in the two roles; a common non-uniform kernel would preserve the role swap and the pitchfork and Hopf scenarios of Theorem 11, but would generally break A u t A and with it the rotating-wave structure of Proposition 12, while role-specific kernels break the role swap and lead to the unfolded diagrams of Section 3.6. The two-population dynamic idealises the one-population role game by neglecting linkage between the role-specific traits; on the Wright manifold the two descriptions coincide [8,40], but linkage disequilibrium could shift the threshold. The threshold for equilibria away from the barycentre has been characterised implicitly for general n and explicitly only for n = 2 ; the inequality M c ≥ role-blind attraction rate proved for n = 2 in Proposition 8 is, we conjecture, general. The criticality of the pitchfork and Hopf bifurcations has been established numerically rather than through the cubic coefficients, which can be computed by centre-manifold reduction for particular games. Payoff-relevant asymmetries have been treated only numerically. Games with more than two roles carry the larger symmetry group A u t A × S k , whose isotropy lattice would admit partial conventions in which some roles coordinate and others do not. Finally, the finite-population results are simulations; the exponential dependence of the convention lifetime on N invites a large-deviation calculation of the escape rate over the diagonal saddle.

5. Conclusions

When a symmetric game is played in observable roles, its dynamics acquire a canonical Z 2 symmetry, and the classical results on asymmetric contests become statements about spontaneous symmetry breaking. We have shown that, without mutation, the spectrum of a mixed equilibrium in the role game is the mirror image of its spectrum in the role-blind game, so that the strength of an evolutionarily stable strategy is exactly the strength of its instability under role information. Uniform mutation is a symmetry-preserving perturbation that shifts both spectra by the same amount, and for games whose barycentre is an equilibrium the symmetric state of the role game is stable if and only if the mutation rate exceeds the fastest attraction rate of the role-blind equilibrium. For two-strategy games the critical rate, the critical position of the equilibrium and the branch of conventions are all given in closed form, the bifurcation is a supercritical pitchfork, and cycles are excluded; for three or more strategies the symmetry can also break temporally, through an equivariant Hopf bifurcation whose cycles are followed by the two roles half a period apart, as the rock-paper-scissors game illustrates. Small asymmetries between the roles select between the conventions along the universal unfolding of the pitchfork, and finite populations restore the broken symmetry in the long run through convention switches whose waiting time grows exponentially with population size. The emergence of property-like conventions, long understood as an evolutionary process, is in this light a symmetry-breaking transition with an explicit control parameter: the rate at which players explore.

Supplementary Materials

The following supporting information can be downloaded at the journal’s website: File S1, replication code (Python scripts core.py, hd_analysis.py, rps_analysis.py, rps_sym_check.py, extra_analysis.py, saddle_node.py, finite_pop.py, finite_pop2.py and make_figs.py) together with the numerical output files from which all figures and tables were produced.

Funding

This research received no external funding.

Data Availability Statement

No new empirical data were created or analysed in this study. All numerical results are reproducible from the replication code provided as Supplementary Materials, which will also be deposited in a public repository upon acceptance.

Acknowledgments

During the preparation of this manuscript, the author used Claude (Anthropic, 2026 release) for the purposes of language editing. The author has reviewed and edited the output and takes full responsibility for the content of this publication.

Conflicts of Interest

The author declares no conflicts of interest.

References

  1. Maynard Smith, J.; Parker, G.A. The logic of asymmetric contests. Anim. Behav. 1976, 24, 159–175. [Google Scholar] [CrossRef]
  2. Maynard Smith, J. Evolution and the Theory of Games; Cambridge University Press: Cambridge, UK, 1982. [Google Scholar]
  3. Hammerstein, P. The role of asymmetries in animal contests. Anim. Behav. 1981, 29, 193–205. [Google Scholar] [CrossRef]
  4. Selten, R. A note on evolutionarily stable strategies in asymmetric animal conflicts. J. Theor. Biol. 1980, 84, 93–101. [Google Scholar] [CrossRef] [PubMed]
  5. Taylor, P.D. Evolutionarily stable strategies with two types of player. J. Appl. Probab. 1979, 16, 76–83. [Google Scholar] [CrossRef]
  6. Schuster, P.; Sigmund, K.; Hofbauer, J.; Wolff, R. Selfregulation of behaviour in animal societies. II. Games between two populations without self-interaction. Biol. Cybern. 1981, 40, 9–15. [Google Scholar]
  7. Hofbauer, J.; Sigmund, K. Evolutionary Games and Population Dynamics; Cambridge University Press: Cambridge, UK, 1998. [Google Scholar]
  8. Cressman, R. Evolutionary Dynamics and Extensive Form Games; MIT Press: Cambridge, MA, USA, 2003. [Google Scholar]
  9. Eshel, I.; Akin, E. Coevolutionary instability of mixed Nash solutions. J. Math. Biol. 1983, 18, 123–133. [Google Scholar] [CrossRef] [PubMed]
  10. Hofbauer, J. Evolutionary dynamics for bimatrix games: A Hamiltonian system? J. Math. Biol. 1996, 34, 675–688. [Google Scholar] [CrossRef]
  11. Hadeler, K.P. Stable polymorphisms in a selection model with mutation. SIAM J. Appl. Math. 1981, 41, 1–7. [Google Scholar] [CrossRef]
  12. Hofbauer, J. The selection mutation equation. J. Math. Biol. 1985, 23, 41–53. [Google Scholar] [CrossRef] [PubMed]
  13. Page, K.M.; Nowak, M.A. Unifying evolutionary dynamics. J. Theor. Biol. 2002, 219, 93–98. [Google Scholar] [CrossRef]
  14. Komarova, N.L. Replicator–mutator equation, universality property and population dynamics of learning. J. Theor. Biol. 2004, 230, 227–239. [Google Scholar] [CrossRef] [PubMed]
  15. Börgers, T.; Sarin, R. Learning through reinforcement and replicator dynamics. J. Econ. Theory 1997, 77, 1–14. [Google Scholar] [CrossRef]
  16. Sato, Y.; Crutchfield, J.P. Coupled replicator equations for the dynamics of learning in multiagent systems. Phys. Rev. E 2003, 67, 015206. [Google Scholar] [CrossRef] [PubMed]
  17. Tuyls, K.; Verbeeck, K.; Lenaerts, T. A selection-mutation model for Q-learning in multi-agent systems. In Proceedings of the Second International Joint Conference on Autonomous Agents and Multiagent Systems (AAMAS 2003), Melbourne, Australia, 14–18 July 2003; pp. 693–700. [Google Scholar]
  18. Bauer, J.; Broom, M.; Alonso, E. The stabilization of equilibria in evolutionary game dynamics through mutation: Mutation limits in evolutionary games. Proc. R. Soc. A 2019, 475, 20190355. [Google Scholar] [CrossRef] [PubMed]
  19. Hofbauer, J.; Hopkins, E. Learning in perturbed asymmetric games. Games Econ. Behav. 2005, 52, 133–152. [Google Scholar] [CrossRef]
  20. Fudenberg, D.; Kreps, D.M. Learning mixed equilibria. Games Econ. Behav. 1993, 5, 320–367. [Google Scholar] [CrossRef]
  21. Ellison, G.; Fudenberg, D. Learning purified mixed equilibria. J. Econ. Theory 2000, 90, 84–115. [Google Scholar] [CrossRef]
  22. Echenique, F.; Edlin, A. Mixed equilibria are unstable in games of strategic complements. J. Econ. Theory 2004, 118, 61–79. [Google Scholar] [CrossRef]
  23. Mobilia, M. Oscillatory dynamics in rock–paper–scissors games with mutations. J. Theor. Biol. 2010, 264, 1–10. [Google Scholar] [CrossRef] [PubMed]
  24. Toupo, D.F.P.; Strogatz, S.H. Nonlinear dynamics of the rock–paper–scissors game with mutations. Phys. Rev. E 2015, 91, 052907. [Google Scholar] [CrossRef] [PubMed]
  25. Golubitsky, M.; Schaeffer, D.G. Singularities and Groups in Bifurcation Theory, Volume I; Applied Mathematical Sciences 51; Springer: New York, NY, USA, 1985. [Google Scholar]
  26. Golubitsky, M.; Stewart, I.; Schaeffer, D.G. Singularities and Groups in Bifurcation Theory, Volume II; Applied Mathematical Sciences 69; Springer: New York, NY, USA, 1988. [Google Scholar]
  27. Golubitsky, M.; Stewart, I. The Symmetry Perspective: From Equilibrium to Chaos in Phase Space and Physical Space; Progress in Mathematics 200; Birkhäuser: Basel, Switzerland, 2002. [Google Scholar]
  28. Hume, D. A Treatise of Human Nature; Norton, D.F., Norton, M.J., Eds.; Oxford University Press: Oxford, UK, 2000. (original work published 1739–1740). [Google Scholar]
  29. Sugden, R. The Economics of Rights, Co-operation and Welfare; Basil Blackwell: Oxford, UK, 1986. [Google Scholar]
  30. Sugden, R. Spontaneous order. J. Econ. Perspect. 1989, 3, 85–97. [Google Scholar] [CrossRef]
  31. Young, H.P. The evolution of conventions. Econometrica 1993, 61, 57–84. [Google Scholar] [CrossRef]
  32. Skyrms, B. Evolution of the Social Contract; Cambridge University Press: Cambridge, UK, 1996. [Google Scholar]
  33. Gintis, H. The evolution of private property. J. Econ. Behav. Organ. 2007, 64, 1–16. [Google Scholar] [CrossRef]
  34. McKelvey, R.D.; Palfrey, T.R. Quantal response equilibria for normal form games. Games Econ. Behav. 1995, 10, 6–38. [Google Scholar] [CrossRef]
  35. Hommes, C.H.; Ochea, M.I. Multiple equilibria and limit cycles in evolutionary games with logit dynamics. Games Econ. Behav. 2012, 74, 434–441. [Google Scholar] [CrossRef]
  36. Sinervo, B.; Lively, C.M. The rock–paper–scissors game and the evolution of alternative male strategies. Nature 1996, 380, 240–243. [Google Scholar] [CrossRef]
  37. Kerr, B.; Riley, M.A.; Feldman, M.W.; Bohannan, B.J.M. Local dispersal promotes biodiversity in a real-life game of rock–paper–scissors. Nature 2002, 418, 171–174. [Google Scholar] [CrossRef] [PubMed]
  38. Taylor, P.D.; Jonker, L.B. Evolutionarily stable strategies and game dynamics. Math. Biosci. 1978, 40, 145–156. [Google Scholar] [CrossRef]
  39. Hofbauer, J.; Schuster, P.; Sigmund, K. A note on evolutionary stable strategies and game dynamics. J. Theor. Biol. 1979, 81, 609–612. [Google Scholar] [CrossRef] [PubMed]
  40. Gaunersdorfer, A.; Hofbauer, J.; Sigmund, K. On the dynamics of asymmetric games. Theor. Popul. Biol. 1991, 39, 345–357. [Google Scholar] [CrossRef]
  41. Shahshahani, S. A new mathematical framework for the study of linkage and selection. Mem. Am. Math. Soc. 1979, 211. [Google Scholar]
  42. Perko, L. Differential Equations and Dynamical Systems, 3rd ed.; Texts in Applied Mathematics 7; Springer: New York, NY, USA, 2001. [Google Scholar]
  43. Traulsen, A.; Claussen, J.C.; Hauert, C. Coevolutionary dynamics: From finite to infinite populations. Phys. Rev. Lett. 2005, 95, 238701. [Google Scholar] [CrossRef] [PubMed]
  44. Ewens, W.J. Mathematical Population Genetics I: Theoretical Introduction, 2nd ed.; Springer: New York, NY, USA, 2004. [Google Scholar]
  45. Kandori, M.; Mailath, G.J.; Rob, R. Learning, mutation, and long run equilibria in games. Econometrica 1993, 61, 29–56. [Google Scholar] [CrossRef]
  46. Hobbes, T. Leviathan; Tuck, R., Ed.; Cambridge University Press: Cambridge, UK, 1996. (original work published 1651). [Google Scholar]
  47. Mesterton-Gibbons, M. Ecotypic variation in the asymmetric Hawk-Dove game: When is Bourgeois an evolutionarily stable strategy? Evol. Ecol. 1992, 6, 198–222. [Google Scholar] [CrossRef]
  48. Sato, Y.; Akiyama, E.; Farmer, J.D. Chaos in learning a simple two-person game. Proc. Natl. Acad. Sci. USA 2002, 99, 4748–4751. [Google Scholar] [CrossRef] [PubMed]
Figure 1. Phase portraits of the role-conditioned replicator-mutator dynamic for the Hawk-Dove game with V = 2 and C = 4 , for which M c = 1 / 2 . Filled circles are sinks, the open square is a saddle, and the dashed line is the fixed-point subspace F i x σ . (a) M = 0.2 : the symmetric state is a saddle and the flow converges to one of two role conventions exchanged by the role swap. (b) M = 0.7 : the symmetric state is the unique attractor.
Figure 1. Phase portraits of the role-conditioned replicator-mutator dynamic for the Hawk-Dove game with V = 2 and C = 4 , for which M c = 1 / 2 . Filled circles are sinks, the open square is a saddle, and the dashed line is the fixed-point subspace F i x σ . (a) M = 0.2 : the symmetric state is a saddle and the flow converges to one of two role conventions exchanged by the role swap. (b) M = 0.7 : the symmetric state is the unique attractor.
Preprints 235529 g001
Figure 2. (a) Rest points of the Hawk-Dove game ( V = 2 , C = 4 ) as functions of M , plotted as the difference between the Hawk frequencies in the two roles: filled circles are numerically determined sinks, open circles saddles, and the solid curve is the closed form ± 1 − M / M c of Proposition 9. (b) The two eigenvalues at the symmetric state: the transverse eigenvalue λ ⊥ = M c − M and the role-blind eigenvalue λ ∥ = − M c + M are mirror images at M = 0 (Theorem 4) and are shifted in parallel by mutation (Theorem 6).
Figure 2. (a) Rest points of the Hawk-Dove game ( V = 2 , C = 4 ) as functions of M , plotted as the difference between the Hawk frequencies in the two roles: filled circles are numerically determined sinks, open circles saddles, and the solid curve is the closed form ± 1 − M / M c of Proposition 9. (b) The two eigenvalues at the symmetric state: the transverse eigenvalue λ ⊥ = M c − M and the role-blind eigenvalue λ ∥ = − M c + M are mirror images at M = 0 (Theorem 4) and are shifted in parallel by mutation (Theorem 6).
Preprints 235529 g002
Figure 3. (a) Critical exploration rate M c of Proposition 8 for two-strategy anti-coordination games, in units of s = a + d , as a function of the mixed equilibrium p * (solid line), compared with the role-blind attraction rate s   p * 1 − p * (dashed line) and with thresholds determined numerically for Hawk-Dove games (circles). (b) The position p c of the diagonal rest point at M = M c , Equation (16), lies strictly between p * and 1 / 2 .
Figure 3. (a) Critical exploration rate M c of Proposition 8 for two-strategy anti-coordination games, in units of s = a + d , as a function of the mixed equilibrium p * (solid line), compared with the role-blind attraction rate s   p * 1 − p * (dashed line) and with thresholds determined numerically for Hawk-Dove games (circles). (b) The position p c of the diagonal rest point at M = M c , Equation (16), lies strictly between p * and 1 / 2 .
Preprints 235529 g003
Figure 4. Rock-paper-scissors in roles with w = 1 and l = 0.5 , for which M c = 1 / 12 and T c = 14.51 . (a) Frequencies of strategy 1 in the two roles at M = 0.06 : the roles follow the same cycle half a period apart. (b) The three strategy frequencies in role I: each is the preceding one delayed by one third of the period, a discrete rotating wave. (c) Squared amplitude of x 1 − y 1 on the attracting cycle as a function of M , with a linear fit over 0.07 ≤ M < M c ; the amplitude vanishes like M c − M , the signature of a supercritical Hopf bifurcation.
Figure 4. Rock-paper-scissors in roles with w = 1 and l = 0.5 , for which M c = 1 / 12 and T c = 14.51 . (a) Frequencies of strategy 1 in the two roles at M = 0.06 : the roles follow the same cycle half a period apart. (b) The three strategy frequencies in role I: each is the preceding one delayed by one third of the period, a discrete rotating wave. (c) Squared amplitude of x 1 − y 1 on the attracting cycle as a function of M , with a linear fit over 0.07 ≤ M < M c ; the amplitude vanishes like M c − M , the signature of a supercritical Hopf bifurcation.
Preprints 235529 g004
Figure 5. Forced symmetry breaking in the Hawk-Dove game ( V = 2 , C = 4 ) when role I values the resource at V I = 1 + ε V . Rest points as functions of M for ε = 0 (grey), ε = 0.02 (blue) and ε = 0.10 (orange); filled circles are sinks and open circles saddles. The pitchfork unfolds: the branch connected to the unique high-mutation equilibrium bends towards the owner-Hawk (bourgeois) convention, while the owner-Dove convention is born in a saddle-node bifurcation at a lower mutation rate.
Figure 5. Forced symmetry breaking in the Hawk-Dove game ( V = 2 , C = 4 ) when role I values the resource at V I = 1 + ε V . Rest points as functions of M for ε = 0 (grey), ε = 0.02 (blue) and ε = 0.10 (orange); filled circles are sinks and open circles saddles. The pitchfork unfolds: the branch connected to the unique high-mutation equilibrium bends towards the owner-Hawk (bourgeois) convention, while the owner-Dove convention is born in a saddle-node bifurcation at a lower mutation rate.
Preprints 235529 g005
Figure 6. Wright-Fisher process with two role-specific subpopulations of size N for the Hawk-Dove game ( V = 2 , C = 4 ) with β = 0.1 and u = 0.025 , so that M = u / β = 0.25 < M c . (a,b) Difference between the Hawk frequencies in the two roles for N = 100 and N = 400 ; dotted lines mark the deterministic conventions ± 1 − M / M c = ± 0.707 . (c) Mean lifetime of a convention between switches, in generations, against N on a semi-logarithmic scale.
Figure 6. Wright-Fisher process with two role-specific subpopulations of size N for the Hawk-Dove game ( V = 2 , C = 4 ) with β = 0.1 and u = 0.025 , so that M = u / β = 0.25 < M c . (a,b) Difference between the Hawk frequencies in the two roles for N = 100 and N = 400 ; dotted lines mark the deterministic conventions ± 1 − M / M c = ± 0.707 . (c) Mean lifetime of a convention between switches, in generations, against N on a semi-logarithmic scale.
Preprints 235529 g006
Table 1. Role-blind and role-conditioned stability thresholds for six symmetric games. M ∥ and M c are the smallest mutation rates above which the symmetric state b of the role-blind dynamic and the symmetric state b , b of the role-conditioned dynamic are hyperbolic sinks; q = p * 1 − p * .
Table 1. Role-blind and role-conditioned stability thresholds for six symmetric games. M ∥ and M c are the smallest mutation rates above which the symmetric state b of the role-blind dynamic and the symmetric state b , b of the role-conditioned dynamic are hyperbolic sinks; q = p * 1 − p * .
Game Role-blind spectrum at M = 0 M ∥ M c Symmetry breaking below M c
Coordination ,   a = d > 0 a / 2 a / 2 a / 2 none   transverse ;   role - blind   pitchfork   at   a / 2
Hawk - Dove ,   C = 2 V − V / 4 0 V / 4 Z 2 pitchfork: two role conventions
Anti - coordination ,   general   p * − | s | q 2 0 2 | s | q 2 / 1 + 2 q Z 2 pitchfork: two role conventions
Rock - paper - scissors ,   w > l l − w 6 ± i l + w 2 3 0 w − l / 6 equivariant Hopf: anti-phase role cycles
Rock - paper - scissors ,   l > w l − w 6 ± i l + w 2 3 l − w / 6 l − w / 6 none   transverse ;   role - blind   Hopf   at   l − w / 6
Zero-sum rock-paper-scissors ± i   l / 3 0 0 none ;   both   states   stable   for   all   M > 0
Table 2. Hawk-Dove game with V = 2 , C = 4 ( M c = 0.5 ): predictions of Proposition 9 against multi-start root finding and numerical Jacobians. The conventions are reported by the Hawk frequency in role I; the second convention is its mirror image.
Table 2. Hawk-Dove game with V = 2 , C = 4 ( M c = 0.5 ): predictions of Proposition 9 against multi-start root finding and numerical Jacobians. The conventions are reported by the Hawk frequency in role I; the second convention is its mirror image.
M Convention x H , predicted Convention x H , numerical Eigenvalues at convention, predicted / numerical Eigenvalues at symmetric state, predicted / numerical
0.10 0.947214 0.947214 − 1 , − 0.8   / − 1.0000 , − 0.8000 0.4 , − 0.6   /   0.4000 , − 0.6000
0.30 0.816228 0.816228 − 1 , − 0.4   / − 1.0000 , − 0.4000 0.2 , − 0.8   /   0.2000 , − 0.8000
0.45 0.658114 0.658114 − 1 , − 0.1   / − 1.0000 , − 0.1000 0.05 , − 0.95   /   0.0500 , − 0.9500
0.60 none none − 0.1 , − 1.1   / − 0.1000 , − 1.1000
Table 3. Rock-paper-scissors in roles, w = 1 , l = 0.5 , M c = 1 / 12 ≈ 0.08333 : squared amplitude of x 1 − y 1 on the attracting cycle, its ratio to M c − M , and the period. Above M c trajectories converge to the symmetric state.
Table 3. Rock-paper-scissors in roles, w = 1 , l = 0.5 , M c = 1 / 12 ≈ 0.08333 : squared amplitude of x 1 − y 1 on the attracting cycle, its ratio to M c − M , and the period. Above M c trajectories converge to the symmetric state.
M Squared amplitude Squared amplitude / M c − M Period T
0.030 0.6373 11.95 17.164
0.050 0.3928 11.78 15.457
0.060 0.2703 11.58 14.975
0.070 0.1504 11.28 14.666
0.075 0.0924 11.09 14.572
0.080 0.0362 10.85 14.520
0.082 0.0143 10.74 14.512
0.085 0 converges
0.100 0 converges
Table 4. Wright-Fisher process with roles, Hawk-Dove game with V = 2 , C = 4 , β = 0.1 , u = 0.025 ( M = 0.25 ). Switches are crossings between the levels x H − y H = + 0.2 and − 0.2 ; the mean lifetime is the mean time between switches; the deterministic value of x H − y H is 0.7071 .
Table 4. Wright-Fisher process with roles, Hawk-Dove game with V = 2 , C = 4 , β = 0.1 , u = 0.025 ( M = 0.25 ). Switches are crossings between the levels x H − y H = + 0.2 and − 0.2 ; the mean lifetime is the mean time between switches; the deterministic value of x H − y H is 0.7071 .
N per role Generations simulated Switches Mean lifetime (generations) Mean | x H − y H |
25 4 × 10 5 2635 152 0.643
50 4 × 10 5 1520 263 0.620
100 4 × 10 5 670 597 0.603
200 10 6 441 2266 0.624
400 10 6 35 28,421 0.649
800 10 6 0 no switch observed 0.662
Disclaimer/Publisher’s Note: The statements, opinions and data contained in all publications are solely those of the individual author(s) and contributor(s) and not of MDPI and/or the editor(s). MDPI and/or the editor(s) disclaim responsibility for any injury to people or property resulting from any ideas, methods, instructions or products referred to in the content.
Copyright: This open access article is published under a Creative Commons CC BY 4.0 license, which permit the free download, distribution, and reuse, provided that the author and preprint are cited in any reuse.