The Structure of Networks with emphasis on information and social networks T-214-SINE Summer 2011 Chapter 7 Ýmir Vigfússon.

Slides:



Advertisements
Similar presentations
News and Notes 4/13 HW 3 due now HW 4 distributed today, due Thu 4/22 Final exam is Mon May 3 11 AM Levine 101 Today: –intro to evolutionary game theory.
Advertisements

Math Intro: Matrix Form Games and Nash Equilibrium.
Game theory (Sections )
Evolution and Repeated Games D. Fudenberg (Harvard) E. Maskin (IAS, Princeton)
Chapter Twenty-Eight Game Theory. u Game theory models strategic behavior by agents who understand that their actions affect the actions of other agents.
6-1 LECTURE 6: MULTIAGENT INTERACTIONS An Introduction to MultiAgent Systems
Operations Research Assistant Professor Dr. Sana’a Wafa Al-Sayegh 2 nd Semester ITGD4207 University of Palestine.
1 Chapter 14 – Game Theory 14.1 Nash Equilibrium 14.2 Repeated Prisoners’ Dilemma 14.3 Sequential-Move Games and Strategic Moves.
The basics of Game Theory Understanding strategic behaviour.
Chapter 6 Game Theory © 2006 Thomson Learning/South-Western.
An Introduction to... Evolutionary Game Theory
MIT and James Orlin © Game Theory 2-person 0-sum (or constant sum) game theory 2-person game theory (e.g., prisoner’s dilemma)
EC3224 Autumn Lecture #04 Mixed-Strategy Equilibrium
Social Behavior & Game Theory Social Behavior: Define by Economic Interaction Individuals Affect Each Other’s Fitness, Predict by Modeling Fitness Currency.
The Structure of Networks
Game Theory Game theory is an attempt to model the way decisions are made in competitive situations. It has obvious applications in economics. But it.
Learning in games Vincent Conitzer
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.
Multi-player, non-zero-sum games
Maynard Smith Revisited: Spatial Mobility and Limited Resources Shaping Population Dynamics and Evolutionary Stable Strategies Pedro Ribeiro de Andrade.
An Introduction to Game Theory Part I: Strategic Games
Chapter 6 © 2006 Thomson Learning/South-Western Game Theory.
Strategic Decisions Making in Oligopoly Markets
The Structure of Networks
The Structure of Networks with emphasis on information and social networks T-214-SINE Summer 2011 Chapter 8 Ýmir Vigfússon.
A camper awakens to the growl of a hungry bear and sees his friend putting on a pair of running shoes, “You can’t outrun a bear,” scoffs the camper. His.
Chapter 12 Choices Involving Strategy McGraw-Hill/Irwin Copyright © 2008 by The McGraw-Hill Companies, Inc. All Rights Reserved.
1 Economics & Evolution Number 2. 2 Reading List.
An Introduction to Game Theory Part II: Mixed and Correlated Strategies Bernhard Nebel.
Yale 11 and 12 Evolutionary Stability: cooperation, mutation, and equilibrium.
Evolutionary Game Theory
Chapter Twenty-Eight Game Theory. u Game theory models strategic behavior by agents who understand that their actions affect the actions of other agents.
Static Games and Cournot Competition
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.
Evolutionary Games The solution concepts that we have discussed in some detail include strategically dominant solutions equilibrium solutions Pareto optimal.
APEC 8205: Applied Game Theory Fall 2007
UNIT II: The Basic Theory Zero-sum Games Nonzero-sum Games Nash Equilibrium: Properties and Problems Bargaining Games Bargaining and Negotiation Review.
UNIT III: COMPETITIVE STRATEGY Monopoly Oligopoly Strategic Behavior 7/21.
Chapter Fourteen Strategy. © 2007 Pearson Addison-Wesley. All rights reserved.14–2 Strategic Behavior A set of actions a firm takes to increase its profit,
QR 38, 2/22/07 Strategic form: dominant strategies I.Strategic form II.Finding Nash equilibria III.Strategic form games in IR.
Game Applications Chapter 29. Nash Equilibrium In any Nash equilibrium (NE) each player chooses a “best” response to the choices made by all of the other.
Evolutionary Games The solution concepts that we have discussed in some detail include strategically dominant solutions equilibrium solutions Pareto optimal.
UNIT II: The Basic Theory Zero-sum Games Nonzero-sum Games Nash Equilibrium: Properties and Problems Bargaining Games Bargaining and Negotiation Review.
UNIT II: The Basic Theory Zero-sum Games Nonzero-sum Games Nash Equilibrium: Properties and Problems Bargaining Games Bargaining and Negotiation Review.
CPS Learning in games Vincent Conitzer
Learning dynamics,genetic algorithms,and corporate takeovers Thomas H. Noe,Lynn Pi.
Evolution Test Review Session!!
Social Choice Session 7 Carmen Pasca and John Hey.
5. Alternative Approaches. Strategic Bahavior in Business and Econ 1. Introduction 2. Individual Decision Making 3. Basic Topics in Game Theory 4. The.
Chapter 12 Choices Involving Strategy Copyright © 2014 McGraw-Hill Education. All rights reserved. No reproduction or distribution without the prior written.
Learning in Multiagent systems
Intermediate Microeconomics
Dynamic Games of complete information: Backward Induction and Subgame perfection - Repeated Games -
Standard and Extended Form Games A Lesson in Multiagent System Based on Jose Vidal’s book Fundamentals of Multiagent Systems Henry Hexmoor, SIUC.
Presenter: Chih-Yuan Chou GA-BASED ALGORITHMS FOR FINDING EQUILIBRIUM 1.
Dynamic Games & The Extensive Form
Game Theory: introduction and applications to computer networks Game Theory: introduction and applications to computer networks Lecture 2: two-person non.
Data Analysis Econ 176, Fall Populations When we run an experiment, we are always measuring an outcome, x. We say that an outcome belongs to some.
Section 2 – Ec1818 Jeremy Barofsky
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.
Experimental Design Econ 176, Fall Some Terminology Session: A single meeting at which observations are made on a group of subjects. Experiment:
Intermediate Microeconomics Game Theory and Oligopoly.
Vincent Conitzer CPS Learning in games Vincent Conitzer
Replicator Dynamics. Nash makes sense (arguably) if… -Uber-rational -Calculating.
Lec 23 Chapter 28 Game Theory.
By: Donté Howell Game Theory in Sports. What is Game Theory? It is a tool used to analyze strategic behavior and trying to maximize his/her payoff of.
Q 2.1 Nash Equilibrium Ben
Game Theory and Cooperation
Chapter 30 Game Applications.
UNIT II: The Basic Theory
Presentation transcript:

