Simulating the Evolution of Contest Escalation Winfried Just and Xiaolu Sun Department of Mathematics and Edison Biotechnology Institute Ohio University.

Slides:



Advertisements
Similar presentations
Agent-based Modeling: A Brief Introduction Louis J. Gross The Institute for Environmental Modeling Departments of Ecology and Evolutionary Biology and.
Advertisements

Agent-Based Modeling PSC 120 Jeff Schank. Agent-Based Modeling What Phenomena are Agent-Based Models Good for? What is Agent-Based Modeling (ABM)? What.
NON - zero sum games.
Ultimatum Game Two players bargain (anonymously) to divide a fixed amount between them. P1 (proposer) offers a division of the “pie” P2 (responder) decides.
Genetic Terms Gene - a unit of inheritance that usually is directly responsible for one trait or character. Allele - an alternate form of a gene. Usually.
Evolution and Repeated Games D. Fudenberg (Harvard) E. Maskin (IAS, Princeton)
Introduction to Game theory Presented by: George Fortetsanakis.
Hawks and Doves. Tastes In economics we largely take the tastes and preferences of the consumer to be a given piece of information. Within that context,
Playing Evolution Games in the Classroom Colin Garvey GK-12 Fellow.
Conflict resolution Evolutionary stable strategies (ESS) –Game theory –Assumptions Evolution of display –Hawks and doves –Arbitrary asymmetry.
The Evolutionary Games We Play Psychology Introduction Animals tend to behave in ways that maximize their inclusive fitness Usually pretty straightforward.
Operations Research Assistant Professor Dr. Sana’a Wafa Al-Sayegh 2 nd Semester ITGD4207 University of Palestine.
Chapter 6 Game Theory © 2006 Thomson Learning/South-Western.
Chapter 6 Game Theory © 2006 Thomson Learning/South-Western.
© 2015 McGraw-Hill Education. All rights reserved. Chapter 15 Game Theory.
Social Behavior & Game Theory Social Behavior: Define by Economic Interaction Individuals Affect Each Other’s Fitness, Predict by Modeling Fitness Currency.
What is a game?. Game: a contest between players with rules to determine a winner. Strategy: a long term plan of action designed to achieve a particular.
On the Genetic Evolution of a Perfect Tic-Tac-Toe Strategy
________ | | | Rich habitat Poor habitat Rewards Per Indiv. No. of competitors.
Part 3: The Minimax Theorem
Maynard Smith Revisited: Spatial Mobility and Limited Resources Shaping Population Dynamics and Evolutionary Stable Strategies Pedro Ribeiro de Andrade.
Chapter 6 © 2006 Thomson Learning/South-Western Game Theory.
Using process knowledge to identify uncontrolled variables and control variables as inputs for Process Improvement 1.
Conflict Resolution Threat-display contests Variable length contests
Evolutionary Game Theory
THE PROBLEM OF MULTIPLE EQUILIBRIA NE is not enough by itself and must be supplemented by some other consideration that selects the one equilibrium with.
The Tools of Demography and Population Dynamics
Lectures in Microeconomics-Charles W. Upton Minimax Strategies.
An Introduction to Black-Box Complexity
Evolutionary Computation Application Peter Andras peter.andras/lectures.
On Bounded Rationality and Computational Complexity Christos Papadimitriou and Mihallis Yannakakis.
Minimax Strategies. Everyone who has studied a game like poker knows the importance of mixing strategies. –With a bad hand, you often fold –But you must.
1 CHAPTER M4 Cost Behavior © 2007 Pearson Custom Publishing.
Bottom-Up Coordination in the El Farol Game: an agent-based model Shu-Heng Chen, Umberto Gostoli.
Copyright ©2005 Brooks/Cole, a division of Thomson Learning, Inc. Understanding Probability and Long-Term Expectations Chapter 16.
Learning dynamics,genetic algorithms,and corporate takeovers Thomas H. Noe,Lynn Pi.
Chapter 12: Simulation and Modeling
Evolutionary Intelligence
Brian Duddy.  Two players, X and Y, are playing a card game- goal is to find optimal strategy for X  X has red ace (A), black ace (A), and red two (2)
Changing Perspective… Common themes throughout past papers Repeated simple games with small number of actions Mostly theoretical papers Known available.
Chapter 12 Choices Involving Strategy Copyright © 2014 McGraw-Hill Education. All rights reserved. No reproduction or distribution without the prior written.
Moneyball in the Classroom Using Baseball to Teach Statistics Josh Tabor Canyon del Oro High School
Games of Strategy (Game Theory) Topic 1 – Part IV.
Natural Selection Problem
Unit: V.. How common is genetic variation All organisms have at least two forms of alleles for each trait some of which are easily observable and other.
Design of a real time strategy game with a genetic AI By Bharat Ponnaluri.
Presenter: Chih-Yuan Chou GA-BASED ALGORITHMS FOR FINDING EQUILIBRIUM 1.
Experimental Economics NSF short course David Laibson August 11, 2005.
1 What is Game Theory About? r Analysis of situations where conflict of interests is present r Goal is to prescribe how conflicts can be resolved 2 2 r.
Natural Selection Problem
Introduction.
The Hardy-Weinberg principle is like a Punnett square for populations, instead of individuals. A Punnett square can predict the probability of offspring's.
Biostatistics Case Studies 2006 Peter D. Christenson Biostatistician Session 2: Correlation of Time Courses of Simultaneous.
1 1 Slide Simulation Professor Ahmadi. 2 2 Slide Simulation Chapter Outline n Computer Simulation n Simulation Modeling n Random Variables and Pseudo-Random.
Organization of statistical investigation. Medical Statistics Commonly the word statistics means the arranging of data into charts, tables, and graphs.
Simulation. Simulation  Simulation imitation of chance behavior based on a model that accurately reflects the phenomenon under consideration  By observing.
1.Stream A and Stream B are located on two isolated islands with similar characteristics. How do these two stream beds differ? 2.Suppose a fish that varies.
Simulation. Simulation is a way to model random events, such that simulated outcomes closely match real-world outcomes. By observing simulated outcomes,
1 UNIVERSITY OF CALIFORNIA, IRVINE, GAME THEORY AND POLITICS 2, POL SCI 130B, Lecture 2.5: AGGRESSION, VIOLENCE, AND UNCERTAINTY Recall various interpretations.
Copyright © Cengage Learning. All rights reserved. 5 Joint Probability Distributions and Random Samples.
Genetic Algorithm Dr. Md. Al-amin Bhuiyan Professor, Dept. of CSE Jahangirnagar University.
Artificial Intelligence By Mr. Ejaz CIIT Sahiwal Evolutionary Computation.
Behavioral Adaptations for Survival Chapter 5. Adaptationist Approach – Assumes a behavior is adaptive (trait confers greater reproductive success than.
Indirect Reciprocity in the Selective Play Environment Nobuyuki Takahashi and Rie Mashima Department of Behavioral Science Hokkaido University 08/07/2003.
March 1, 2016Introduction to Artificial Intelligence Lecture 11: Machine Evolution 1 Let’s look at… Machine Evolution.
Evolutionary Algorithms Jim Whitehead
Game Theory and Cooperation
Evolution: Hardy-Weinberg Equilibrium
Fighting ‘rules’ Assessment and possible escalation.
GAMBLER’S RUIN in a FAIR GAME
Presentation transcript:

Simulating the Evolution of Contest Escalation Winfried Just and Xiaolu Sun Department of Mathematics and Edison Biotechnology Institute Ohio University

Background Most published studies of escalated animal contests show that it is usually the likely winner of a contest who initiates escalation to the more costly stage. However, in some species the situation is reversed and escalation is much more often initiated by the eventual loser. For example, such a situation was reported for swordtail fishes Xiphophorus multilineatus and X. nigrensis by Morris et al. (1995). We developed a game-theoretic model that shows a possible reason for such counterintuitive behavior. Here we report on the results of testing the model under simulated evolution.

Game-theoretic models of animal contests In game-theoretic models of animal behavior, animals are treated as players that try to maximize their payoffs (Darwinian fitness) in a game. They are supposed to follow genetically coded strategies (prescriptions for behavior). A strategy is evolutionarily stable (an ESS) if a population of players who all follow this strategy cannot be invaded by a mutant strategy.

The model We model animal contests that have up to two stages: a display stage, during which no physical contact occurs, followed in some cases by a fight stage during which physical contact occurs. Note that this structure implies that passage from the display stage to the fight stage requires escalation by only one of the contestants. Payoffs: V for obtaining the contested resource, -L for engaging in a fight - (L + K) for losing a fight Note that engaging in a fight is advantageous if and only if the Probability of winning a fight is above (K+L)/(V+K).

The probability classes of winning a fight We are interested only in parameter settings where 0 < (K+L)/(V+K) < 0.5, so that sometimes both players will prefer escalation to unilateral retreat. We assume that during the display stage contestants try to assess the probability of winning a fight. It is assumed that from the point of view of a given contestant, this probability is partitioned into four classes: zvery low: escalation to fighting would be disadvantageous; zlow: opponent is more likely to win, but escalation to the fighting stage would be still be advantageous; zhigh: the opponent is more likely to lose, but still should prefer escalation to the fighting stage over unilateral retreat; zvery high: the opponent should retreat.

Perception of probability classes We assume that a player may misperceive his probability class of winning a fight as each neighboring one with probability q. At each time during the display stage, a player will have partial or full information about his probability class (possibly incorrect information). Such partial information is modeled as a perception state of a player. For example, a player may perceive that his winning probability is either very low or low, but may not have reached a decision yet as to which one it is. Encounters start with none of the players having any information about their winning probability, and the estimates of the winning probability become more refined as the encounter progresses.

Strategies A strategy prescribes one of the three actions D (continue displaying), R (retreat), or E (escalate) to each one of the eight perception states we consider in our model. Thus there is a total of 3 8 = 6,561 possible strategies. In the simulations, strategies are coded as strings of letters. They are fixed throughout the lifetime of each player, and inherited from the parents with crossover and mutations. Encounters are modeled by letting the contestants carry out the prescribed actions as the perception states become more refined. The outcomes of fights are randomly generated according to given parameter settings of winning probabilities and the actual (not necessary perceived) probability classes.

Predictions of the model With a total of 6,561 strategies, the model is not analytically tractable. However, simplified versions of the model have been analyzed by Just and Morris (in review) and Just, Morris, and Sun (in review). These models ignore or greatly simplify the process of refinement of partial information and suggest that for typical parameter settings with probability of misperception q > 0, a player should retreat if he perceives his winning probability as very low, should escalate if he perceives his winning probability as low, and should continue displaying if he perceives his winning probability as high or very high. This would lead to a population of players where most fights are Initiated by their eventual losers.

Our simulations For two parameter settings suggested by the results of Just, Morris, and Sun (in review) we run 120 simulations each with q > 0 and 30 simulations each with q = 0. Some of these simulations started from random initial populations; other simulations started from initial populations where all players followed a fixed strategy that was different from the predicted ESS. We simulated the evolution of strategies in populations of 3,000 players over 100,000 mating seasons. Each player was characterized for life by its innate fighting ability and its strategy. In each mating season, each player had on average 6 encounters per mating season, and lived for 10 mating seasons.

Results The results of these simulations confirm that for the particular parameter settings studied, the results of the simplified model of Just, Morris, and Sun (in review) carry over to our model: zIn the simulations with q > 0, over 75% of all fights were initiated by their likely loser, and most of the time, a mix of strategies in which the ESS predicted by the simpler model dominated was observed. zIn the simulations with q = 0, the percentage of fights initiated by the weaker contestant was not significantly different from 50%, and no (mixed or pure) ESS appeared to evolve.

Open problems However, exploratory runs for several other parameter settings did show patterns that differed from the predictions of Just, Morris, and Sun (in review). Characterizing the region of the parameter space where the results of the latter model remain valid if the process of Information acquisition is explicitly modeled remains an open problem. Further directions or research include investigating how robust our findings are if more probability classes are considered or if escalation can proceed in more than just two stages.

References 1.W. Just and M. R. Morris (in review). The Napoleon Complex: Why Smaller Males Pick Fights. 2.W. Just, M. R. Morris, and X. Sun (in review). The evolution of aggressive losers. 3.M. R. Morris, L. Gass, and M. J. Ryan (1995). Assessment and individual recognition of opponents in the swordtails Xiphophorus nigrensis and X. multilineatus. Behavioral Ecology and Sociobiology 37:

Acknowledgement This work was partially supported by NSF grant DBI to W.J.