• Aucun résultat trouvé

Evolutionary stability & changing fitnesses

N/A
N/A
Protected

Academic year: 2022

Partager "Evolutionary stability & changing fitnesses"

Copied!
36
0
0

Texte intégral

(1)

Evolutionary stability & changing fitnesses

Frank Thuijsman, Philippe Uyttendaele

Avi Shmida, Gijs Schoenmakers, Ronald Westra

Biology and Game Theory, Paris, UPMC, November 4-6, 2010

(2)

Introduction A Seasonal Model Stochastic Model Concluding Remarks

Outline

1 Introduction

2 A Seasonal Model

3 Stochastic Model

4 Concluding Remarks

(3)

Introduction A Seasonal Model Stochastic Model Concluding Remarks

Evolutionary Development

Many evolutionary game theoretic models are usually based on the replicator equation:

i =xi(eiAx−xAx)

where a population changes in view of a fitness matrixA.

Ais usually fixed; what happens ifAchanges in time? The population is assumed to be completely mixed; what happens if it is not?

(4)

Introduction A Seasonal Model Stochastic Model Concluding Remarks

Evolutionary Development

Many evolutionary game theoretic models are usually based on the replicator equation:

i =xi(eiAx−xAx)

where a population changes in view of a fitness matrixA.

Ais usually fixed; what happens ifAchanges in time?

The population is assumed to be completely mixed; what happens if it is not?

(5)

Evolutionary Development

Many evolutionary game theoretic models are usually based on the replicator equation:

i =xi(eiAx−xAx)

where a population changes in view of a fitness matrixA.

Ais usually fixed; what happens ifAchanges in time?

The population is assumed to be completely mixed;

what happens if it is not?

(6)

Introduction A Seasonal Model Stochastic Model Concluding Remarks

Evolutionary Development

Many evolutionary game theoretic models are usually based on the replicator equation:

i =xi(eiAx−xAx)

where a population changes in view of a fitness matrixA.

Ais usually fixed; what happens ifAchanges in time?

The population is assumed to be completely mixed; what happens if it is not?

(7)

Introduction A Seasonal Model Stochastic Model Concluding Remarks

Changing Fitnesses

Two approaches:

A seasonal model: the fitness matrix changes periodically as a function of time

A stochastic model: stochastic transitions among different fitness matrices as a function of the population distribution

(8)

Introduction A Seasonal Model Stochastic Model Concluding Remarks

Changing Fitnesses

Two approaches:

A seasonal model: the fitness matrix changes periodically as a function of time

A stochastic model: stochastic transitions among different fitness matrices as a function of the population distribution

(9)

Changing Fitnesses

Two approaches:

A seasonal model: the fitness matrix changes periodically as a function of time

A stochastic model: stochastic transitions among different fitness matrices as a function of the population distribution

(10)

Introduction A Seasonal Model Stochastic Model Concluding Remarks

Periodic Fitnesses

We examine what happens when in x˙i =xi(eiAx−xAx) we use

A=

0 0 2+σcos(ρt)

α 0 α

2−σcos(ρt) 0 0

(11)

Population Development in the Seasonal Model

(Trajectory)

(12)

Introduction A Seasonal Model Stochastic Model Concluding Remarks

The Limit Cycle

(Rest cycle)

(13)

The Parametric Influence

x˙i=xi(eiAxxAx)

A=

0 0 2+σcos(ρt)

α 0 α

2σcos(ρt) 0 0

(14)

Introduction A Seasonal Model Stochastic Model Concluding Remarks

The Rapoport Cake Model

A resource dilemma where a cake of a stochastic size has to be distributed among a number of persons.

Sequentially, each person can claim a piece of any size. If the sum of these pieces is no bigger than the whole cake, then everyone gets what he or she claims.

If the sum of the pieces is bigger, then no one gets anything.

(15)

Introduction A Seasonal Model Stochastic Model Concluding Remarks

The Rapoport Cake Model

A resource dilemma where a cake of a stochastic size has to be distributed among a number of persons.

Sequentially, each person can claim a piece of any size.

If the sum of these pieces is no bigger than the whole cake, then everyone gets what he or she claims.

If the sum of the pieces is bigger, then no one gets anything.

(16)

Introduction A Seasonal Model Stochastic Model Concluding Remarks

The Rapoport Cake Model

A resource dilemma where a cake of a stochastic size has to be distributed among a number of persons.

