Evolutionary Games with Time Constraints Vlastimil Krivan Biology - - PowerPoint PPT Presentation

evolutionary games with time constraints
SMART_READER_LITE
LIVE PREVIEW

Evolutionary Games with Time Constraints Vlastimil Krivan Biology - - PowerPoint PPT Presentation

Evolutionary Games with Time Constraints Vlastimil Krivan Biology Center and Faculty of Science University of South Bohemia Ceske Budejovice Czech Republic vlastimil.krivan@gmail.com www.entu.cas.cz/krivan Padova, 2018 Evolutionary game


slide-1
SLIDE 1

Evolutionary Games with Time Constraints

Vlastimil Krivan

Biology Center and Faculty of Science University of South Bohemia Ceske Budejovice Czech Republic vlastimil.krivan@gmail.com www.entu.cas.cz/krivan

Padova, 2018

slide-2
SLIDE 2

Evolutionary game theory

1

There are many individuals of the same species that interact pair-wise

2

There is a finite number of different strategies in the population

3

Payoffs are obtained through games animals play

4

Each individual is selfish, i.e., maximizes its own benefit which leads to the Nash equilibrium

5

All interactions take the same time independently from the strategy individuals play (Typically, one interaction per unit of time)

6

Pairs are formed instantaneously and randomly

slide-3
SLIDE 3

Evolutionary game theory

1

There are many individuals of the same species that interact pair-wise

2

There is a finite number of different strategies in the population

3

Payoffs are obtained through games animals play

4

Each individual is selfish, i.e., maximizes its own benefit which leads to the Nash equilibrium

5

All interactions take the same time independently from the strategy individuals play (Typically, one interaction per unit of time)

6

Pairs are formed instantaneously and randomly

slide-4
SLIDE 4

Evolutionary game theory

1

There are many individuals of the same species that interact pair-wise

2

There is a finite number of different strategies in the population

3

Payoffs are obtained through games animals play

4

Each individual is selfish, i.e., maximizes its own benefit which leads to the Nash equilibrium

5

All interactions take the same time independently from the strategy individuals play (Typically, one interaction per unit of time)

6

Pairs are formed instantaneously and randomly

slide-5
SLIDE 5

Evolutionary game theory

1

There are many individuals of the same species that interact pair-wise

2

There is a finite number of different strategies in the population

3

Payoffs are obtained through games animals play

4

Each individual is selfish, i.e., maximizes its own benefit which leads to the Nash equilibrium

5

All interactions take the same time independently from the strategy individuals play (Typically, one interaction per unit of time)

6

Pairs are formed instantaneously and randomly

slide-6
SLIDE 6

Evolutionary game theory

1

There are many individuals of the same species that interact pair-wise

2

There is a finite number of different strategies in the population

3

Payoffs are obtained through games animals play

4

Each individual is selfish, i.e., maximizes its own benefit which leads to the Nash equilibrium

5

All interactions take the same time independently from the strategy individuals play (Typically, one interaction per unit of time)

6

Pairs are formed instantaneously and randomly

slide-7
SLIDE 7

Evolutionary game theory

1

There are many individuals of the same species that interact pair-wise

2

There is a finite number of different strategies in the population

3

Payoffs are obtained through games animals play

4

Each individual is selfish, i.e., maximizes its own benefit which leads to the Nash equilibrium

5

All interactions take the same time independently from the strategy individuals play (Typically, one interaction per unit of time)

6

Pairs are formed instantaneously and randomly

slide-8
SLIDE 8

Hawk-Dove game (Maynard Smith and Price, 1973)

slide-9
SLIDE 9

Payoffs for two-strategy games when all interactions take the same time

Payoff matrix (entries are payoffs per interaction): e1 e2 e1 π11 π12 e2 π21 π22

  • Interaction time matrix when all interactions take single unit of time:

e1 e2 e1 1 1 e2 1 1

  • n11− number of e1e1 pairs

n12− number of e1e2 pairs n22− number of e2e2 pairs N1 = 2n11 + n12−total number of individuals playing strategy e1 N2 = 2n22 + n12−total number of individuals playing strategy e2 N = N1 + N2−total number of individuals

slide-10
SLIDE 10

Payoffs for two-strategy games when all interactions take the same time

Payoff matrix (entries are payoffs per interaction): e1 e2 e1 π11 π12 e2 π21 π22

  • Interaction time matrix when all interactions take single unit of time:

e1 e2 e1 1 1 e2 1 1

  • n11− number of e1e1 pairs

n12− number of e1e2 pairs n22− number of e2e2 pairs N1 = 2n11 + n12−total number of individuals playing strategy e1 N2 = 2n22 + n12−total number of individuals playing strategy e2 N = N1 + N2−total number of individuals

slide-11
SLIDE 11

Payoffs for two-strategy games when all interactions take the same time

Payoff matrix (entries are payoffs per interaction): e1 e2 e1 π11 π12 e2 π21 π22

  • Interaction time matrix when all interactions take single unit of time:

e1 e2 e1 1 1 e2 1 1

  • n11− number of e1e1 pairs

n12− number of e1e2 pairs n22− number of e2e2 pairs N1 = 2n11 + n12−total number of individuals playing strategy e1 N2 = 2n22 + n12−total number of individuals playing strategy e2 N = N1 + N2−total number of individuals

slide-12
SLIDE 12

Payoffs for two-strategy games when all interactions take the same time

Payoff matrix (entries are payoffs per interaction): e1 e2 e1 π11 π12 e2 π21 π22

  • Interaction time matrix when all interactions take single unit of time:

e1 e2 e1 1 1 e2 1 1

  • n11− number of e1e1 pairs

n12− number of e1e2 pairs n22− number of e2e2 pairs N1 = 2n11 + n12−total number of individuals playing strategy e1 N2 = 2n22 + n12−total number of individuals playing strategy e2 N = N1 + N2−total number of individuals

slide-13
SLIDE 13

Payoffs for two-strategy games when all interactions take the same time

Payoff matrix (entries are payoffs per interaction): e1 e2 e1 π11 π12 e2 π21 π22

  • Interaction time matrix when all interactions take single unit of time:

e1 e2 e1 1 1 e2 1 1

  • n11− number of e1e1 pairs

n12− number of e1e2 pairs n22− number of e2e2 pairs N1 = 2n11 + n12−total number of individuals playing strategy e1 N2 = 2n22 + n12−total number of individuals playing strategy e2 N = N1 + N2−total number of individuals

slide-14
SLIDE 14

Payoffs for two-strategy games when all interactions take the same time

Payoff matrix (entries are payoffs per interaction): e1 e2 e1 π11 π12 e2 π21 π22

  • Interaction time matrix when all interactions take single unit of time:

e1 e2 e1 1 1 e2 1 1

  • n11− number of e1e1 pairs

n12− number of e1e2 pairs n22− number of e2e2 pairs N1 = 2n11 + n12−total number of individuals playing strategy e1 N2 = 2n22 + n12−total number of individuals playing strategy e2 N = N1 + N2−total number of individuals

slide-15
SLIDE 15

Payoffs for two-strategy games when all interactions take the same time

Payoff matrix (entries are payoffs per interaction): e1 e2 e1 π11 π12 e2 π21 π22

  • Interaction time matrix when all interactions take single unit of time:

e1 e2 e1 1 1 e2 1 1

  • n11− number of e1e1 pairs

n12− number of e1e2 pairs n22− number of e2e2 pairs N1 = 2n11 + n12−total number of individuals playing strategy e1 N2 = 2n22 + n12−total number of individuals playing strategy e2 N = N1 + N2−total number of individuals

slide-16
SLIDE 16

Payoffs for two-strategy games when all interactions take the same time

