Games with Simultaneous Moves I :Discrete Strategies

Slides:



Advertisements
Similar presentations
Combining Sequential and Simultaneous Moves
Advertisements

Monte Hall Problem Let’s Draw a Game Tree… Problem 6, chapter 2.
Two-Person, Zero-Sum Game: Advertising TV N TVN 0 TV N TVN Column Player: Row Player: Matrix of Payoffs to Row.
Basics on Game Theory Class 2 Microeconomics. Introduction Why, What, What for Why Any human activity has some competition Human activities involve actors,
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.
1 Game Theory. 2 Definitions Game theory -- formal way to analyze interactions among a group of rational agents behaving strategically Agents – players.
Extensive and Strategic Form Games Econ 171. Reminder: Course requirements Class website Go to economics department home page. Under Links, find Class.
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.
Chapter 6 Game Theory © 2006 Thomson Learning/South-Western.
Porter's 5 Forces POTENTIAL ENTRANTS SUPPLIERS BUYERS SUBSTITUTES INDUSTRY COMPETITORS Rivalry Among Existing Firms.
Game Theory Developed to explain the optimal strategy in two-person interactions. Initially, von Neumann and Morganstern Zero-sum games John Nash Nonzero-sum.
Short introduction to game theory 1. 2  Decision Theory = Probability theory + Utility Theory (deals with chance) (deals with outcomes)  Fundamental.
Multi-player, non-zero-sum games
Working Some Problems. Telephone Game How about xexed strategies? Let Winnie call with probability p and wait with probability 1-p. For what values of.
STRATEGIC DECISION MAKING
ECO290E: Game Theory Lecture 4 Applications in Industrial Organization.
An Introduction to Game Theory Part I: Strategic Games
Chapter 6 © 2006 Thomson Learning/South-Western Game Theory.
Nash Equilibrium: Theory. Strategic or Simultaneous-move Games Definition: A simultaneous-move game consists of: A set of players For each player, a set.
5/16/20151 Game Theory Game theory was developed by John Von Neumann and Oscar Morgenstern in Economists! One of the fundamental principles of.
Game Theory Analysis Sidney Gautrau. John von Neumann is looked at as the father of modern game theory. Many other theorists, such as John Nash and John.
Social Networks 101 P ROF. J ASON H ARTLINE AND P ROF. N ICOLE I MMORLICA.
Eponine Lupo.  Game Theory is a mathematical theory that deals with models of conflict and cooperation.  It is a precise and logical description of.
Check your (Mis)understanding? Number 3.5 page 79 Answer Key claims that: For player 1 a strictly dominates c For player 2, y strictly dominates w and.
1 1 Lesson overview BA 592 Lesson I.10 Sequential and Simultaneous Move Theory Chapter 6 Combining Simultaneous and Sequential Moves Lesson I.10 Sequential.
Basics on Game Theory For Industrial Economics (According to Shy’s Plan)
Extensive and Strategic Form Games Econ 171. Reminder: Course requirements Class website Go to economics department home page. Under Links, find Class.
Nash Equilibrium Econ 171. Suggested Viewing A Student’s Suggestion: Video game theory lecture Open Yale Economics Ben Pollack’s Game Theory Lectures.
Game - Speak Noncooperative games Players Rules of the game –Order (who chooses when) –Chance (moves by nature) –Information set (who knows what … and.
6.1 Consider a simultaneous game in which player A chooses one of two actions (Up or Down), and B chooses one of two actions (Left or Right). The game.
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.
Lecture Slides Dixit and Skeath Chapter 4
QR 38, 2/27/07 Minimax and other pure strategy equilibria I.Minimax strategies II.Cell-by-cell inspection III.Three players IV.Multiple equilibria or no.
QR 38, 2/22/07 Strategic form: dominant strategies I.Strategic form II.Finding Nash equilibria III.Strategic form games in IR.
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
Extensive and Strategic Form Games Econ 171. Reminder: Course requirements Class website Go to economics department home page. Under Links, find Class.
CPS 170: Artificial Intelligence Game Theory Instructor: Vincent Conitzer.
Game-theoretic analysis tools Tuomas Sandholm Professor Computer Science Department Carnegie Mellon University.
THE “CLASSIC” 2 x 2 SIMULTANEOUS CHOICE GAMES Topic #4.
The Science of Networks 6.1 Today’s topics Game Theory Normal-form games Dominating strategies Nash equilibria Acknowledgements Vincent Conitzer, Michael.
CPS 270: Artificial Intelligence Game Theory Instructor: Vincent Conitzer.
P2 P1 Confess No (-1,-1) Confess (-5,0)No (0,-5)(-3,-3) TABLE 1 Battle of Sexes and Prisoner’s Dilemma Prisoner’s Dilemma Husband Wife Basket- ball Opera.
Lecture 5 Introduction to Game theory. What is game theory? Game theory studies situations where players have strategic interactions; the payoff that.
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.
CPS 570: Artificial Intelligence Game Theory Instructor: Vincent Conitzer.
ECO290E: Game Theory Lecture 3 Why and How is Nash Equilibrium Reached?
Choose one of the numbers below. You will get 1 point if your number is the closest number to 3/4 of the average of the numbers chosen by all class members,
ECO290E: Game Theory Lecture 8 Games in Extensive-Form.
Day 9 GAME THEORY. 3 Solution Methods for Non-Zero Sum Games Dominant Strategy Iterated Dominant Strategy Nash Equilibrium NON- ZERO SUM GAMES HOW TO.
Games People Play. 3. Simultaneous move games with pure strategies In this section we shall learn How to figure out the outcomes to expect in simultaneous.
Chapter 12 Game Theory Presented by Nahakpam PhD Student 1Game Theory.
Working Some Problems.
Game theory Chapter 28 and 29
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.
Check your (Mis)understanding?
Simultaneous Move Games: Discrete Strategies
Game theory Chapter 28 and 29
GAME THEORY AND APPLICATIONS
Oligopoly & Game Theory Lecture 27
GAME THEORY AND APPLICATIONS
Game Theory Day 3.
Lecture Game Theory.
Presentation transcript:

Games with Simultaneous Moves I :Discrete Strategies

Outline Games with simultaneous moves Nash Equilibrium Dominance Minimax in Zero-sum Game Three Players Multiple/Zero Equilibria in pure strategies Tree Forms into Strategic Forms

Games with Simultaneous Moves Strategy vs. action Discrete/Continuous strategy

Games in normal (strategic) form. Games Table/ Game Matrix/ Payoff Table Column Left Middle Right Row Top 3, 1 2, 3 10, 2 High 4, 5 3, 0 6, 4 Low 2, 2 5, 4 12, 3 Bottom 5, 6 9, 7

Zero-sum Game Column Run Pass Blitz OFFENSE 2 5 13 Short Pass 6 5.6 10.5 Medium Pass 4.5 1 Long Pass 10 3 -2

Nash Equilibrium What is Equilibrium? Cell-by-cell-inspection or enumeration Best Response Analysis Column Left Middle Right Row Top 3, 1 2, 3 10, 2 High 4, 5 3, 0 6, 4 Low 2, 2 5, 4 12, 3 Bottom 5, 6 9, 7

Column Left Middle Right Row Top 3, 1 2, 3 10, 2 High 4, 5 3, 0 6, 4 Low 2, 2 5, 4 12, 3 Bottom 5, 6 9, 7

The N.E is (Low, Middle) →(5, 4) A Nash Equilibrium in a game is a list of strategies, one for each player, such that no player can get a better payoff by switching to some other strategy that is available to her while all the other players adhere to the strategies specified for them in the list.

A N.E. does not have to be jointly best for the players. EX: Prisoner’s dilemma WIFE Confess (Defect) Deny (Cooperate) HUSBAND 10yr, 10yr 1yr, 25yr 25yr, 1yr 3yr, 3yr

Nash Equilibrium as a system of beliefs Nash Equilibrium is a set of strategies, such that (1)each player has correct beliefs about the strategies of the others (2)the strategy of each is the best for herself, given her beliefs about the strategies of the others

Dominance WIFE Confess (Defect) Deny (Cooperate) HUSBAND 10yr, 10yr Dominant strategy is an action clearly best for a player, no matter what the others might be doing. “Confess” is a dominant strategy for the husband, while “Confess” is also a dominant strategy for the wife. NE: (Confess, Confess) →(10yr, 10yr)

(A,B,…..) are strategies for Player 1. A is a dominant strategy for Player 1. A dominates B/C/D…. B/C/D… is a dominated strategy for Player 1.

Both (all) Players Have Dominant Strategies One Player has a Dominant Strategy FED Low interest rate High interest rate CONGRESS Budget balance 3, 4 1, 3 Budget deficit 4, 1 2, 2

Successive (Iterated) Elimination of Dominated Strategies Left Middle Right Up 5, 2 2, 3 3, 4 Medium 4, 1 3, 2 4, 0 Down 3, 3 1, 2 2, 2

MiniMax Method for Zero-Sum Games MiniMax/Maximin Column Run Pass Blitz OFFENSE 2 5 13 Short Pass 6 5.6 10.5 Medium Pass 4.5 1 Long Pass 10 3 -2

Three Players TALIA chooses C TALIA chooses NC NINA C NC EMILY 5, 5, 5 3, 6, 3 6, 3, 3 4, 4, 1 NINA C NC EMILY 3, 3, 6 1, 4, 4 4, 1, 4 2, 2, 2

Three Players TALIA chooses D TALIA chooses ND NINA D ND EMILY 2, 7, 2 3, 2, 2 5, 1, 2 2, 5, 2 NINA D ND EMILY 3, 3, 3 1, 2, 3 2, 1, 1 2, 2, 1

Multiple Equilibria in Pure Strategies Coordination Games Battle of the Sexes SALLY Starbucks Banyan HARRY 2, 1 0, 0 1, 2

Convergence of expectation Assurance Games Focal Point Convergence of expectation Assurance Games DEAN Swerve (Chicken) Straight (Tough) JAMES 0, 0 -1, 1 1, -1 -2, -2

No Equilibrium in Pure Strategies Rock-Paper-Scissors Rock Paper Scissors 0, 0 -1, 1 1, -1 N.E exists in mixed Strategies

Homework, Ch4 question 3, 6, 11, and 12(a & b)

Tree form into a strategic form L (3, 1) U 2 R (2, 2) 1 D L (1, 3) R (4, 1) 2 LL LR RL RR U 3, 1 2, 2 D 1, 3 4, 1 LL LR RL RR U D

Minimax/Maximin vs. Nash Equilibrium Revisited