Eponine Lupo.  Questions from last time  3 player games  Games larger than 2x2—rock, paper, scissors  Review/explain Nash Equilibrium  Nash Equilibrium.

Slides:



Advertisements
Similar presentations
Mixed Strategies.
Advertisements

Nash’s Theorem Theorem (Nash, 1951): Every finite game (finite number of players, finite number of pure strategies) has at least one mixed-strategy Nash.
Game Theory Assignment For all of these games, P1 chooses between the columns, and P2 chooses between the rows.
Clicker Question-A Chicken Game 0, 0 0, 1 1, 0 -10, -10 Swerve Hang Tough Swerve Hang Tough Player 2 Pllayer 1 Does either player have a dominant strategy?
This Segment: Computational game theory Lecture 1: Game representations, solution concepts and complexity Tuomas Sandholm Computer Science Department Carnegie.
Stackelberg -leader/follower game 2 firms choose quantities sequentially (1) chooses its output; then (2) chooses it output; then the market clears This.
Mixed Strategies For Managers
A Beautiful Game John C. Sparks AFRL/WS (937) Wright-Patterson Educational Outreach The Air Force Research Laboratory.
Introduction to Game theory Presented by: George Fortetsanakis.
Chapter Twenty-Eight Game Theory. u Game theory models strategic behavior by agents who understand that their actions affect the actions of other agents.
Simultaneous- Move Games with Mixed Strategies Zero-sum Games.
Two-Player Zero-Sum Games
Non-Cooperative Game Theory To define a game, you need to know three things: –The set of players –The strategy sets of the players (i.e., the actions they.
1 Chapter 14 – Game Theory 14.1 Nash Equilibrium 14.2 Repeated Prisoners’ Dilemma 14.3 Sequential-Move Games and Strategic Moves.
1 Game Theory. By the end of this section, you should be able to…. ► In a simultaneous game played only once, find and define:  the Nash equilibrium.
Chapter 6 Game Theory © 2006 Thomson Learning/South-Western.
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
OLIGOPOLY A market structure in which there are few firms, each of which is large relative to the total industry. Key idea: Decision of firms are interdependent.
AP Economics Mr. Bernstein Module 65: Game Theory December 10, 2014.
Course: Applications of Information Theory to Computer Science CSG195, Fall 2008 CCIS Department, Northeastern University Dimitrios Kanoulas.
Short introduction to game theory 1. 2  Decision Theory = Probability theory + Utility Theory (deals with chance) (deals with outcomes)  Fundamental.
Game-theoretic analysis tools Necessary for building nonmanipulable automated negotiation systems.
Game Theory Lecture 8.
ECO290E: Game Theory Lecture 4 Applications in Industrial Organization.
An Introduction to Game Theory Part I: Strategic Games
Game Theory Part 5: Nash’s Theorem.
The Prisoner’s Dilemma -Both arrested during botched bank robbery. -Kept in separate cells – NO COMMUNICATION. -Offered separate deals if they confess.
Eponine Lupo.  Game Theory is a mathematical theory that deals with models of conflict and cooperation.  It is a precise and logical description of.
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.
Algoritmi per Sistemi Distribuiti Strategici
Game Theory Game theory models strategic behavior by agents who understand that their actions affect the actions of other agents. Been used to study –Company.
Game-Theoretic Approaches to Multi-Agent Systems Bernhard Nebel.
Chapter Twenty-Eight Game Theory. u Game theory models strategic behavior by agents who understand that their actions affect the actions of other agents.
UNIT II: The Basic Theory Zero-sum Games Nonzero-sum Games Nash Equilibrium: Properties and Problems Bargaining Games Review Midterm3/19 3/12.
1 Game Theory Here we study a method for thinking about oligopoly situations. As we consider some terminology, we will see the simultaneous move, one shot.
Game Theory Here we study a method for thinking about oligopoly situations. As we consider some terminology, we will see the simultaneous move, one shot.
UNIT II: The Basic Theory Zero-sum Games Nonzero-sum Games Nash Equilibrium: Properties and Problems Bargaining Games Bargaining and Negotiation Review.
Game Theory Game theory models strategic behavior by agents who understand that their actions affect the actions of other agents. Been used to study –Market.
UNIT II: The Basic Theory Zero-sum Games Nonzero-sum Games Nash Equilibrium: Properties and Problems Bargaining Games Bargaining and Negotiation Review.
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.
UNIT II: The Basic Theory Zero-sum Games Nonzero-sum Games Nash Equilibrium: Properties and Problems Bargaining Games Review Midterm3/23 3/9.
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.
Today: Some classic games in game theory
CPS 170: Artificial Intelligence Game Theory Instructor: Vincent Conitzer.
1 Applications Here we look at several applications. We will see a classic example of a dilemma that can arise in such games.
Social Choice Session 7 Carmen Pasca and John Hey.
Economics for Business II Day 12 – Some Macro Numbers and Answers Dr. Andrew L. H. Parkes “A Macroeconomic Understanding for use in Business” 卜安吉.
Games People Play. 4. Mixed strategies In this section we shall learn How to not lose a game when it appears your opponent has a counter to all your moves.
Game Theory Robin Burke GAM 224 Spring Outline Admin Game Theory Utility theory Zero-sum and non-zero sum games Decision Trees Degenerate strategies.
McGraw-Hill/Irwin Copyright  2008 by The McGraw-Hill Companies, Inc. All rights reserved. GAME THEORY, STRATEGIC DECISION MAKING, AND BEHAVIORAL ECONOMICS.
Dynamic Games & The Extensive Form
Game-theoretic analysis tools Tuomas Sandholm Professor Computer Science Department Carnegie Mellon University.
THE “CLASSIC” 2 x 2 SIMULTANEOUS CHOICE GAMES Topic #4.
Chapters 29, 30 Game Theory A good time to talk about game theory since we have actually seen some types of equilibria last time. Game theory is concerned.
The Science of Networks 6.1 Today’s topics Game Theory Normal-form games Dominating strategies Nash equilibria Acknowledgements Vincent Conitzer, Michael.
Lecture 5 Introduction to Game theory. What is game theory? Game theory studies situations where players have strategic interactions; the payoff that.
Part 3 Linear Programming
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.
Strategic Behavior in Business and Econ Static Games of complete information: Dominant Strategies and Nash Equilibrium in pure and mixed strategies.
5.1.Static Games of Incomplete Information
Games of pure conflict two-person constant sum games.
Lec 23 Chapter 28 Game Theory.
Creating Institutions to Address Externalities TMS.
Game theory basics A Game describes situations of strategic interaction, where the payoff for one agent depends on its own actions as well as on the actions.
Chapter 28 Game Theory.
LECTURE 2 MIXED STRATEGY GAME
Introduction to Game Theory
Introduction to Game Theory
Presentation transcript:

Eponine Lupo

 Questions from last time  3 player games  Games larger than 2x2—rock, paper, scissors  Review/explain Nash Equilibrium  Nash Equilibrium in R  Instability of NE—move towards pure strategy  Prisoner’s Dilemma, Battle of the Sexes, 3 rd Game  Application to Life

14, 24, 328, 30, 27 30, 16, 2413, 12, L R R L 16, 24, 3030, 16, 24 30, 23,1414, 24, L R R L LR 3 Strategy Profile: {R,L,L} is the Solution to this Game

0, 0-1, 11, -1 0, 0-1, 1 1, -10, 0 Player 2 R P S Player 1 R P S No pure strategy NE Only mixed NE is {(1/3,1/3,1/3),(1/3,1/3,1/3)}

 “A strategy profile is a Nash Equilibrium if and only if each player’s prescribed strategy is a best response to the strategies of others”  Equilibrium that is reached even if it is not the best joint outcome 4, 60, 44, 4 5, 30, 01, 7 1, 13, 52, 3 Player 2 L C R Player 1 U M D Strategy Profile: {D,C} is the Nash Equilibrium **There is no incentive for either player to deviate from this strategy profile

 Sometimes there is NO pure Nash Equilibrium, or there is more than one pure Nash Equilibrium  In these cases, use Mixed Strategy Nash Equilibriums to solve the games  Take for example a modified game of Rock, Paper, Scissors where player 1 cannot ever play “Scissors” What now is the Nash Equilibrium? Put another way, how are Player 1 and Player 2 going to play?

 Once Player 1’s strategy of S is taken away, Player 2’s strategy R is iteratively dominated by strategy P. 0, 0-1, 11, -1 0, 0-1, 1 Player 2 R P S Player 1 R P

 Now the game has been cut down from a 3x3 to 2x2 game  There are still no pure strategy NE  From here we can determine the mixed strategy NE -1, 11, -1 0, 0-1, 1 Player 2 q 1-q P S Player 1 p R 1-p P  Player 1 wants to have a mixed strategy (p, 1-p) such that Player 2 has no advantage playing either pure strategy P or S.  u 2 ((p, 1-p),P)=u 2 ((p, 1-p),S) 1p+0(1-p) = (-1)p+1(1-p) 1p = -2p+1 3p = 1 p=1/3 S 1 = (1/3, 2/3)

-1, 11, -1 0, 0-1, 1 Player 1 p R 1-p P  Likewise, Player 2 wants to have a mixed strategy (q, 1-q) such that Player 1 has no advantage playing either pure strategy R or P.  u 1 (R,(q, 1-q))=u 1 (P,(q, 1-q)) -1q+1(1-q) = 0q+(-1)(1-q) -2q+1 = q-1 3q = 2 q=2/3 S 2 = (2/3, 1/3) Player 2 q 1-q P S

 Therefore the mixed strategy:  Player 1: (1/3Rock, 2/3Paper)  Player 2: (2/3Paper, 1/3Scissors) is the only one that cannot be “exploited” by either player.  The values of p and q are such that if Player 1 changes p, his payoff will not change but Player 2’s payoff may be affected  Thus, it is a Mixed Strategy Nash Equilibrium.

 The Nash Equilibrium is a very unstable point  If you do not begin exactly at the NE, you cannot stochastically find the NE  Theoretically you will “shoot off” to a pure strategy: (0,0) (0,1) (1,0) or (1,1) (similar for n players)  Consider the following:  2 players randomly choose values for p and q  Knowing player 2’s mixed strategy (q, 1-q), player 1 adjusts his mixed strategy of (p,1-p) in order to maximize his payoffs  With player 1’s new mixed strategy in mind, player 2 will adjust his mixed strategy in order to maximize his payoffs  This see-saw continues until both players can no longer change their strategies to increase their payoffs

 Unfortunately, I was unable to find a way to discover a mixed strategy NE in R for any number of players  Is my code wrong?  Is there simply no way to find the NE in R?  I don’t know

 In life, we react to other people’s choices in order to increase our utility or happiness  Ignoring a younger sibling who is irritating  Accepting an invitation to go to a baseball game  Once we react, the other person reacts to our reaction and life goes on  One stage games are rare in life  Very rarely are we in a “NE” for any aspect of our lives  There is almost always a choice that can better our current utility