The Structure of Networks with emphasis on information and social networks T-214-SINE Summer 2011 Chapter 7 Ýmir Vigfússon

Game theory Regular game theory ◦ Individual players make decisions ◦ Payoffs depend on decisions made by all ◦ The reasoning about what other players might do happens simultaneously Evolutionary game theory ◦ Game theory continues to apply even if no individual is overtly reasoning or making explicit decisions ◦ Decisions may thus not be conscious ◦ What behavior will persist in a population?

Background Evolutionary biology ◦ The idea that an organism‘s genes largely determine its observable characteristics (fitness) in a given environment  More fit organisms will produce more offspring  This causes genes that provide greater fitness to increase their representation in the population ◦ Natural selection

Evolutionary game theory Key insight ◦ Many behaviors involve the interaction of multiple organisms in a population ◦ The success of an organism depends on how its behavior interacts with that of others  Can‘t measure fitness of an individual organism ◦ So fitness must be evaluated in the context of the full population in which it lives Analogous to game theory! ◦ Organisms‘s genetically determined characteristics and behavior = Strategy ◦ Fitness = Payoff ◦ Payoff depends on strategies of organisms with which it interacts = Game matrix

Motivating example Let‘s look at a species of a beetle ◦ Each beetle‘s fitness depends on finding and processing food effectively ◦ Mutation introduced  Beetles with mutation have larger body size  Large beetles need more food What would we expect to happen? ◦ Large beetles need more food ◦ This makes them less fit for the environment ◦ The mutation will thus die out over time But there is more to the story...

Motivating example Beetles compete with each other for food ◦ Large beetles more effective at claiming above-average share of the food Assume food competition is among pairs ◦ Same sized beetles get equal shares of food ◦ A large beetle gets the majority of food from a smaller beetle ◦ Large beetles always experience less fitness benefit from given quantity of food  Need to maintain their expensive metabolism

Motivating example The body-size game between two beetles Something funny about this ◦ No beetle is asking itself: “Do I want to be small or large?“ Need to think about strategy changes that operate over longer time scales ◦ Taking place as shifts in population under evolutionary forces SmallLarge Small5, 51, 8 Large8, 13, 33, 3

Evolutionary stable strategies The concept of a Nash equilibrium doesn‘t work in this setting ◦ Nobody is changing their personal strategy Instead, we want an evolutionary stable strategy ◦ A genetically determined strategy that tends to persist once it is prevalent in a population Need to make this precise...

Evolutionarily stable strategies Suppose each beatle is repeatedly paired off with other beetles at random ◦ Population large enough so that there are no repeated interactions between two beetles A beetle‘s fitness = average fitness from food interactions = reproductive success ◦ More food thus means more offspring to carry genes (strategy) to the next generation Def: ◦ A strategy is evolutionarily stable if everyone uses it, and any small group of invaders with a different strategy will die off over multiple generations