Sequentially, each person can claim a piece of any size.

If the sum of these pieces is no bigger than the whole cake, then everyone gets what he or she claims.

If the sum of the pieces is bigger, then no one gets anything.

(17)

The Rapoport Cake Model

A resource dilemma where a cake of a stochastic size has to be distributed among a number of persons.

Sequentially, each person can claim a piece of any size.

If the sum of these pieces is no bigger than the whole cake, then everyone gets what he or she claims.

If the sum of the pieces is bigger, then no one gets anything.

(18)

Introduction A Seasonal Model Stochastic Model Concluding Remarks

A Two-Player Version

Consider a cake of size 4

where each of two players can claim to get 1 (modest), 2 (fair) or 3 (greedy),

then the payoff matrix would look like

m f g

m 1,1 1,2 1,3 f 2,1 2,2 0,0 g 3,1 0,0 0,0

(19)

A Two-Player Version

Consider a cake of size 4

where each of two players can claim to get 1 (modest), 2 (fair) or 3 (greedy),

then the payoff matrix would look like

m f g

m 1,1 1,2 1,3 f 2,1 2,2 0,0 g 3,1 0,0 0,0

(20)

Introduction A Seasonal Model Stochastic Model Concluding Remarks

A Population Version with 3 Cakes

m f g

m 1 0 0

f 0 0 0

g 0 0 0

Cakesize 2

[1,0,0] [0,1,0]

[0,0,1]

m f g

m 1 1 1

f 2 2 0

g 3 0 0

Cakesize 4

[1,0,0] [0,1,0]

[0,0,1]

m f g

m 1 1 1

f 2 2 2

g 3 3 3

Cakesize 6

[1,0,0] [0,1,0]

[0,0,1]

(21)

Introduction A Seasonal Model Stochastic Model Concluding Remarks

A Population Version with 3 Cakes

m f g

m 1 0 0

f 0 0 0

g 0 0 0

Cakesize 2

[1,0,0] [0,1,0]

m f g

m 1 1 1

f 2 2 0

g 3 0 0

Cakesize 4

[1,0,0] [0,1,0]

[0,0,1]

m f g

m 1 1 1

f 2 2 2

g 3 3 3

Cakesize 6

[1,0,0] [0,1,0]

(22)

Introduction A Seasonal Model Stochastic Model Concluding Remarks

A Population Version with 3 Cakes

m f g

m 1 0 0

f 0 0 0

g 0 0 0

Cakesize 2

[1,0,0] [0,1,0]

[0,0,1]

m f g

m 1 1 1

f 2 2 0

g 3 0 0

Cakesize 4

[1,0,0] [0,1,0]

[0,0,1]

m f g

m 1 1 1

f 2 2 2

g 3 3 3

Cakesize 6

[1,0,0] [0,1,0]

[0,0,1]

(23)

A Population Version with 3 Cakes

m f g

m 1 0 0

f 0 0 0

g 0 0 0

Cakesize 2

[1,0,0] [0,1,0]

[0,0,1]

m f g

m 1 1 1

f 2 2 0

g 3 0 0

Cakesize 4

[1,0,0] [0,1,0]

[0,0,1]

m f g

m 1 1 1

f 2 2 2

g 3 3 3

Cakesize 6

[1,0,0] [0,1,0]

[0,0,1]

(24)

Introduction A Seasonal Model Stochastic Model Concluding Remarks

A Population Version with 3 Cakes

m f g

m 1 0 0

f 0 0 0

g 0 0 0

Cakesize 2

m f g

m 1 1 1

f 2 2 0

g 3 0 0

Cakesize 4

m f g

m 1 1 1

f 2 2 2

g 3 3 3

Cakesize 6

C2 C4 C6

1mδ

m+δ

12fγmγg

γm+f

γg+f

1gδ

g+δ

(25)

Introduction A Seasonal Model Stochastic Model Concluding Remarks

Population Development in the Stochastic Model

[1,0,0] [0,1,0]

[0,0,1]

Small Cake Medium Cake Big Cake

[1,0,0] [0,1,0]

Small Cake Medium Cake Big Cake

(26)

Introduction A Seasonal Model Stochastic Model Concluding Remarks

Population Development in the Stochastic Model

[1,0,0] [0,1,0]

[0,0,1]

Small Cake Medium Cake Big Cake

[1,0,0] [0,1,0]

[0,0,1]

Small Cake Medium Cake Big Cake

