Skip to main content

Welcome to a Grasp lesson

Create a free account to keep studying and create your own study path.

Lesson 38

Replicator Dynamics and Vee Relationship Strategies

Recommended resources

Welcome to the first lesson of our new module on Evolutionary Dynamics. In our previous work on cooperative games, we focused on static stability. We asked questions like, "Given a set of payoffs, can a fully cooperative vee relationship hold together?" and "Which coalition structure—the full triad, a dyad with an outside partner, etc.—is a stable outcome for rational players?" This analysis, centered on concepts like the core, provided a powerful snapshot of a relationship's viability at a single point in time.

Today, we shift our perspective from a static snapshot to a dynamic film. Instead of analyzing a single group's rational choices, we will imagine a large population where different relationship strategies compete over time. Successful strategies will spread, while unsuccessful ones will decline. This lesson introduces the fundamental tool for modeling this process. Your goal is to model the evolution of vee relationship strategies using replicator dynamics. This will allow us to understand not just which outcomes are stable, but how a population of individuals might evolve toward or away from them.

From Rational Choice to Evolutionary Success

The core idea of evolutionary game theory is simple: strategies that perform better (i.e., yield higher payoffs or "fitness") will be adopted by more individuals in the next generation. Less successful strategies will gradually disappear. This process of selection based on frequency-dependent fitness is captured by the replicator equation.

The diagram below illustrates this iterative loop. A population with a certain mix of strategies engages in a "game," their payoffs are determined, and these payoffs influence which strategies are more prevalent in the next generation, starting the cycle anew.

This diagram shows how a population's composition at generation 'n' evolves to the composition at 'n+1'. The "Game Rules" represent the payoff matrix, and the "Replicator Rules" describe how payoffs translate into reproductive success or strategy adoption.

The mathematical formulation of this process is the replicator equation. Let's delve into its definition.

Lecture 6 Game theory and replicator dynamics

This section from Stefano Allesina's lecture notes provides a concise and clear mathematical definition of the replicator equation.

Please read the section titled "6.3 Replicator dynamics". Focus on the derivation leading to the main equation. Pay close attention to the definition of each term: p_i, the frequency of a strategy; (Ap)_i, the fitness of that strategy; and p^T A p, the average fitness of the population.

As you've just read, the replicator equation is given by:

Or, more simply:

Here's the intuition:

  • is the rate of change of the frequency of strategy .
  • means that a strategy's growth depends on how common it already is. A rare strategy, even if highly fit, will grow slowly in absolute numbers.
  • is the crucial part. It states that a strategy's frequency increases if its fitness () is greater than the average fitness of the entire population (). If its fitness is below average, its frequency will decrease.

This elegant equation models how natural selection (or social learning) would drive the evolution of strategies within a population.


Dynamic Stability: ESS and the Replicator Equation

You are already familiar with the concept of a Nash Equilibrium (NE), where no player has an incentive to unilaterally change their strategy. How does this static concept relate to our new dynamic model?

The connection is profound:

  1. Any Nash Equilibrium is an equilibrium point (a fixed point) of the replicator dynamics. At an NE, all players are playing their best response, which in this context means all active strategies have the same fitness (), so the frequencies don't change ().
  2. An Evolutionarily Stable Strategy (ESS) is a stable equilibrium point of the replicator dynamics. An ESS is a refined type of Nash Equilibrium that is robust to "invasions" by small numbers of individuals playing a different, "mutant" strategy.

This distinction between a stable and an unstable equilibrium is critical. At an unstable equilibrium, the system is technically balanced, but the slightest random nudge will send the population hurtling toward a different state. At a stable equilibrium, the system naturally corrects for small disturbances and returns to its resting point.

The following video provides an excellent visual and intuitive explanation of this difference.

Evolutionarily Stable Nash Equilibrium (vs. Unstable)

This video from the channel of Ashley Hodgson uses a simple hawk-dove game to explain the difference between evolutionarily stable and unstable Nash equilibria.

Please watch the following segments: Introduction: The first part introduces the core question in an evolutionary context. Stable vs. Unstable: This section clearly explains what it means for an equilibrium to be stable or unstable when faced with random population fluctuations. Mathematical Check: This final part demonstrates how to calculate whether a deviation from equilibrium gives an advantage to one strategy over another, thus determining stability.

The video shows that to check for stability, you test what happens when the population is slightly perturbed from the equilibrium. If the dynamics push the population back toward the equilibrium point, it's stable (an ESS). If they push it away, it's unstable.

For a more formal confirmation of the link between these concepts, you can refer back to the lecture notes.

Lecture 6 Game theory and replicator dynamics

These subsections formally demonstrate the connection between the game-theoretic concepts and the dynamic system.

