Sir Philip Sidney game

From Wikipedia, the free encyclopedia

In biology and game theory, the Sir Philip Sidney game is used as a model for the evolution and maintenance of informative communication between relatives. Developed by John Maynard Smith as a model for chick begging behavior, it has been studied extensively including the development of many modified versions.^[1]

It was named after a story about Sir Philip Sidney who, fatally wounded, allegedly gave his water to another, saying, "thy necessity is yet greater than mine."^[1]

Young birds and other animals beg for food from their parents. It appears that in many species the intensity of begging varies with the need of the chick and that parents give more food to those chicks that beg more.^[2] Since parents respond differentially, chicks have an incentive to overstate their need since it will result in them receiving more food. If all chicks overstate their need, parents have an incentive to ignore the begging and give food using some other rule.

This situation represents a case of animal signaling where there arises an evolutionary question to explain the maintenance of the signal. The Sir Philip Sidney game formalizes a signalling theory suggestion from Amotz Zahavi, the handicap principle, that reliability is maintained by making the signal costly to produce—chicks expend energy in begging.^[3] Since it requires energy to beg, only chicks in dire need should be willing to expend the energy to secure food.

The game

There are two individuals, the signaler and the responder. The responder has some good which can be transferred to the signaler or not. If the responder keeps the good, the responder has a fitness of 1, otherwise the responder has a fitness of (1-d). The signaler can be in one of two states, healthy or needy. If the signaler receives the good, his fitness will be 1. Otherwise his fitness will be (1-b) or (1-a) if healthy or needy respectively (where a>b). The signaler can send a signal or not. If he sends the signal he incurs a cost of c regardless of the outcome.

If individuals maximize their own fitness the responder should never transfer the good, since he is reducing his own fitness for no gain. However, it supposed that the signaler and responder are related by some degree r. Each individual attempts to maximize his inclusive fitness, and so in some cases the responder would like to transfer the good.

The case of interest is where the responder only wants to transfer the good to the needy signaler, but the signaler would want the good regardless of his state. This creates a partial conflict of interest, where there would be an incentive for deception. Maynard Smith showed, however, that for certain values of c, honest signaling can be an evolutionarily stable strategy. This suggests that it might be sustained by evolution.^[1]

Criticisms

The empirical study of chick begging has cast some doubt on the appropriateness of the Sir Philip Sidney game and on the handicap principle as an explanation for chick begging behavior. Several empirical studies have attempted to measure the cost of begging, in effect measuring c. These studies have found that although there is a cost, it is far lower than would be sufficient to sustain honesty. Since the actual benefits of food are hard to calculate, the required value of c cannot be determined exactly, but it nonetheless has raised concern.^[2]

In addition to the empirical concern, there has been theoretical concern. In a series of papers, Carl Bergstrom and Michael Lachmann suggest that in many biologically possible cases we should not expect to find signaling despite the fact that it is an evolutionarily stable strategy. They point out that whenever a signaling strategy is evolutionarily stable, non-signaling equilibria are as well. As a result, evolutionary stability alone does not require the evolution of signaling. In addition, they note that in many of these cases the signaling equilibrium is pareto inferior to the non-signaling one – both the chick and parent are worse off than if there was no signaling. Since one would expect non-signalling to be the ancestral state, it is unclear how evolution would move a population from a superior equilibrium to an inferior one.

Both of these concerns led Bergstrom and Lachmann to suggest a modified game where honesty is maintained, not by signal cost, but instead by the common interest inherent in interaction among relatives. In their partial pooling model, individuals have no incentive to lie, because the lie would harm their relative proportionally more than it would help them. As a result, they do better by remaining honest.^[4]^[5]^[6]

References

