Two-Person, Zero-Sum Game: Advertising 0 -.6 -.4-1.60.2 -.4.4 -.20 -.6 1.4.60 0 TV N TVN 0 TV N TVN Column Player: Row Player: Matrix of Payoffs to Row.

Slides:

Advertisements

Similar presentations

Chapter 17: Making Complex Decisions April 1, 2004.

Advertisements

NON - zero sum games.

Module 4 Game Theory To accompany Quantitative Analysis for Management, Tenth Edition, by Render, Stair, and Hanna Power Point slides created by Jeff Heyl.

Game Theory Assignment For all of these games, P1 chooses between the columns, and P2 chooses between the rows.

Game Theory S-1.

15 THEORY OF GAMES CHAPTER.

APPENDIX An Alternative View of the Payoff Matrix n Assume total maximum profits of all oligopolists is constant at 200 units. n Alternative policies.

Two-Player Zero-Sum Games

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.

1 Chapter 4: Minimax Equilibrium in Zero Sum Game SCIT1003 Chapter 4: Minimax Equilibrium in Zero Sum Game Prof. Tsang.

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)

© 2015 McGraw-Hill Education. All rights reserved. Chapter 15 Game Theory.

Game Theory. “If you don’t think the math matters, then you don’t know the right math.” Chris Ferguson 2002 World Series of Poker Champion.

Game Theory: introduction and applications to computer networks Game Theory: introduction and applications to computer networks Zero-Sum Games (follow-up)

Multi-player, non-zero-sum games

Part 3: The Minimax Theorem

An Introduction to Game Theory Part I: Strategic Games

Games with Simultaneous Moves I :Discrete Strategies

2008/02/06Lecture 21 ECO290E: Game Theory Lecture 2 Static Games and Nash Equilibrium.

Chapter 6 © 2006 Thomson Learning/South-Western Game Theory.

5/16/20151 Game Theory Game theory was developed by John Von Neumann and Oscar Morgenstern in Economists! One of the fundamental principles of.

Chapter 14 Game Theory to accompany Operations Research: Applications and Algorithms 4th edition by Wayne L. Winston Copyright (c) 2004 Brooks/Cole, a.

The Prisoner’s Dilemma -Both arrested during botched bank robbery. -Kept in separate cells – NO COMMUNICATION. -Offered separate deals if they confess.

Non-cooperative Game Theory Notes by Alberto Bressan.

Copyright © 2003 Brooks/Cole, a division of Thomson Learning, Inc. 1 CHAPTER 11: GAME THEORY to accompany Introduction to Mathematical Programming: Operations.

Static Games of Complete Information: Equilibrium Concepts

QR 38, 2/22/07 Strategic form: dominant strategies I.Strategic form II.Finding Nash equilibria III.Strategic form games in IR.

Game Theory Objectives:

To accompany Quantitative Analysis for Management, 8e by Render/Stair/Hanna S-1 © 2003 by Prentice Hall, Inc. Upper Saddle River, NJ Supplement 1.

Some Definitions –Maxi-min (mini-max) strategy: The maxi-min strategy is the path with the highest possible (maximum) worst (minimum) outcome. –Dominant.

Game Theory Statistics 802. Lecture Agenda Overview of games 2 player games representations 2 player zero-sum games Render/Stair/Hanna text CD QM for.

Chapter 12 & Module E Decision Theory & Game Theory.

To accompany Quantitative Analysis for Management,9e by Render/Stair/Hanna M4-1 © 2006 by Prentice Hall, Inc. Upper Saddle River, NJ Module 4 Game.

Game Theory Part 2: Zero Sum Games. Zero Sum Games The following matrix defines a zero-sum game. Notice the sum of the payoffs to each player, at every.

1 CRP 834: Decision Analysis Week Four Notes. 2 Review Game Theory –Classification and Description –Two Person Zero-Sum Game Game w/ Dominating Strategy.

A Little Game Theory1 A LITTLE GAME THEORY Mike Bailey MSIM 852.

Chapter 11 Game Theory Math Game Theory What is it? – a way to model conflict and competition – one or more "players" make simultaneous decisions.

Game Theory Presented By: - Mrityunjay Sanwalot SMU II Sem.

1 1 Slide © 2006 Thomson South-Western. All Rights Reserved. Slides prepared by JOHN LOUCKS St. Edward’s University.

1 CRP 834: Decision Analysis Week Three Notes. 2 Review Decision-Flow Diagram –A road map of all possible strategies and outcomes –At a decision fork,

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.

Game Theory Optimal Strategies Formulated in Conflict MGMT E-5070.

1. 2 Some details on the Simplex Method approach 2x2 games 2xn and mx2 games Recall: First try pure strategies. If there are no saddle points use mixed.

1 a1a1 A1A1 a2a2 a3a3 A2A Mixed Strategies When there is no saddle point: We’ll think of playing the game repeatedly. We continue to assume that.

Statistics Overview of games 2 player games representations 2 player zero-sum games Render/Stair/Hanna text CD QM for Windows software Modeling.

GAME THEORY Day 5. Minimax and Maximin Step 1. Write down the minimum entry in each row. Which one is the largest? Maximin Step 2. Write down the maximum.

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.

Chapter 28 Game Theory.

Chapter 15: Game Theory: The Mathematics Lesson Plan of Competition

Planning of Barus & Holley Addition

Chapter 6 Game Theory (Module 4) 1.