(27)

Introduction A Seasonal Model Stochastic Model Concluding Remarks

Another Population Version with 3 Cakes

Using converse proportionality among players we get:

m f g

m 1 1.3 1.5

f 0.7 1 1.2

g 0.5 0.8 1

Cakesize 2

[1,0,0] [0,1,0]

m f g

m 1 1 1

f 2 2 2.4

g 3 1.6 2

Cakesize 4

[1,0,0] [0,1,0]

m f g

m 1 1 1

f 2 2 2

g 3 3 3

Cakesize 6

[1,0,0] [0,1,0]

(28)

Introduction A Seasonal Model Stochastic Model Concluding Remarks

Another Population Version with 3 Cakes

Using converse proportionality among players we get:

m f g

m 1 1.3 1.5

f 0.7 1 1.2

g 0.5 0.8 1

Cakesize 2

[1,0,0] [0,1,0]

[0,0,1]

m f g

m 1 1 1

f 2 2 2.4

g 3 1.6 2

Cakesize 4

[1,0,0] [0,1,0]

[0,0,1]

m f g

m 1 1 1

f 2 2 2

g 3 3 3

Cakesize 6

[1,0,0] [0,1,0]

[0,0,1]

(29)

Another Population Version with 3 Cakes

Using converse proportionality among players we get:

m f g

m 1 1.3 1.5

f 0.7 1 1.2

g 0.5 0.8 1

Cakesize 2

m f g

m 1 1 1

f 2 2 2.4

g 3 1.6 2

Cakesize 4

m f g

m 1 1 1

f 2 2 2

g 3 3 3

Cakesize 6

C2 C4 C6

1mδ

m+δ

12fγmγg

γm+f

γg+f

1gδ

g+δ

(30)

Introduction A Seasonal Model Stochastic Model Concluding Remarks

Population Development in the Stochastic Model

(Rest cycle)

(31)

Introduction A Seasonal Model Stochastic Model Concluding Remarks

Stability of Trajectories

Questions for the audience:

How to derive theoretically the stability of a ‘limit trajectory’?

How to define stability in a changing environment?

(32)

Introduction A Seasonal Model Stochastic Model Concluding Remarks

Stability of Trajectories

Questions for the audience:

How to derive theoretically the stability of a ‘limit trajectory’?

How to define stability in a changing environment?

(33)

Introduction A Seasonal Model Stochastic Model Concluding Remarks

Other ‘Evolutionary’ Work in Maastricht

Examining local competition using replicator dynamics

Examining local competition with local fitness matrices Studying wasp ovipositioning behavior by means of an evolutionary approach

(34)

Introduction A Seasonal Model Stochastic Model Concluding Remarks

Other ‘Evolutionary’ Work in Maastricht

Examining local competition using replicator dynamics Examining local competition with local fitness matrices

Studying wasp ovipositioning behavior by means of an evolutionary approach

(35)

Other ‘Evolutionary’ Work in Maastricht

Examining local competition using replicator dynamics Examining local competition with local fitness matrices Studying wasp ovipositioning behavior by means of an evolutionary approach

(36)

Introduction A Seasonal Model Stochastic Model Concluding Remarks

Thanks

Thank you for your attention!

Any comments are welcome!

This presentation will be available at www.personeel.unimaas.nl/F-Thuijsman

Références

Documents relatifs

For certain choices of the vectors Ge one may find non zero integers ne such that ... On the other hand, the free energy cost of this distortion is of the order of C

For a relatively large class of such fitness functions, we prove well-posedness, and show that the solution of ( 1 ) converges to the principal eigenfunction (or ground state) of

The evolutionary algorithm, using the variable length representation based on VoronoY diagram introduced in [17] and used on the same geophysical problem, but with

Variational Segmentation using Fuzzy Region Competition and Local Non-Parametric Probability Density Functions.. IEEE 11th International Conference on Computer

On the one hand we can reduce the number of local models queries by build- ing one local model around the mean of the offspring population to be predicted instead of building

The second algorithm proposed here borrows to the later approach: global search capabilities are added to the quasi- random local algorithm; but because it has a high conver-

In the first part, we focus on the linear approximation of the system and we show that the quadratic Lyapunov function associated with the local stabilizer (i.e. P ) can be rewritten

When combined with selection effects, the dynamics driven both by selection and house-of-cards mutations takes the form of a Shahshahani gradient-like dynamics with drift deriving