Evolutionarily stable strategies Def: More formally ◦ Fitness of an organism in a population = expected payoff from interaction with another member of population ◦ Strategy T invades a strategy S at level x (for small x) if:  x fraction of population uses T  1-x fractionof population uses S ◦ Strategy S is evolutionarily stable if there is some number y such that:  When any other strategy T invades S at any level x < y, the fitness of an organism playing S is strictly greater than the fitness of an organism playing T

Is Small an evolutionarily stable strategy? Let‘s use the definition ◦ Suppose for some small number x, a 1-x fraction of population use Small and x use Large ◦ In other words, a small invader population of Large beetles What is the expected payoff to a Small beetle in a random interaction? ◦ With prob. 1-x, meet another Small beetle for a payoff of 5 ◦ With prob. x, meet Large beetle for a payoff of 1 ◦ Expected payoff: 5(1-x) + 1x = 5-4x Motivating example

Is Small an evolutionarily stable strategy? Let‘s use the definition ◦ Suppose for some small number x, a 1-x fraction of population use Small and x use Large ◦ In other words, a small invader population of Large beetles What is the expected payoff to a Large beetle in a random interaction? ◦ With prob. 1-x, meet a Small beetle for payoff of 8 ◦ With prob. x, meet another Large beetle for a payoff of 3 ◦ Expected payoff: 8(1-x) + 3x = 8-5x Motivating example

Expected fitness of Large beetles is 8-5x Expected fitness of Small beetles is 5-4x ◦ For small enough x (and even big x), the fitness of Large beetles exceeds the fitness for Small ◦ Thus Small is not evolutionarily stable What about the Large strategy? ◦ Assume x fraction are Small, rest Large. ◦ Expected payoff to Large: 3(1-x) + 8x = 3+5x ◦ Expected payoff to Small: 1(1-x) + 5x = 1+4x ◦ Large is evolutionarily stable

Motivating example Summary ◦ A few large beetles introduced into a population consisting of small beetles ◦ Large beetles will do really well:  They rarely meet each other  They get most of the food in most competitions ◦ Population of small beetles cannot drive out the large ones  So Small is not evolutionarily stable

Motivating example Summary ◦ Conversely, a few small beetles will do very badly  They will lose almost every competition for food ◦ A population of large beetles resists the invasion of small beetles ◦ Large is thus evolutionarily stable The structure is like prisoner‘s dilemma ◦ Competition for food = arms race ◦ Beetles can‘t change body sizes, but evolutionarily forces over multiple generations are achieving analogous effect

Motivating example Even more striking feature! ◦ Start from a population of small beetles ◦ Evolution by natural selection is causing the fitness of the organisms to decrease over time Does this contradict Darwin‘s theory? ◦ Natural selection increases fitness in a fixed environment ◦ Each beetle‘s environment includes all other beetles ◦ The environment is thus changing  It is becoming increasingly more hostile for everyone  This naturally decreases the fitness of the population

Evolutionary arms races Lots of examples ◦ Height of trees follows prisoner‘s dilemma  Only applies to a particular height range  More sunlight offset by fitness downside of height ◦ Roots of soybean plants to claim resources  Conserve vs. Explore Hard to truly determine payoffs in real- world settings

Evolutionary arms races One recent example with known payoffs ◦ Virus populations can play an evolutionary version of prisoner‘s dilemma ◦ Virus A  Infects bacteria  Manifactures products required for replication ◦ Virus B  Mutated version of A  Can replicate inside bacteria, but less efficiently  Benefits from presence of A ◦ Is B evolutionarily stable?

Virus game Look at interactions between two viruses ◦ Viruses in a pure A population do better than viruses in pure B population ◦ But regardless of what other viruses do, higher payoff to be B Thus B is evolutionarily stable ◦ Even though A would have been better ◦ Similar to the exam-presentation game AB A1.00, , 1.99 B1.99, , 0.83

What happens in general? Under what conditions is a strategy evolutionarily stable? ◦ Need to figure out the right form of the payoff matrix ◦ How do we write the condition of evolutionary stability in terms of these 4 variables, a,b,c,d? ST Sa, ab, c Tc, bd, d Organism 2 Organism 1

What happens in general? Look at the definition again ◦ Suppose again that for some small number x:  A 1-x fraction of the population uses S  An x fraction of the population uses T What is the payoff for playing S in a random interaction in the population? ◦ Meet another S with prob. 1-x. Payoff = a ◦ Meet T with prob. x. Payoff = b ◦ Expected payoff = a(1-x)+bx Analogous for playing T ◦ Expected payoff = c(1-x)+dx

What happens in general? Therefore, S is evolutionarily stable if for all small values of x: ◦ a(1-x)+bx > c(1-x)+dx ◦ When x is really small (goes to 0), this is  a > c ◦ When a=c, the left hand side is larger when  b > d In other words ◦ In a two-player, two-strategy symmetric game, S is evolutionarily stable pricely when either  a > c, or  a = c, and b > d