Payoff matrix (entries are payoffs per interaction): e1 e2 e1 π11 π12 e2 π21 π22

  • Interaction time matrix when all interactions take single unit of time:

e1 e2 e1 1 1 e2 1 1

  • n11− number of e1e1 pairs

n12− number of e1e2 pairs n22− number of e2e2 pairs N1 = 2n11 + n12−total number of individuals playing strategy e1 N2 = 2n22 + n12−total number of individuals playing strategy e2 N = N1 + N2−total number of individuals

slide-17
SLIDE 17

Fitnesses are frequency dependent but density independent

Assumption: Pairs are formed instantaneously and randomly, i.e., the equilibrium distribution of pairs is given by Hardy-Weinberg distribution n11 = N1 N 2 N 2 = N1

2

2N , n12 = N1N2 N , n22 = N2

2

2N . 2n11 2n11 + n12

  • the probability an e1 strategist is paired with another e1 strategist

n12 2n11 + n12

  • the probability an e1 strategist is paired with an e2 strategist

Fitness of the first phenotype, defined as the expected payoff per interaction is W1 = 2n11 2n11 + n12 π11 + n12 2n11 + n12 π12 = N1 N π11 + N2 N π12 = p1π11 + p2π12 and similar expression W2 holds for the fitness of the e2 strategists.

Observation

The expected payoffs (fitnesses) are frequency dependent but density independent.

slide-18
SLIDE 18

Fitnesses are frequency dependent but density independent

Assumption: Pairs are formed instantaneously and randomly, i.e., the equilibrium distribution of pairs is given by Hardy-Weinberg distribution n11 = N1 N 2 N 2 = N1

2

2N , n12 = N1N2 N , n22 = N2

2

2N . 2n11 2n11 + n12

  • the probability an e1 strategist is paired with another e1 strategist

n12 2n11 + n12

  • the probability an e1 strategist is paired with an e2 strategist

Fitness of the first phenotype, defined as the expected payoff per interaction is W1 = 2n11 2n11 + n12 π11 + n12 2n11 + n12 π12 = N1 N π11 + N2 N π12 = p1π11 + p2π12 and similar expression W2 holds for the fitness of the e2 strategists.

Observation

The expected payoffs (fitnesses) are frequency dependent but density independent.

slide-19
SLIDE 19

Fitnesses are frequency dependent but density independent

Assumption: Pairs are formed instantaneously and randomly, i.e., the equilibrium distribution of pairs is given by Hardy-Weinberg distribution n11 = N1 N 2 N 2 = N1

2

2N , n12 = N1N2 N , n22 = N2

2

2N . 2n11 2n11 + n12

  • the probability an e1 strategist is paired with another e1 strategist

n12 2n11 + n12

  • the probability an e1 strategist is paired with an e2 strategist

Fitness of the first phenotype, defined as the expected payoff per interaction is W1 = 2n11 2n11 + n12 π11 + n12 2n11 + n12 π12 = N1 N π11 + N2 N π12 = p1π11 + p2π12 and similar expression W2 holds for the fitness of the e2 strategists.

Observation

The expected payoffs (fitnesses) are frequency dependent but density independent.

slide-20
SLIDE 20

Fitnesses are frequency dependent but density independent

Assumption: Pairs are formed instantaneously and randomly, i.e., the equilibrium distribution of pairs is given by Hardy-Weinberg distribution n11 = N1 N 2 N 2 = N1

2

2N , n12 = N1N2 N , n22 = N2

2

2N . 2n11 2n11 + n12

  • the probability an e1 strategist is paired with another e1 strategist

n12 2n11 + n12

  • the probability an e1 strategist is paired with an e2 strategist

Fitness of the first phenotype, defined as the expected payoff per interaction is W1 = 2n11 2n11 + n12 π11 + n12 2n11 + n12 π12 = N1 N π11 + N2 N π12 = p1π11 + p2π12 and similar expression W2 holds for the fitness of the e2 strategists.

Observation

The expected payoffs (fitnesses) are frequency dependent but density independent.

slide-21
SLIDE 21

Evolutionary games: Mathematical description of evolution by natural selection (Maynard Smith and Price, 1973)

George R. Price (1922-1975) John Maynard Smith (1920-2004)

Aim

To predict the eventual behavior of individuals in a single species without considering complex dynamical systems of evolution that may ultimately depend on many factors such as genetics, mating systems etc.

Definition

An Evolutionary Stable Strategy (ESS) is a strategy such that, if all members of a population adopt it, then no mutant strategy could invade the population under the influence of natural selection

slide-22
SLIDE 22

Evolutionary games: Mathematical description of evolution by natural selection (Maynard Smith and Price, 1973)

George R. Price (1922-1975) John Maynard Smith (1920-2004)

Aim

To predict the eventual behavior of individuals in a single species without considering complex dynamical systems of evolution that may ultimately depend on many factors such as genetics, mating systems etc.

Definition

An Evolutionary Stable Strategy (ESS) is a strategy such that, if all members of a population adopt it, then no mutant strategy could invade the population under the influence of natural selection

slide-23
SLIDE 23

Classification of possible evolutionary outcomes

e1 e2 e1 π11 π12 e2 π21 π22

  • W1 = p1π11 + p2π12,

W2 = p1π21 + p2π22

slide-24
SLIDE 24

Classification of evolutionarily stable states

1

Strategy e1 is a Nash equilibrium and evolutionarily stable (π11 > π21, π12 > π22).

0.0 0.2 0.4 0.6 0.8 1.0 0.0 0.2 0.4 0.6 0.8 1.0 p1 W1-W2

2

There exists exactly one interior NE which is also evolutionarily stable (π11 < π21, π12 > π22)

3