GAME THEORY AND APPLICATIONS

Oligopoly & Game Theory Lecture 27

Solutions Sample Games 1

Game Theory Solutions 1 Find the saddle point for the game having the following payoff table. Use the minimax criterion to find the best strategy for.

GAME THEORY AND APPLICATIONS

Game Theory Day 3.

Finding Best Responses by Underlining Payoffs

Game Theory Solutions 1 Find the saddle point for the game having the following payoff table. Use the minimax criterion to find the best strategy for.

Chapter 15: Game Theory: The Mathematics Lesson Plan of Competition

Operations Research: Applications and Algorithms

Presentation transcript:

Two-Person, Zero-Sum Game: Advertising TV N TVN 0 TV N TVN Column Player: Row Player: Matrix of Payoffs to Row Player: Row Minima: Column Maxima: MaxiMin MiniMax Game has a saddle point!

Two-Person, Zero-Sum Game: Mixed Strategies Column Player: Row Player: Matrix of Payoffs to Row Player: X1R1 X2R2 C1 C Column Maxima: Row Minima: MaxiMin MiniMax MaxiMin MiniMax No Saddle Point! Y1Y2

Graphical Solution 01 X1 VR 10 12/17 50/17 VR < 10(1-X1) VR < -2 +7X1 Optimal Solution: X1=12/17, X2=5/17 VRMAX=50/17

Graphical Solution 01 X1 VR 10 12/17 50/17 VR < 10(1-X1) VR < -2 +7X1 Optimal Solution: X1=12/17, X2=5/17 VRMAX=50/17 Y1=1 Y1=0 Y1=.75 Y1=.5 Y1=.25

Two-Person, Zero-Sum Game: Mixed Strategies MODEL: SETS: ROWS/1..2/:X; COLS/1..2/; MATRIX(ROWS,COLS):REW; !REW(I,J) IS THE REWARD MATRIX FOR THE ROW PLAYER; DATA: REW=0,5, 10,-2; ENDDATA END

Two-Person, Zero-Sum Game: Mixed Strategies Optimal solution found at step: 1 Objective value: Variable Value Reduced Cost V X( 1) X( 2)

Reward Matrix for Two-Finger Morra (1,1) (1,2) (2,1) (2,2) Column Player:Row Player: Row Minimum: Column Maximum: (1,1) (1,2) (2,1) (2,2)

Two-Person, Zero-Sum Game: Mixed Strategies MODEL: !TWO FINGER MORRA GAME; SETS: ROWS/1..4/:X; COLS/1..4/; MATRIX(ROWS,COLS):REW; !REW(I,J) IS THE REWARD MATRIX FOR THE ROW PLAYER; DATA: REW=0,2,-3,0, -2,0,0,3, 3,0,0,-4, 0,-3,4,0; ENDDATA END

Two-Person, Zero-Sum Game: Mixed Strategies Optimal solution found at step: 3 Objective value: E+00 Variable Value Reduced Cost V X( 1) X( 2) X( 3) X( 4)

Solving Two-Person Zero-Sum Games 1. Check for a saddle point. If none, go to Step Simplify using iterative dominance. Go to Step 3. 3.If either the number of remaining rows or columns is equal to two the solution can be obtained graphically. Otherwise solve using linear programming methods, e.g. with LINGO.

Nonzero-Sum Game: Prisoner’s Dilemma (2,2)(0,3) (3,0)(1,1) Harry’s Choices H1 H2 Confess Do not confess S1 Confess Sam’s choices S2 Do not confess Payoffs to (Sam, Harry) (years in prison)

Nonzero-Sum Game: Prisoner’s Dilemma (2,2)(0,3) (3,0)(1,1) Harry’s Choices H1 H2 Defect Cooperate S1 Defect Sam’s choices S2Cooperate Payoffs to (Sam, Harry) (years in prison)

Nonzero-Sum Game: Radial Tire Ads on Monday Night Football (0,0)(-2,3) (3,-2) (-1,-1) Sears’s Choices S1 S2 No Yes (Cooperate)(Defect) G1 No (Cooperate) Goodyear’s choices G2 Yes (Defect) Payoffs to (Goodyear,Sears) ($, millions)

Nonzero-Sum Game: Terminology Dominate Outcome: Dominate Outcome: An outcome that is better for both players than any other Pareto Optimality: Pareto Optimality: Property of an outcome that is not dominated by any other Defect: Defect: To not trust the other player; to consider self-interest only Cooperate: Cooperate: To trust the other player; to seek mutual benefit

Nonzero-Sum Game: Prisoner’s Dilemma Essential Structure: (Cooperate, Cooperate) (Defect, Cooperate) (Cooperate, Defect) Pareto Optimal (Defect, Defect)Not Pareto Optimal No Dominate Outcome Advantage: Defect

Battle of the Sexes Prize Fight Ballet Husband Wife 2, 0 0, 2 0, 0 -1, -1 Payoffs to (wife, husband) (pleasure)

Nonzero-Sum Game: Introduction of New Product (Battle of the Sexes) (0,0)(0,2) (2,0) (-3,-3) Boston C1 C2 No Yes R1No American R2Yes Payoffs to (American,Boston) ($, millions)

Battle of the Sexes Essential Structure: Two Equilibrium Pairs with different returns to the two players One-time optimal strategy: Deception Repeated-choice optimal strategy: Alternate