Now, quickly read the two brief subsections, "6.3.1 Nash equilibria are equilibria of the RE" and "6.3.2 ESS are globally stable equilibria of the RE". Your background in statistics and mathematics will make the Lyapunov function argument in the second part straightforward to follow.


Modeling Vee Relationship Strategies

Let's apply this to our central topic. Imagine a population of non-hinge partners entering into vee relationships. Their strategic approach to being in a vee can be categorized. For simplicity, let's consider three strategies they could adopt:

  1. Accommodate (A): Be flexible with time and resources, communicate openly, and actively support the hinge's other relationship. This is a cooperative, pro-vee strategy.
  2. Compete (C): Vie for the hinge's primary attention, be demanding of resources, and view the other partner as a rival. This is a "defecting" or destabilizing strategy.
  3. Tolerate (T): Remain in the vee but act with indifference toward the other dyad, neither helping nor harming it. This is a neutral or passive strategy.

The success (payoff) of each strategy depends on the strategy of the other non-hinge partner in the vee. We can represent this with a 3x3 payoff matrix. For example, two Accommodating partners might create a very stable, high-payoff vee for both. An Accommodating partner paired with a Competing partner would result in a very low payoff for the former and a high payoff for the latter (at least temporarily). Two Competing partners would likely lead to a disastrous, low-payoff collapse of the relationship for everyone.

Once we define this payoff matrix, the replicator equation tells us how the proportions of A, C, and T strategies will evolve over time in the population. The dynamics of a three-strategy game can be visualized on a triangular phase portrait, or simplex.

These three diagrams show possible evolutionary trajectories for a three-strategy game. Each corner of the triangle represents a population composed entirely of one strategy. The arrows show how the population mix (the dot) moves over time. Panel (a) shows convergence to a stable mix of all three strategies. Panel (b) shows cyclical dynamics where the dominant strategy perpetually changes. Panel (c) shows convergence to a single, dominant strategy.

By analyzing these dynamics, we could predict, for example, whether a population of partners would evolve toward a stable state of mutual accommodation, a perpetual cycle of conflict and cooperation, or the complete dominance of a single strategy (e.g., everyone adopting the "Tolerate" strategy as the only viable long-term option).


An Extension: Replicator Dynamics on Networks

The standard replicator equation assumes a "well-mixed" population, where any individual can interact with any other. This is often unrealistic. In reality, interactions are structured by social networks. You don't just pick a partner from the entire world; you meet them through friends, communities, or other existing connections.

Happily, the replicator dynamics framework can be extended to structured populations. This is an advanced topic, but given your interest in networks, it's valuable to see the main result. The core finding is that playing a game on a network preserves the structure of the replicator equation but effectively transforms the payoff matrix.

The Replicator Equation on Graphs - DASH (Harvard)

This paper by researchers at Harvard derives the replicator equation for populations structured as a graph (a network). It's mathematically dense, but the core result is surprisingly simple and elegant. We will focus only on the main ideas, not the derivation.

First, read the Introduction (from the beginning) to understand the setup. Next, jump to the section "What we want to do in this paper...". Look at Equation (4). This is the "replicator equation on graphs". Notice it has an extra term, g_i, which represents local competition on the network. Finally, read the Discussion section at the end of the paper (the first two paragraphs). It summarizes the key finding: moving the game onto a graph is equivalent to transforming the original payoff matrix A into a new one, A+B, where B captures the effects of the network structure.

This is a powerful result. It means that the network structure itself—who is connected to whom—directly alters the evolutionary game. A strategy that might be unsuccessful in a well-mixed population could become dominant in a specific network structure, and vice-versa. For vee relationships, this suggests that the social context in which they form can fundamentally change which behavioral strategies are successful.


Conclusion

In this lesson, we transitioned from static analysis to a dynamic, evolutionary perspective. We've seen how replicator dynamics provide a mathematical foundation for understanding how relationship strategies might proliferate or decline in a population over time.

  • Key Takeaways:
    • Replicator dynamics model the evolution of strategy frequencies based on their relative fitness: .
    • Strategies with above-average fitness increase in prevalence, while those with below-average fitness decline.
    • An Evolutionarily Stable Strategy (ESS) corresponds to a stable fixed point of the replicator dynamics, meaning the system will return to this point after small perturbations.
    • We can model the evolution of vee relationship strategies (e.g., Accommodate, Compete, Tolerate) by defining a payoff matrix and analyzing the resulting dynamics.
    • Extending the model to networks shows that population structure directly modifies the effective payoffs and can alter evolutionary outcomes.

Preview of the next lesson: Now that you have the primary tool—the replicator equation—we will put it to work. In the next lesson, we will adapt archetypal games like hawk-dove to model conflict in vee relationships and identify potential Evolutionarily Stable Strategies (ESS). We will move from the general model to a specific, practical application.