What happens in general? Intuition ◦ In order for S to be evolutionarily stable, then:  Using S against S must be at least as good as using T against S  Otherwise, an invader using T would have higher fitness than the rest of the population ◦ If S and T are equally good responses to S  S can only be evolutionarily stable if those who play S do better against T than what those who play T do with each another  Otherwise, T players would do as well against the S part of the population as the S players

Relationship with Nash equilibria Let‘s look at Nash in the symmetric game ◦ When is (S,S) a Nash equilibrium? ◦ S is a best response to S: a ≥ c Compare with evolutionarily stable strategies: ◦ (i) a > c or (ii) a = c and b > d Very similar! ST Sa, ab, c Tc, bd, d

Relationship with Nash equilibria We get the following conclusion ◦ Thm: If strategy S is evolutionary stable, then (S,S) is a Nash equilibrium Does the other direction hold? ◦ What if a = c, and b < d? ◦ Can we construct such an example?

From yesterday Stag Hunt ◦ If hunters work together, they can catch a stag ◦ On their own they can each catch a hare ◦ If one hunter tries for a stag, he gets nothing Two equilibria, but “riskier“ to hunt stag ◦ What if other player hunts hare? Get nothing ◦ Similar to prisoner‘s dilemma  Must trust other person to get best outcome! Hunt StagHunt Hare Hunt Stag 4, 40, 3 Hunt Hare 3, 03, 3

Counterexample Modify the game a bit Want: a = c, and b < d Hunt StagHunt Hare Hunt Stag 4, 40, 3 Hunt Hare 3, 03, 3 ST Sa, ab, c Tc, bd, d

Counterexample Modify the game a bit Want: a = c, and b < d ◦ We‘re done! Hunt StagHunt Hare Hunt Stag 4, 40, 4 Hunt Hare 4, 03, 3 ST Sa, ab, c Tc, bd, d

Relationship with Nash equilibria We get the following conclusion: ◦ Thm: If strategy S is evolutionarily stable, then (S,S) is a Nash equilibrium Does the other direction hold? ◦ What if a = c, and b < d? ◦ Can we construct such an example? Yes! However! Look at a strict Nash equilibrium ◦ The condition gives a > c ◦ Thm: If (S,S) is a strict Nash equilibrium, then strategy S is evolutionarily stable The equilibrium concepts refine one another

Summary Nash equilibrium ◦ Rational players choosing mutual best responses to each other‘s strategy ◦ Great demands on the ability to choose optimally and coordinate on strategies that are best responses to each other Evolutionarily stable strategies ◦ No intelligence or coordination ◦ Strategies hard-wired into players (genes) ◦ Successful strategies produce more offspring Yet somehow they are almost the same!

Mixed strategies It may be the case that no strategy is evolutionarily stable ◦ The Hawk-Dove game is an example  Hawk does well in all-Dove population  Dove does well in population of all Hawks ◦ The game even has two Nash equilibria! Yesterday we introduced mixed strategies to study this ◦ How should we define this in our setting?

Mixed strategies Suppose: ◦ Organism 1 plays S with probability p  Plays T with probability 1-p ◦ Organism 2 plays S with probability q  Plays T with probability 1-q Expected payoff for organism 1 ◦ Probability pq of (S,S) pairing, giving a ◦ Probability p(1-q) of (S,T) pairing, giving b ◦ Probability (1-p)q of (T,S) pairing, giving c ◦ Probability p(1-q) of (T,T) pairing, giving d In total: ◦ V(p,q) = pqa+p(1-q)b+(1-p)qc+(1-p)(1-q)d

Mixed strategies Fitness of an organism = expected payoff in a random interaction More precisely: ◦ Def: p is an evolutionary stable mixed strategy if there is a small positive number y s.t.  when any other mixed strategy q invades p at any level x<y, then  the fitness of an organism playing p is strictly greater than the fitness of an organism playing q

Mixed strategies Let‘s dig into this condition p is an evolutionarily stable mixed strategy if: ◦ For some y and any x < y, the following holds for all mixed strategies q ≠ p:  (1-x)V(p,p) + xV(p,q) > (1-x)V(q,p) + xV(q,q) This parallels what we saw earlier for mixed Nash equilibria ◦ If p is an evolutionarily stable mixed strategy then V(p,p) ≥ V(q,p), ◦ Thus p is a best response to q ◦ So (p,p) is a mixed Nash equilibrium

Example: Hawk-Dove See book

Interpretation Can interpret this in two ways ◦ All participants in the population are mixing over two possible pure strategies with given probability  Members genetically the same ◦ Population level: 1/3 of animals hard-wired to play D and 2/3 are hard-wired to always play H