Strategies e1 and e2 are evolutionarily stable (π11 > π21, π22 > π12. There is an interior NE which is not evolutionarily stable.

4

Strategies e1 and e2 are evolutionarily stable (π11 > π21, π22 > π12. There is an interior NE which is not evolutionarily stable.

slide-25
SLIDE 25

Classification of evolutionarily stable states

1

Strategy e1 is a Nash equilibrium and evolutionarily stable (π11 > π21, π12 > π22).

0.0 0.2 0.4 0.6 0.8 1.0 0.0 0.2 0.4 0.6 0.8 1.0 p1 W1-W2

2

There exists exactly one interior NE which is also evolutionarily stable (π11 < π21, π12 > π22)

0.0 0.2 0.4 0.6 0.8 1.0

  • 1.0
  • 0.5

0.0 0.5 p1 W1-W2

3

Strategies e1 and e2 are evolutionarily stable (π11 > π21, π22 > π12. There is an interior NE which is not evolutionarily stable.

4

Strategies e1 and e2 are evolutionarily stable (π11 > π21, π22 > π12. There is an interior NE which is not evolutionarily stable.

slide-26
SLIDE 26

Classification of evolutionarily stable states

1

Strategy e1 is a Nash equilibrium and evolutionarily stable (π11 > π21, π12 > π22).

0.0 0.2 0.4 0.6 0.8 1.0 0.0 0.2 0.4 0.6 0.8 1.0 p1 W1-W2

2

There exists exactly one interior NE which is also evolutionarily stable (π11 < π21, π12 > π22)

0.0 0.2 0.4 0.6 0.8 1.0

  • 1.0
  • 0.5

0.0 0.5 p1 W1-W2

3

Strategies e1 and e2 are evolutionarily stable (π11 > π21, π22 > π12. There is an interior NE which is not evolutionarily stable.

0.0 0.2 0.4 0.6 0.8 1.0

  • 0.5

0.0 0.5 1.0 p1 W1-W2

4

Strategies e1 and e2 are evolutionarily stable (π11 > π21, π22 > π12. There is an interior NE which is not evolutionarily stable.

slide-27
SLIDE 27

Classification of evolutionarily stable states

1

Strategy e1 is a Nash equilibrium and evolutionarily stable (π11 > π21, π12 > π22).

0.0 0.2 0.4 0.6 0.8 1.0 0.0 0.2 0.4 0.6 0.8 1.0 p1 W1-W2

2

There exists exactly one interior NE which is also evolutionarily stable (π11 < π21, π12 > π22)

0.0 0.2 0.4 0.6 0.8 1.0

  • 1.0
  • 0.5

0.0 0.5 p1 W1-W2

3

Strategies e1 and e2 are evolutionarily stable (π11 > π21, π22 > π12. There is an interior NE which is not evolutionarily stable.

0.0 0.2 0.4 0.6 0.8 1.0

  • 0.5

0.0 0.5 1.0 p1 W1-W2

4

Strategies e1 and e2 are evolutionarily stable (π11 > π21, π22 > π12. There is an interior NE which is not evolutionarily stable.

0.0 0.2 0.4 0.6 0.8 1.0

  • 0.5
  • 0.4
  • 0.3
  • 0.2
  • 0.1

0.0 p1 W1-W2

slide-28
SLIDE 28

Classification of evolutionarily stable states

1

Strategy e1 is a Nash equilibrium and evolutionarily stable (π11 > π21, π12 > π22).

0.0 0.2 0.4 0.6 0.8 1.0 0.0 0.2 0.4 0.6 0.8 1.0 p1 W1-W2

2

There exists exactly one interior NE which is also evolutionarily stable (π11 < π21, π12 > π22)

0.0 0.2 0.4 0.6 0.8 1.0

  • 1.0
  • 0.5

0.0 0.5 p1 W1-W2

3

Strategies e1 and e2 are evolutionarily stable (π11 > π21, π22 > π12. There is an interior NE which is not evolutionarily stable.

0.0 0.2 0.4 0.6 0.8 1.0

  • 0.5

0.0 0.5 1.0 p1 W1-W2

4

Strategies e1 and e2 are evolutionarily stable (π11 > π21, π22 > π12. There is an interior NE which is not evolutionarily stable.

0.0 0.2 0.4 0.6 0.8 1.0

  • 0.5
  • 0.4
  • 0.3
  • 0.2
  • 0.1

0.0 p1 W1-W2

slide-29
SLIDE 29

Distributional dynamics when interactions take different time (Kˇ rivan and Cressman, 2017)

slide-30
SLIDE 30

Two-strategy games with interaction times

Payoff matrix: e1 e2 e1 π11 π12 e2 π21 π22

  • Interaction time matrix:

e1 e2 e1 τ11 τ12 e2 τ21 τ22

  • n11− number of e1e1 pairs

n12− number of e1e2 pairs n22− number of e2e2 pairs N1 = 2n11 + n12−total number of individuals playing strategy e1 N2 = 2n22 + n12−total number of individuals playing strategy e2 N = 2(n11 + n12 + n22)−total number of individuals

slide-31
SLIDE 31

Two-strategy games with interaction times

Payoff matrix: e1 e2 e1 π11 π12 e2 π21 π22

  • Interaction time matrix:

e1 e2 e1 τ11 τ12 e2 τ21 τ22

  • n11− number of e1e1 pairs

n12− number of e1e2 pairs n22− number of e2e2 pairs N1 = 2n11 + n12−total number of individuals playing strategy e1 N2 = 2n22 + n12−total number of individuals playing strategy e2 N = 2(n11 + n12 + n22)−total number of individuals

slide-32
SLIDE 32

Two-strategy games with interaction times

Payoff matrix: e1 e2 e1 π11 π12 e2 π21 π22

  • Interaction time matrix:

e1 e2 e1 τ11 τ12 e2 τ21 τ22

  • n11− number of e1e1 pairs

n12− number of e1e2 pairs n22− number of e2e2 pairs N1 = 2n11 + n12−total number of individuals playing strategy e1 N2 = 2n22 + n12−total number of individuals playing strategy e2 N = 2(n11 + n12 + n22)−total number of individuals

slide-33
SLIDE 33

Two-strategy games with interaction times

Payoff matrix: e1 e2 e1 π11 π12 e2 π21 π22

  • Interaction time matrix:

e1 e2 e1 τ11 τ12 e2 τ21 τ22

  • n11− number of e1e1 pairs

n12− number of e1e2 pairs n22− number of e2e2 pairs N1 = 2n11 + n12−total number of individuals playing strategy e1 N2 = 2n22 + n12−total number of individuals playing strategy e2 N = 2(n11 + n12 + n22)−total number of individuals

slide-34
SLIDE 34

Two-strategy games with interaction times

Payoff matrix: e1 e2 e1 π11 π12 e2 π21 π22

  • Interaction time matrix:

e1 e2 e1 τ11 τ12 e2 τ21 τ22

  • n11− number of e1e1 pairs

n12− number of e1e2 pairs n22− number of e2e2 pairs N1 = 2n11 + n12−total number of individuals playing strategy e1 N2 = 2n22 + n12−total number of individuals playing strategy e2 N = 2(n11 + n12 + n22)−total number of individuals

slide-35
SLIDE 35

Two-strategy games with interaction times

Payoff matrix: e1 e2 e1 π11 π12 e2 π21 π22

  • Interaction time matrix:

e1 e2 e1 τ11 τ12 e2 τ21 τ22

  • n11− number of e1e1 pairs

n12− number of e1e2 pairs n22− number of e2e2 pairs N1 = 2n11 + n12−total number of individuals playing strategy e1 N2 = 2n22 + n12−total number of individuals playing strategy e2 N = 2(n11 + n12 + n22)−total number of individuals

slide-36
SLIDE 36

Two-strategy games with interaction times

Payoff matrix: e1 e2 e1 π11 π12 e2 π21 π22

  • Interaction time matrix:

e1 e2 e1 τ11 τ12 e2 τ21 τ22

  • n11− number of e1e1 pairs

n12− number of e1e2 pairs n22− number of e2e2 pairs N1 = 2n11 + n12−total number of individuals playing strategy e1 N2 = 2n22 + n12−total number of individuals playing strategy e2 N = 2(n11 + n12 + n22)−total number of individuals

slide-37
SLIDE 37

Two-strategy games with interaction times

Payoff matrix: e1 e2 e1 π11 π12 e2 π21 π22

  • Interaction time matrix:

e1 e2 e1 τ11 τ12 e2 τ21 τ22

  • n11− number of e1e1 pairs

n12− number of e1e2 pairs n22− number of e2e2 pairs N1 = 2n11 + n12−total number of individuals playing strategy e1 N2 = 2n22 + n12−total number of individuals playing strategy e2 N = 2(n11 + n12 + n22)−total number of individuals

slide-38
SLIDE 38

Pair dynamics

A pair nij splits up following a Poisson process with parameter τij, i. e., in a unit of time, the number of pairs that disband is

nij τij

Per unit of time there will be 2 n11

τ11 + n12 τ12 individuals playing strategy e1 disbanded

from pairs and 2 n22

τ22 + n12 τ12 individuals playing strategy e2 disbanded from pairs

Free individuals immediately and randomly form new pairs The total number of individuals forming new pairs is 2( n11

τ11 + n12 τ12 + n22 τ22 )

The proportion of newly formed n11 pairs among all newly formed pairs is

  • 2 n11

τ11 + n12 τ12

2( n11

τ11 + n12 τ12 + n22 τ22 )

2 To get the number of newly formed n11 pairs we multiply this proportion by the number of all newly formed pairs n11

τ11 + n12 τ12 + n22 τ22 and obtain

(2 n11

τ11 + n12 τ12 )2

4( n11

τ11 + n12 τ12 + n22 τ22 )

and similarly for the number of newly formed n12 and n22 pairs

slide-39
SLIDE 39

Pair dynamics

A pair nij splits up following a Poisson process with parameter τij, i. e., in a unit of time, the number of pairs that disband is

nij τij

Per unit of time there will be 2 n11

τ11 + n12 τ12 individuals playing strategy e1 disbanded

from pairs and 2 n22

τ22 + n12 τ12 individuals playing strategy e2 disbanded from pairs

Free individuals immediately and randomly form new pairs The total number of individuals forming new pairs is 2( n11

τ11 + n12 τ12 + n22 τ22 )

The proportion of newly formed n11 pairs among all newly formed pairs is

  • 2 n11

τ11 + n12 τ12

2( n11

τ11 + n12 τ12 + n22 τ22 )

2 To get the number of newly formed n11 pairs we multiply this proportion by the number of all newly formed pairs n11

τ11 + n12 τ12 + n22 τ22 and obtain

(2 n11

τ11 + n12 τ12 )2

4( n11

τ11 + n12 τ12 + n22 τ22 )

and similarly for the number of newly formed n12 and n22 pairs

slide-40
SLIDE 40

Pair dynamics

A pair nij splits up following a Poisson process with parameter τij, i. e., in a unit of time, the number of pairs that disband is

nij τij

Per unit of time there will be 2 n11

τ11 + n12 τ12 individuals playing strategy e1 disbanded

from pairs and 2 n22

τ22 + n12 τ12 individuals playing strategy e2 disbanded from pairs

Free individuals immediately and randomly form new pairs The total number of individuals forming new pairs is 2( n11

τ11 + n12 τ12 + n22 τ22 )

The proportion of newly formed n11 pairs among all newly formed pairs is

  • 2 n11

τ11 + n12 τ12

2( n11

τ11 + n12 τ12 + n22 τ22 )

2 To get the number of newly formed n11 pairs we multiply this proportion by the number of all newly formed pairs n11

τ11 + n12 τ12 + n22 τ22 and obtain

(2 n11

τ11 + n12 τ12 )2

4( n11

τ11 + n12 τ12 + n22 τ22 )

and similarly for the number of newly formed n12 and n22 pairs

slide-41
SLIDE 41

Pair dynamics

A pair nij splits up following a Poisson process with parameter τij, i. e., in a unit of time, the number of pairs that disband is

nij τij

Per unit of time there will be 2 n11

τ11 + n12 τ12 individuals playing strategy e1 disbanded

from pairs and 2 n22

τ22 + n12 τ12 individuals playing strategy e2 disbanded from pairs

Free individuals immediately and randomly form new pairs The total number of individuals forming new pairs is 2( n11

τ11 + n12 τ12 + n22 τ22 )

The proportion of newly formed n11 pairs among all newly formed pairs is

  • 2 n11

τ11 + n12 τ12

2( n11

τ11 + n12 τ12 + n22 τ22 )

2 To get the number of newly formed n11 pairs we multiply this proportion by the number of all newly formed pairs n11

τ11 + n12 τ12 + n22 τ22 and obtain

(2 n11

τ11 + n12 τ12 )2

4( n11

τ11 + n12 τ12 + n22 τ22 )

and similarly for the number of newly formed n12 and n22 pairs

slide-42
SLIDE 42

Pair dynamics

A pair nij splits up following a Poisson process with parameter τij, i. e., in a unit of time, the number of pairs that disband is

nij τij

Per unit of time there will be 2 n11

τ11 + n12 τ12 individuals playing strategy e1 disbanded

from pairs and 2 n22

τ22 + n12 τ12 individuals playing strategy e2 disbanded from pairs

Free individuals immediately and randomly form new pairs The total number of individuals forming new pairs is 2( n11

τ11 + n12 τ12 + n22 τ22 )

The proportion of newly formed n11 pairs among all newly formed pairs is

  • 2 n11

τ11 + n12 τ12

2( n11

τ11 + n12 τ12 + n22 τ22 )

2 To get the number of newly formed n11 pairs we multiply this proportion by the number of all newly formed pairs n11

τ11 + n12 τ12 + n22 τ22 and obtain

(2 n11

τ11 + n12 τ12 )2

4( n11

τ11 + n12 τ12 + n22 τ22 )

and similarly for the number of newly formed n12 and n22 pairs

slide-43
SLIDE 43

Pair dynamics

A pair nij splits up following a Poisson process with parameter τij, i. e., in a unit of time, the number of pairs that disband is

nij τij

Per unit of time there will be 2 n11

τ11 + n12 τ12 individuals playing strategy e1 disbanded

from pairs and 2 n22

τ22 + n12 τ12 individuals playing strategy e2 disbanded from pairs

Free individuals immediately and randomly form new pairs The total number of individuals forming new pairs is 2( n11

τ11 + n12 τ12 + n22 τ22 )

The proportion of newly formed n11 pairs among all newly formed pairs is

  • 2 n11

τ11 + n12 τ12

2( n11

τ11 + n12 τ12 + n22 τ22 )

2 To get the number of newly formed n11 pairs we multiply this proportion by the number of all newly formed pairs n11

τ11 + n12 τ12 + n22 τ22 and obtain

(2 n11

τ11 + n12 τ12 )2

4( n11

τ11 + n12 τ12 + n22 τ22 )

and similarly for the number of newly formed n12 and n22 pairs

slide-44
SLIDE 44

Pair dynamics

dn11 dt = −n11 τ11 +

  • 2n11

τ11 + n12 τ12

2 4

  • n11

τ11 + n12 τ12 + n22 τ22

  • dn12

dt = −n12 τ12 + 2

  • 2n11

τ11 + n12 τ12 n12 τ12 + 2n22 τ22

  • 4
  • n11

τ11 + n12 τ12 + n22 τ22

  • dn22

dt = −n22 τ22 +

  • n12

τ12 + 2n22 τ22

2 4

  • n11

τ11 + n12 τ12 + n22 τ22

slide-45
SLIDE 45

Pair dynamics

dn11 dt = −n11 τ11 +

  • 2n11

τ11 + n12 τ12

2 4

  • n11

τ11 + n12 τ12 + n22 τ22

  • dn12

dt = −n12 τ12 + 2

  • 2n11

τ11 + n12 τ12 n12 τ12 + 2n22 τ22

  • 4
  • n11

τ11 + n12 τ12 + n22 τ22

  • dn22

dt = −n22 τ22 +

  • n12

τ12 + 2n22 τ22

2 4

  • n11

τ11 + n12 τ12 + n22 τ22

slide-46
SLIDE 46

Pair dynamics

dn11 dt = −n11 τ11 +

  • 2n11

τ11 + n12 τ12

2 4

  • n11

τ11 + n12 τ12 + n22 τ22

  • dn12

dt = −n12 τ12 + 2

  • 2n11

τ11 + n12 τ12 n12 τ12 + 2n22 τ22

  • 4
  • n11

τ11 + n12 τ12 + n22 τ22

  • dn22

dt = −n22 τ22 +

  • n12

τ12 + 2n22 τ22

2 4

  • n11

τ11 + n12 τ12 + n22 τ22

slide-47
SLIDE 47

Pair equilibrium

n11 τ11 =

  • 2n11

τ11 + n12 τ12

2 4

  • n11

τ11 + n12 τ12 + n22 τ22

  • n12

τ12 = 2

  • 2n11

τ11 + n12 τ12 n12 τ12 + 2n22 τ22

  • 4
  • n11

τ11 + n12 τ12 + n22 τ22

  • n22

τ22 =

  • n12

τ12 + 2n22 τ22

2 4

  • n11

τ11 + n12 τ12 + n22 τ22

,

n11 τ11 , n12 τ12 , n22 τ22 are in Hardy-Weinberg proportions, i. e.,

n11 τ11 n22 τ22 = 1 4 n12 τ12 2

slide-48
SLIDE 48

Pair equilibrium

n11 τ11 =

  • 2n11

τ11 + n12 τ12

2 4

  • n11

τ11 + n12 τ12 + n22 τ22

  • n12

τ12 = 2

  • 2n11

τ11 + n12 τ12 n12 τ12 + 2n22 τ22

  • 4
  • n11

τ11 + n12 τ12 + n22 τ22

  • n22

τ22 =

  • n12

τ12 + 2n22 τ22

2 4

  • n11

τ11 + n12 τ12 + n22 τ22

,

n11 τ11 , n12 τ12 , n22 τ22 are in Hardy-Weinberg proportions, i. e.,

n11 τ11 n22 τ22 = 1 4 n12 τ12 2

slide-49
SLIDE 49

Pair equilibrium distribution as a function of number N1 of e1 strategists

When τ 2

12 = τ11 τ22:

n11 = N1

  • τ 2

12 − τ11τ22

  • − τ 2

12 N 2 + τ12

  • N1(N1 − N)
  • τ 2

12 − τ11τ22

  • +

N

2

2 τ 2

12

2(τ 2

12 − τ11τ22)

n12 = τ 2

12 N 2 − τ12

  • N1(N1 − N)
  • τ 2

12 − τ11τ22

  • +

N

2

2 τ 2

12

τ 2

12 − τ11 τ22

n22 = N 2 − n11 − n12 When τ 2

12 = τ11 τ22:

n11 = N2

1

2N n12 = N1N2 N n22 = N2

2

2N

slide-50
SLIDE 50

Pair equilibrium distribution as a function of number N1 of e1 strategists

When τ 2

12 = τ11 τ22:

n11 = N1

  • τ 2

12 − τ11τ22

  • − τ 2

12 N 2 + τ12

  • N1(N1 − N)
  • τ 2

12 − τ11τ22

  • +

N

2

2 τ 2

12

2(τ 2

12 − τ11τ22)

n12 = τ 2

12 N 2 − τ12

  • N1(N1 − N)
  • τ 2

12 − τ11τ22

  • +

N

2

2 τ 2

12

τ 2

12 − τ11 τ22

n22 = N 2 − n11 − n12 When τ 2

12 = τ11 τ22:

n11 = N2

1

2N n12 = N1N2 N n22 = N2

2

2N

slide-51
SLIDE 51

Payoffs

slide-52
SLIDE 52

Expected payoff per unit of time

2n11 2n11 + n12

  • the probability an e1 strategist is paired with another e1 strategist

n12 2n11 + n12

  • the probability an e1 strategist is paired with an e2 strategist

The expected payoff per unit time to an e1 strategist is frequency dependent, but not a linear function of proportion p1 of e1 strategists W1 = 2n11 2n11 + n12 π11 τ11 + n12 2n11 + n12 π12 τ12 and the expected payoff to an e2 strategists is W2 = n12 n12 + 2n22 π21 τ12 + 2n22 n12 + 2n22 π22 τ22 Fitnesses W1 and W2 are non-linear functions of N1 and N2 (i.e., non-linear in frequencies p1 and p2)

slide-53
SLIDE 53

Expected payoff per unit of time

2n11 2n11 + n12

  • the probability an e1 strategist is paired with another e1 strategist

n12 2n11 + n12

  • the probability an e1 strategist is paired with an e2 strategist

The expected payoff per unit time to an e1 strategist is frequency dependent, but not a linear function of proportion p1 of e1 strategists W1 = 2n11 2n11 + n12 π11 τ11 + n12 2n11 + n12 π12 τ12 and the expected payoff to an e2 strategists is W2 = n12 n12 + 2n22 π21 τ12 + 2n22 n12 + 2n22 π22 τ22 Fitnesses W1 and W2 are non-linear functions of N1 and N2 (i.e., non-linear in frequencies p1 and p2)

slide-54
SLIDE 54

Expected payoff per unit of time

2n11 2n11 + n12

  • the probability an e1 strategist is paired with another e1 strategist

n12 2n11 + n12

  • the probability an e1 strategist is paired with an e2 strategist

The expected payoff per unit time to an e1 strategist is frequency dependent, but not a linear function of proportion p1 of e1 strategists W1 = 2n11 2n11 + n12 π11 τ11 + n12 2n11 + n12 π12 τ12 and the expected payoff to an e2 strategists is W2 = n12 n12 + 2n22 π21 τ12 + 2n22 n12 + 2n22 π22 τ22 Fitnesses W1 and W2 are non-linear functions of N1 and N2 (i.e., non-linear in frequencies p1 and p2)

slide-55
SLIDE 55

Interior Nash equilibria

Equation W1 = W2 has up to two positive solutions: p1± = n1± N = 1 2B

  • ± (π11τ22 − π22τ11)

√ A + π2

22τ 2 11+

τ22

  • 2π2

12τ11 + 2π12π21τ11 − 3π11π12τ12 − π11π21τ12 + π2 11τ22

  • −π22 (τ12 (3π12τ11 + π21 τ11 − 4π11τ12) + 2π11τ11τ22)
  • where

A = (π22τ11 − π11τ22)2 + (π12 − π21)2 τ 2

12

+ 4(π11π22τ 2

12 + π12π21τ11τ22) − 2(π12 + π21)τ12(π22τ11 + π11 τ22)

B = A − (π12 − π21)2(τ 2

12 − τ11τ22).

Observation

There are up to two interior equilibria, which contrasts with the classic result of evolutionary game theory with a single interior equilibrium.

slide-56
SLIDE 56

Classification of evolutionarily stable states under time constraints

1

Strategy e1 is stable and e2 is unstable ( π11

τ11 > π21 τ12 , π12 τ12 > π22 τ22 ): One or two ESSs.

2

Strategies e1 and e2 are unstable ( π11

τ11 < π21 τ12 , π12 τ12 > π22 τ22 ): Single interior ESSs.

3

Strategies e1 and e2 are stable ( π11

τ11 > π21 τ12 , π12 τ12 < π22 τ22 ): Two boundary ESSs.

4

Strategy e1 is unstable and e2 is stable ( π11

τ11 < π21 τ12 , π12 τ12 < π22 τ22 ): One or two ESSs.

slide-57
SLIDE 57

Classification of evolutionarily stable states under time constraints

1

Strategy e1 is stable and e2 is unstable ( π11

τ11 > π21 τ12 , π12 τ12 > π22 τ22 ): One or two ESSs.

2

Strategies e1 and e2 are unstable ( π11

τ11 < π21 τ12 , π12 τ12 > π22 τ22 ): Single interior ESSs.

3

Strategies e1 and e2 are stable ( π11

τ11 > π21 τ12 , π12 τ12 < π22 τ22 ): Two boundary ESSs.

4

Strategy e1 is unstable and e2 is stable ( π11

τ11 < π21 τ12 , π12 τ12 < π22 τ22 ): One or two ESSs.

slide-58
SLIDE 58

Classification of evolutionarily stable states under time constraints

1

Strategy e1 is stable and e2 is unstable ( π11

τ11 > π21 τ12 , π12 τ12 > π22 τ22 ): One or two ESSs.

2

Strategies e1 and e2 are unstable ( π11

τ11 < π21 τ12 , π12 τ12 > π22 τ22 ): Single interior ESSs.

3

Strategies e1 and e2 are stable ( π11

τ11 > π21 τ12 , π12 τ12 < π22 τ22 ): Two boundary ESSs.

4

Strategy e1 is unstable and e2 is stable ( π11

τ11 < π21 τ12 , π12 τ12 < π22 τ22 ): One or two ESSs.

slide-59
SLIDE 59

Classification of evolutionarily stable states under time constraints

1

Strategy e1 is stable and e2 is unstable ( π11

τ11 > π21 τ12 , π12 τ12 > π22 τ22 ): One or two ESSs.

2

Strategies e1 and e2 are unstable ( π11

τ11 < π21 τ12 , π12 τ12 > π22 τ22 ): Single interior ESSs.

3

Strategies e1 and e2 are stable ( π11

τ11 > π21 τ12 , π12 τ12 < π22 τ22 ): Two boundary ESSs.

4

Strategy e1 is unstable and e2 is stable ( π11

τ11 < π21 τ12 , π12 τ12 < π22 τ22 ): One or two ESSs.

slide-60
SLIDE 60

The Hawk-Dove game

  • H

D H V − C 2V D V

  • with

H D H τ τ D τ τ

  • 1

If V > C strategy D is dominated by H. Thus, Hawk is a strict NE (i.e., an ESS)

  • f the game.

2

If V < C there is an ESS p∗ = (p∗

1, p∗ 2) = ( V C , 1 − V C ) that satisfies

WH(p∗) = WD(p∗)

slide-61
SLIDE 61

The Hawk-Dove game

  • H

D H V − C 2V D V

  • with

H D H τ τ D τ τ

  • 1

If V > C strategy D is dominated by H. Thus, Hawk is a strict NE (i.e., an ESS)

  • f the game.

2

If V < C there is an ESS p∗ = (p∗

1, p∗ 2) = ( V C , 1 − V C ) that satisfies

WH(p∗) = WD(p∗)

slide-62
SLIDE 62

The Hawk-Dove game with time constraints

  • H

D H V − C 2V D V

  • H

D H τ11 τ D τ τ

  • =
  • τ11

1 1 1

slide-63
SLIDE 63

The Hawk-Dove game with time constraints

  • H

D H V − C 2V D V

  • H

D H τ11 τ D τ τ

  • =
  • τ11

1 1 1

slide-64
SLIDE 64

Prisoner’s dilemma (single shot game)

C−cooperate D−defect b = benefit of cooperation c = cost of cooperation

  • C

D C b − c −c D b

  • 1

Defection is the only Nash equilibrium

2

Cooperation provides higher payoff when b > c

Question

How can cooperation evolve?

slide-65
SLIDE 65

Prisoner’s dilemma (single shot game)

C−cooperate D−defect b = benefit of cooperation c = cost of cooperation

  • C

D C b − c −c D b

  • 1

Defection is the only Nash equilibrium

2

Cooperation provides higher payoff when b > c

Question

How can cooperation evolve?

slide-66
SLIDE 66

Prisoner’s dilemma (single shot game)

C−cooperate D−defect b = benefit of cooperation c = cost of cooperation

  • C

D C b − c −c D b

  • 1

Defection is the only Nash equilibrium

2

Cooperation provides higher payoff when b > c

Question

How can cooperation evolve?

slide-67
SLIDE 67

Repeated games: Prisoner’s dilemma

ρ = probability the game is played next time 1 1 − ρ =expected number of rounds τij =the expected number of rounds between ei and ej strategists πij =payoff to strategy ei when played against strategy ej in a single-shot game Payoff per interaction between two players (i.e., when single shot games are repeated several (τij) times):

  • C

D C (b − c)τ11 −cτ12 D bτ12

  • Payoff per unit of time, Wi, to strategy ei are now given by

W1 = 2n11 2n11 + n12 (b − c) − n12 2n11 + n12 c, W2 = n12 2n22 + n12 b

slide-68
SLIDE 68

Repeated games: Prisoner’s dilemma

ρ = probability the game is played next time 1 1 − ρ =expected number of rounds τij =the expected number of rounds between ei and ej strategists πij =payoff to strategy ei when played against strategy ej in a single-shot game Payoff per interaction between two players (i.e., when single shot games are repeated several (τij) times):

  • C

D C (b − c)τ11 −cτ12 D bτ12

  • Payoff per unit of time, Wi, to strategy ei are now given by

W1 = 2n11 2n11 + n12 (b − c) − n12 2n11 + n12 c, W2 = n12 2n22 + n12 b

slide-69
SLIDE 69

Repeated games: Prisoner’s dilemma

ρ = probability the game is played next time 1 1 − ρ =expected number of rounds τij =the expected number of rounds between ei and ej strategists πij =payoff to strategy ei when played against strategy ej in a single-shot game Payoff per interaction between two players (i.e., when single shot games are repeated several (τij) times):

  • C

D C (b − c)τ11 −cτ12 D bτ12

  • Payoff per unit of time, Wi, to strategy ei are now given by

W1 = 2n11 2n11 + n12 (b − c) − n12 2n11 + n12 c, W2 = n12 2n22 + n12 b

slide-70
SLIDE 70

Repeated games: Prisoner’s dilemma

ρ = probability the game is played next time 1 1 − ρ =expected number of rounds τij =the expected number of rounds between ei and ej strategists πij =payoff to strategy ei when played against strategy ej in a single-shot game Payoff per interaction between two players (i.e., when single shot games are repeated several (τij) times):

  • C

D C (b − c)τ11 −cτ12 D bτ12

  • Payoff per unit of time, Wi, to strategy ei are now given by

W1 = 2n11 2n11 + n12 (b − c) − n12 2n11 + n12 c, W2 = n12 2n22 + n12 b

slide-71
SLIDE 71

Repeated games: Prisoner’s dilemma

ρ = probability the game is played next time 1 1 − ρ =expected number of rounds τij =the expected number of rounds between ei and ej strategists πij =payoff to strategy ei when played against strategy ej in a single-shot game Payoff per interaction between two players (i.e., when single shot games are repeated several (τij) times):

  • C

D C (b − c)τ11 −cτ12 D bτ12

  • Payoff per unit of time, Wi, to strategy ei are now given by

W1 = 2n11 2n11 + n12 (b − c) − n12 2n11 + n12 c, W2 = n12 2n22 + n12 b

slide-72
SLIDE 72

Repeated games: Prisoner’s dilemma

ρ = probability the game is played next time 1 1 − ρ =expected number of rounds τij =the expected number of rounds between ei and ej strategists πij =payoff to strategy ei when played against strategy ej in a single-shot game Payoff per interaction between two players (i.e., when single shot games are repeated several (τij) times):

  • C

D C (b − c)τ11 −cτ12 D bτ12

  • Payoff per unit of time, Wi, to strategy ei are now given by

W1 = 2n11 2n11 + n12 (b − c) − n12 2n11 + n12 c, W2 = n12 2n22 + n12 b

slide-73
SLIDE 73

Repeated Prisoner’s dilemma (Opting-out game; Zhang et al., 2016), b = 2, c = 1, τ12 = τ22 = 1 (Kˇ rivan and Cressman, 2017)

Prisoner’s dilemma payoff matrix (single shot game) C D C 1 −1 D 2

  • Prisoner’s dilemma payoff matrix

(repeated game)

  • C

D C (b − c)τ11 −cτ12 D bτ12

  • =
  • τ11

−1 2

slide-74
SLIDE 74

Repeated Prisoner’s dilemma (Opting-out game; Zhang et al., 2016), b = 2, c = 1, τ12 = τ22 = 1 (Kˇ rivan and Cressman, 2017)

Prisoner’s dilemma payoff matrix (single shot game) C D C 1 −1 D 2

  • Prisoner’s dilemma payoff matrix

(repeated game)

  • C

D C (b − c)τ11 −cτ12 D bτ12

  • =
  • τ11

−1 2

slide-75
SLIDE 75

Distributional dynamics when pairing is non-instantaneous (Kˇ rivan et al., In review)

slide-76
SLIDE 76

Distributional dynamics of singles and pairs

n1 =# of singles using strategy e1 n2 =# of singles using strategy e2 Distributional dynamics at fixed population numbers: e1 singles: dn1 dt = −λn2

1 − λn1n2 + 2n11

τ11 + n12 τ12 e2 singles: dn2 dt = −λn2

2 − λn1n2 + 2n22

τ22 + n12 τ12 e1e1 pairs: dn11 dt = −n11 τ11 + λ 2 n2

1

e1e2 pairs: dn12 dt = −n12 τ12 + λn1n2 e2e2 pairs: dn22 dt = −n22 τ22 + λ 2 n2

2

HW distribution at the population equilibrium: n11 = 1 2λτ11n2

1, n12 =

λτ12n1n2, n22 = 1 2λτ22n2

2

slide-77
SLIDE 77

Distributional dynamics of singles and pairs

n1 =# of singles using strategy e1 n2 =# of singles using strategy e2 Distributional dynamics at fixed population numbers: e1 singles: dn1 dt = −λn2

1 − λn1n2 + 2n11

τ11 + n12 τ12 e2 singles: dn2 dt = −λn2

2 − λn1n2 + 2n22

τ22 + n12 τ12 e1e1 pairs: dn11 dt = −n11 τ11 + λ 2 n2

1

e1e2 pairs: dn12 dt = −n12 τ12 + λn1n2 e2e2 pairs: dn22 dt = −n22 τ22 + λ 2 n2

2

HW distribution at the population equilibrium: n11 = 1 2λτ11n2

1, n12 =

λτ12n1n2, n22 = 1 2λτ22n2

2

slide-78
SLIDE 78

Distributional dynamics of singles and pairs

n1 =# of singles using strategy e1 n2 =# of singles using strategy e2 Distributional dynamics at fixed population numbers: e1 singles: dn1 dt = −λn2

1 − λn1n2 + 2n11

τ11 + n12 τ12 e2 singles: dn2 dt = −λn2

2 − λn1n2 + 2n22

τ22 + n12 τ12 e1e1 pairs: dn11 dt = −n11 τ11 + λ 2 n2

1

e1e2 pairs: dn12 dt = −n12 τ12 + λn1n2 e2e2 pairs: dn22 dt = −n22 τ22 + λ 2 n2

2

HW distribution at the population equilibrium: n11 = 1 2λτ11n2

1, n12 =

λτ12n1n2, n22 = 1 2λτ22n2

2

slide-79
SLIDE 79

Distributional dynamics of singles and pairs

n1 =# of singles using strategy e1 n2 =# of singles using strategy e2 Distributional dynamics at fixed population numbers: e1 singles: dn1 dt = −λn2

1 − λn1n2 + 2n11

τ11 + n12 τ12 e2 singles: dn2 dt = −λn2

2 − λn1n2 + 2n22

τ22 + n12 τ12 e1e1 pairs: dn11 dt = −n11 τ11 + λ 2 n2

1

e1e2 pairs: dn12 dt = −n12 τ12 + λn1n2 e2e2 pairs: dn22 dt = −n22 τ22 + λ 2 n2

2

HW distribution at the population equilibrium: n11 = 1 2λτ11n2

1, n12 =

λτ12n1n2, n22 = 1 2λτ22n2

2

slide-80
SLIDE 80

Distributional dynamics of singles and pairs

n1 =# of singles using strategy e1 n2 =# of singles using strategy e2 Distributional dynamics at fixed population numbers: e1 singles: dn1 dt = −λn2

1 − λn1n2 + 2n11

τ11 + n12 τ12 e2 singles: dn2 dt = −λn2

2 − λn1n2 + 2n22

τ22 + n12 τ12 e1e1 pairs: dn11 dt = −n11 τ11 + λ 2 n2

1

e1e2 pairs: dn12 dt = −n12 τ12 + λn1n2 e2e2 pairs: dn22 dt = −n22 τ22 + λ 2 n2

2

HW distribution at the population equilibrium: n11 = 1 2λτ11n2

1, n12 =

λτ12n1n2, n22 = 1 2λτ22n2

2

slide-81
SLIDE 81

Distributional dynamics of singles and pairs

n1 =# of singles using strategy e1 n2 =# of singles using strategy e2 Distributional dynamics at fixed population numbers: e1 singles: dn1 dt = −λn2

1 − λn1n2 + 2n11

τ11 + n12 τ12 e2 singles: dn2 dt = −λn2

2 − λn1n2 + 2n22

τ22 + n12 τ12 e1e1 pairs: dn11 dt = −n11 τ11 + λ 2 n2

1

e1e2 pairs: dn12 dt = −n12 τ12 + λn1n2 e2e2 pairs: dn22 dt = −n22 τ22 + λ 2 n2

2

HW distribution at the population equilibrium: n11 = 1 2λτ11n2

1, n12 =

λτ12n1n2, n22 = 1 2λτ22n2

2

slide-82
SLIDE 82

Distributional dynamics of singles and pairs

n1 =# of singles using strategy e1 n2 =# of singles using strategy e2 Distributional dynamics at fixed population numbers: e1 singles: dn1 dt = −λn2

1 − λn1n2 + 2n11

τ11 + n12 τ12 e2 singles: dn2 dt = −λn2

2 − λn1n2 + 2n22

τ22 + n12 τ12 e1e1 pairs: dn11 dt = −n11 τ11 + λ 2 n2

1

e1e2 pairs: dn12 dt = −n12 τ12 + λn1n2 e2e2 pairs: dn22 dt = −n22 τ22 + λ 2 n2

2

HW distribution at the population equilibrium: n11 = 1 2λτ11n2

1, n12 =

λτ12n1n2, n22 = 1 2λτ22n2

2

slide-83
SLIDE 83

Fitnesses

πi- payoff per unit of time of a single ei strategist πij- payoff per interaction of an ei strategists paired with an ej strategist τij- average interaction time of an ei strategist when paired with an ej strategist πij τij

  • payoff per unit of time of an ei strategist when paired with an ej strategist

Fitnesses are defined as expected payoffs per unit of time: W1 = 2n11 2n11 + n12 + n1 π11 τ11 + n12 2n11 + n12 + n1 π12 τ12 + n1 2n11 + n12 + n1 π1 W2 = 2n22 2n22 + n12 + n2 π22 τ22 + n12 2n22 + n12 + n2 π21 τ12 + n2 2n22 + n12 + n2 π2

slide-84
SLIDE 84

Fitnesses

πi- payoff per unit of time of a single ei strategist πij- payoff per interaction of an ei strategists paired with an ej strategist τij- average interaction time of an ei strategist when paired with an ej strategist πij τij

  • payoff per unit of time of an ei strategist when paired with an ej strategist

Fitnesses are defined as expected payoffs per unit of time: W1 = 2n11 2n11 + n12 + n1 π11 τ11 + n12 2n11 + n12 + n1 π12 τ12 + n1 2n11 + n12 + n1 π1 W2 = 2n22 2n22 + n12 + n2 π22 τ22 + n12 2n22 + n12 + n2 π21 τ12 + n2 2n22 + n12 + n2 π2

slide-85
SLIDE 85

Fitnesses

πi- payoff per unit of time of a single ei strategist πij- payoff per interaction of an ei strategists paired with an ej strategist τij- average interaction time of an ei strategist when paired with an ej strategist πij τij

  • payoff per unit of time of an ei strategist when paired with an ej strategist

Fitnesses are defined as expected payoffs per unit of time: W1 = 2n11 2n11 + n12 + n1 π11 τ11 + n12 2n11 + n12 + n1 π12 τ12 + n1 2n11 + n12 + n1 π1 W2 = 2n22 2n22 + n12 + n2 π22 τ22 + n12 2n22 + n12 + n2 π21 τ12 + n2 2n22 + n12 + n2 π2

slide-86
SLIDE 86

Fitnesses

πi- payoff per unit of time of a single ei strategist πij- payoff per interaction of an ei strategists paired with an ej strategist τij- average interaction time of an ei strategist when paired with an ej strategist πij τij

  • payoff per unit of time of an ei strategist when paired with an ej strategist

Fitnesses are defined as expected payoffs per unit of time: W1 = 2n11 2n11 + n12 + n1 π11 τ11 + n12 2n11 + n12 + n1 π12 τ12 + n1 2n11 + n12 + n1 π1 W2 = 2n22 2n22 + n12 + n2 π22 τ22 + n12 2n22 + n12 + n2 π21 τ12 + n2 2n22 + n12 + n2 π2

slide-87
SLIDE 87

Fitnesses

πi- payoff per unit of time of a single ei strategist πij- payoff per interaction of an ei strategists paired with an ej strategist τij- average interaction time of an ei strategist when paired with an ej strategist πij τij

  • payoff per unit of time of an ei strategist when paired with an ej strategist

Fitnesses are defined as expected payoffs per unit of time: W1 = 2n11 2n11 + n12 + n1 π11 τ11 + n12 2n11 + n12 + n1 π12 τ12 + n1 2n11 + n12 + n1 π1 W2 = 2n22 2n22 + n12 + n2 π22 τ22 + n12 2n22 + n12 + n2 π21 τ12 + n2 2n22 + n12 + n2 π2

slide-88
SLIDE 88

Fitnesses

πi- payoff per unit of time of a single ei strategist πij- payoff per interaction of an ei strategists paired with an ej strategist τij- average interaction time of an ei strategist when paired with an ej strategist πij τij

  • payoff per unit of time of an ei strategist when paired with an ej strategist

Fitnesses are defined as expected payoffs per unit of time: W1 = 2n11 2n11 + n12 + n1 π11 τ11 + n12 2n11 + n12 + n1 π12 τ12 + n1 2n11 + n12 + n1 π1 W2 = 2n22 2n22 + n12 + n2 π22 τ22 + n12 2n22 + n12 + n2 π21 τ12 + n2 2n22 + n12 + n2 π2

slide-89
SLIDE 89

Fitnesses

πi- payoff per unit of time of a single ei strategist πij- payoff per interaction of an ei strategists paired with an ej strategist τij- average interaction time of an ei strategist when paired with an ej strategist πij τij

  • payoff per unit of time of an ei strategist when paired with an ej strategist

Fitnesses are defined as expected payoffs per unit of time: W1 = 2n11 2n11 + n12 + n1 π11 τ11 + n12 2n11 + n12 + n1 π12 τ12 + n1 2n11 + n12 + n1 π1 W2 = 2n22 2n22 + n12 + n2 π22 τ22 + n12 2n22 + n12 + n2 π21 τ12 + n2 2n22 + n12 + n2 π2

slide-90
SLIDE 90

Fitnesses

πi- payoff per unit of time of a single ei strategist πij- payoff per interaction of an ei strategists paired with an ej strategist τij- average interaction time of an ei strategist when paired with an ej strategist πij τij

  • payoff per unit of time of an ei strategist when paired with an ej strategist

Fitnesses are defined as expected payoffs per unit of time: W1 = 2n11 2n11 + n12 + n1 π11 τ11 + n12 2n11 + n12 + n1 π12 τ12 + n1 2n11 + n12 + n1 π1 W2 = 2n22 2n22 + n12 + n2 π22 τ22 + n12 2n22 + n12 + n2 π21 τ12 + n2 2n22 + n12 + n2 π2

slide-91
SLIDE 91

Fitness calculated at the equilibrium population distribution

Using HW at the distribution equilibrium n11 = 1 2λτ11n2

1

n12 = λτ12n1n2 n22 = 1 2λτ22n2

2

allows us to express fitnesses in singles W1 = π11λn1 + π12λn2 + π1 λn1τ11 + λn2τ12 + 1 W2 = π21λn1 + π22λn2 + π2 λn1τ12 + λn2τ22 + 1 At the interior Nash equilibrium (n1, n2) must satisfy:

  • W1 = W2

N = N1 + N2 = n1(n1λτ11 + n2λτ12 + 1) + n2(n2λτ22 + n1λτ12 + 1)

slide-92
SLIDE 92

Fitness calculated at the equilibrium population distribution

Using HW at the distribution equilibrium n11 = 1 2λτ11n2

1

n12 = λτ12n1n2 n22 = 1 2λτ22n2

2

allows us to express fitnesses in singles W1 = π11λn1 + π12λn2 + π1 λn1τ11 + λn2τ12 + 1 W2 = π21λn1 + π22λn2 + π2 λn1τ12 + λn2τ22 + 1 At the interior Nash equilibrium (n1, n2) must satisfy:

  • W1 = W2

N = N1 + N2 = n1(n1λτ11 + n2λτ12 + 1) + n2(n2λτ22 + n1λτ12 + 1)

slide-93
SLIDE 93

Fitness calculated at the equilibrium population distribution

Using HW at the distribution equilibrium n11 = 1 2λτ11n2

1

n12 = λτ12n1n2 n22 = 1 2λτ22n2

2

allows us to express fitnesses in singles W1 = π11λn1 + π12λn2 + π1 λn1τ11 + λn2τ12 + 1 W2 = π21λn1 + π22λn2 + π2 λn1τ12 + λn2τ22 + 1 At the interior Nash equilibrium (n1, n2) must satisfy:

  • W1 = W2

N = N1 + N2 = n1(n1λτ11 + n2λτ12 + 1) + n2(n2λτ22 + n1λτ12 + 1)

slide-94
SLIDE 94

Nash equilibrium when all interaction times are the same (τ11 = τ12 = τ21 = τ)

n1 = (π22 − π12)( √ 4λNτ + 1 − 1) + 2τ(π2 − π1) 2λτ(π22 − π21 − π12 + π11) n2 = (π11 − π21)( √ 4λNτ + 1 − 1) + 2τ(π1 − π2) 2λτ(π22 − π21 − π12 + π11) and p1 = N1 N = π22 − π12 π22 − π21 − π12 + π11 + (π2 − π1) √ 4λNτ + 1 + 1

  • 2λN(π22 − π21 − π12 + π11) .

Observation

The equilibrium depends on population size N, which contrasts with the classic result

  • f evolutionary game theory whereby the strategy proportion at Nash equilibrium are

independent of the population size.

slide-95
SLIDE 95

Nash equilibria for Hawk-Dove game when interaction times are not the same (N = 100, V = 1, C = 2, τHD = τDD = 1, πH = πD = −1).

Pairing is very fast: λ = 10000

2 4 6 8 10 12 14 0.0 0.2 0.4 0.6 0.8 1.0 A τHH pH

Pairing is slow: λ = 1

2 4 6 8 10 12 14 0.0 0.2 0.4 0.6 0.8 1.0 B τHH pH

slide-96
SLIDE 96

References

Kˇ rivan, V., Cressman, R., 2017. Interaction times change evolutionary outcomes: Two player matrix games. Journal of Theoretical Biology 416, 199–207. Kˇ rivan, V., Galanthay, T., Cressman, R., In review. Beyond replicator dynamics: From frequency to density dependent models of evolutionary games. Maynard Smith, J., Price, G. R., 1973. The logic of animal conflict. Nature 246, 15–18. Zhang, B.-Y., Fan, S.-J., Li, C., Zheng, X.-D., Bao, J.-Z., Cressman, R., Tao, Y., 2016. Opting out against defection leads to stable coexistence with cooperation. Scientific Reports 6 (35902).

slide-97
SLIDE 97

“A je to”

Play