1 2 3 Maynard Smith, John; David Harper (2003). Animal Signals. Oxford: Oxford University Press. ISBN 978-0-19-852685-8.
1 2 Searcy, William A.; Stephen Nowicki (2005). The Evolution of Animal Communication: Reliability and Deception in Animal Signaling. Princeton: Princeton. ISBN 978-0-691-07095-7.
↑ Zahavi, Amotz (1975). "Mate Selection -- A Selection for a Handicap". Journal of Theoretical Biology. 53 (1): 205–214. Bibcode:1975JThBi..53..205Z. CiteSeerX 10.1.1.586.3819. doi:10.1016/0022-5193(75)90111-3. PMID 1195756.
↑ Bergstrom, Carl; Michael Lachmann (29 May 1997). "Signaling among relatives. I. Is signaling too costly?". Proceedings of the Royal Society of London B. 352 (1353): 609–617. doi:10.1098/rstb.1997.0041. PMC 1691946.
↑ Lachmann, Michael; Carl Bergstrom (October 1997). "Signaling among relatives II. Beyond the Tower of Babel". Theoretical Population Biology. 54 (2): 146–60. doi:10.1006/tpbi.1997.1372. PMID 9733656.
↑ Bergstrom, Carl; Michael Lachmann (28 April 1998). "Signaling among relatives. III. Talk is cheap". Proceedings of the National Academy of Sciences of the United States of America. 95 (9): 5100–5105. Bibcode:1998PNAS...95.5100B. doi:10.1073/pnas.95.9.5100. PMC 20220. PMID 9560235.

v t e Topics of game theory
Definitions	Congestion game Cooperative game Determinacy Escalation of commitment Extensive-form game First-player and second-player win Game complexity Graphical game Hierarchy of beliefs Information set Normal-form game Perfect recall Preference Sequential game Simultaneous game Simultaneous action selection Solved game Succinct game Mechanism design
Equilibrium concepts	Bayes correlated equilibrium Bayesian Nash equilibrium Berge equilibrium Core Correlated equilibrium Coalition-proof Nash equilibrium Epsilon-equilibrium Evolutionarily stable strategy Gibbs equilibrium Mertens-stable equilibrium Markov perfect equilibrium Nash equilibrium Pareto efficiency Perfect Bayesian equilibrium Proper equilibrium Quantal response equilibrium Quasi-perfect equilibrium Risk dominance Satisfaction equilibrium Self-confirming equilibrium Sequential equilibrium Shapley value Strong Nash equilibrium Subgame perfection Trembling hand equilibrium
Strategies	Appeasement Backward induction Bid shading Collusion Cheap talk De-escalation Deterrence Escalation Forward induction Grim trigger Markov strategy Pairing strategy Dominant strategies Pure strategy Mixed strategy Strategy-stealing argument Tit for tat
Classes of games	Auction Bargaining problem Differential game Global game Intransitive game Mean-field game n-player game Perfect information Large Poisson game Potential game Repeated game Screening game Signaling game Strictly determined game Stochastic game Symmetric game Zero-sum game
Games	Go Chess Infinite chess Checkers All-pay auction Prisoner's dilemma Gift-exchange game Optional prisoner's dilemma Traveler's dilemma Coordination game Chicken Centipede game Lewis signaling game Volunteer's dilemma Dollar auction Battle of the sexes Stag hunt Matching pennies Ultimatum game Electronic mail game Rock paper scissors Pirate game Dictator game Public goods game Blotto game War of attrition El Farol Bar problem Fair division Fair cake-cutting Bertrand competition Cournot competition Stackelberg competition Deadlock Diner's dilemma Guess 2/3 of the average Kuhn poker Nash bargaining game Induction puzzles Trust game Princess and monster game Rendezvous problem Pursuit game
Theorems	Aumann's agreement theorem Folk theorem Minimax theorem Nash's theorem Negamax theorem One-shot deviation principle Purification theorem Revelation principle Sprague–Grundy theorem Zermelo's theorem
Key figures	Albert W. Tucker Amos Tversky Antoine Augustin Cournot Ariel Rubinstein Claude Shannon Daniel Kahneman David K. Levine David M. Kreps Donald B. Gillies Drew Fudenberg Eric Maskin Harold W. Kuhn Herbert Simon Hervé Moulin John Conway Jean Tirole Jean-François Mertens Jennifer Tour Chayes John Harsanyi John Maynard Smith John Nash John von Neumann Kenneth Arrow Kenneth Binmore Leonid Hurwicz Lloyd Shapley Melvin Dresher Merrill M. Flood Olga Bondareva Oskar Morgenstern Paul Milgrom Peyton Young Reinhard Selten Robert Axelrod Robert Aumann Robert B. Wilson Roger Myerson Samuel Bowles Suzanne Scotchmer Thomas Schelling William Vickrey
Search optimizations	Alpha–beta pruning Aspiration window Principal variation search max^n algorithm Paranoid algorithm Lazy SMP
Miscellaneous	Bounded rationality Combinatorial game theory Confrontation analysis Coopetition Evolutionary game theory Glossary of game theory List of game theorists List of games in game theory No-win situation Topological game Tragedy of the commons

Related Articles