๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Iterated Prisoner's Dilemma: Pay-off Variance

โœ Scribed by K. Nishimura; D.W. Stephens


Publisher
Elsevier Science
Year
1997
Tongue
English
Weight
235 KB
Volume
188
Category
Article
ISSN
0022-5193

No coin nor oath required. For personal study only.

โœฆ Synopsis


The iterated Prisoner's Dilemma (IPD) is usually analysed by evaluating arithmetic mean pay-offs in an ESS analysis. We consider several points that the standard argument does not address. Finite population size and finite numbers of matches in the IPD game lead us to consider both pay-off variance and the sampling process in the evolutionary game. We provide a general form for the pay-off variance of the Markov strategist in the IPD game, and present a general analysis of the initial invasion process of an "all defection strategist" (ALLD) into a "tit-for-tat" (TFT) strategist population by considering stochastic processes. Finite population size, strategic error an the variances of pay-offs alter the prediction concerning the initial invasion of ALLD compared with the standard Evolutionarily Stable Strategy (ESS) analysis. Even though TFT gets the larger arithmetic mean, the variance of its pay-off is also larger when the expected iterations of the game are sufficiently large. Therefore, the boundary of the parameter of the probability of game continuity, w, above which ALLD does not have advantage to invade into the TFT population, becomes a bit larger than predicted by the deterministic model.


๐Ÿ“œ SIMILAR VOLUMES


Extending the Iterated Prisoner's Dilemm
โœ Ch. Hauert; H.G. Schuster ๐Ÿ“‚ Article ๐Ÿ“… 1998 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 279 KB

In biology altruistic behaviour of selfish individuals often can be modelled by the iterated Prisoner's Dilemma game (PD). If the opponents are caught repeatedly in this dilemma reciprocity may lead to cooperative strategies adopted by the individuals. In this article we present results from numeric

Natural Selection of Memory-one Strategi
โœ DAVID P. KRAINES; VIVIAN Y. KRAINES ๐Ÿ“‚ Article ๐Ÿ“… 2000 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 289 KB

In the iterated Prisoner's Dilemma, mutually cooperative behavior can become established through Darwinian natural selection. In simulated interactions of stochastic memory-one strategies for the Iterated Prisoner's Dilemma, Nowak and Sigmund discovered that cooperative agents using a Pavlov (Win-St

Evolution of Strategies in the three-per
โœ Masanao Matsushima; Takashi Ikegami ๐Ÿ“‚ Article ๐Ÿ“… 1998 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 287 KB

A three-person iterated prisoner's dilemma (3p-IPD) game is studied. The present simulation uses a lattice model of finite state automata. In particular, the similarity between a noisy 2pand a noiseless 3p-IPD game is discussed. It is known that, due to the noise, Tit for Tat loses its robustness an

Are There Really No Evolutionarily Stabl
โœ JEFFREY P. LORBERBAUM; DARYL E. BOHNING; ANANDA SHASTRI; LAUREN E. SINE ๐Ÿ“‚ Article ๐Ÿ“… 2002 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 291 KB

The evolutionary form of the iterated prisoner's dilemma (IPD) is a repeated game where players strategically choose whether to cooperate with or exploit opponents and reproduce in proportion to game success. It has been widely used to study the evolution of cooperation among sel"sh agents. In the p