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.

Slides:

Advertisements

Similar presentations

Advertisements

Two Player 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.

Name: Trương Hoài Anh Facebook: Quasar Hoaianh

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

Module C1 Decision Models Uncertainty. What is a Decision Analysis Model? Decision Analysis Models is about making optimal decisions when the future is.

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.

Simultaneous- Move Games with Mixed Strategies Zero-sum Games.

Two-Player Zero-Sum Games

Operations Research Assistant Professor Dr. Sana’a Wafa Al-Sayegh 2 nd Semester ITGD4207 University of Palestine.

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

MIT and James Orlin © Game Theory 2-person 0-sum (or constant sum) game theory 2-person game theory (e.g., prisoner’s dilemma)

Copyright (c) 2003 Brooks/Cole, a division of Thomson Learning, Inc

Game Theory, Part 1 Game theory applies to more than just games. Corporations use it to influence business decisions, and militaries use it to guide their.

© 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)

Chapter 15- Game Theory: The Mathematics of Competition

Part 3: The Minimax Theorem

Game Theory and Applications following H. Varian Chapters 28 & 29.

Lectures in Microeconomics-Charles W. Upton Minimax Strategies.

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.

Finite Mathematics & Its Applications, 10/e by Goldstein/Schneider/SiegelCopyright © 2010 Pearson Education, Inc. 1 of 68 Chapter 9 The Theory of Games.

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.

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.

f has a saddle point at (1,1) 2.f has a local minimum at.

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 Warin Chotekorakul MD 1/2004. Introduction A game is a contest involving to or more players, each of whom wants to win. Game theory is the.

Q 5-2 a. E = Efficiency score wi = Weight applied to i ’s input and output resources by the composite hospital.

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.

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

THE “CLASSIC” 2 x 2 SIMULTANEOUS CHOICE GAMES Topic #4.

Game Theory: introduction and applications to computer networks Game Theory: introduction and applications to computer networks Introduction Giovanni Neglia.

Dominance Since Player I is maximizing her security level, she prefers “large” payoffs. If one row is smaller (element- wise) than another,

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

Game Theory, Part 2 Consider again the game that Sol and Tina were playing, but with a different payoff matrix: H T Tina H T Sol.

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

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.

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

Lecture 12. Game theory So far we discussed: roulette and blackjack Roulette: – Outcomes completely independent and random – Very little strategy (even.

1. 2 You should know by now… u The security level of a strategy for a player is the minimum payoff regardless of what strategy his opponent uses. u A.

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

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.

INDEX Introduction of game theory Introduction of game theory Significance of game theory Significance of game theory Essential features of game theory.

Decision Analysis Pertemuan Matakuliah: A Strategi Investasi IT Tahun: 2009.

9.2 Mixed Strategy Games In this section, we look at non-strictly determined games. For these type of games the payoff matrix has no saddle points.

DECISION MODELS. Decision models The types of decision models: – Decision making under certainty The future state of nature is assumed known. – Decision.

Game Theory [geym theer-ee] : a mathematical theory that deals with the general features of competitive situations in a formal abstract way.

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

Input – Output Models P = # of items produced

Chapter 6 Game Theory (Module 4) 1.

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 II Solutions 1

Game Theory Day 4.

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.

9.3 Linear programming and 2 x 2 games : A geometric approach

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

Operations Research: Applications and Algorithms

Presentation transcript:

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 entry in each column. Which one is the smallest? Minimax Rose\ColinABCD A4325 B-1020 C7523 D Row Minimum Column Maximum Maximin Minimax Saddle Points

Mixed Strategy  Yesterday, we discussed dominance and saddle points.  Games where ONE strategy can be played with certainty to receive the best outcome are pure strategy games  Contrastingly, when there is no saddle point (or multiple saddle points) where neither player would want to play a single strategy with certainty, it is called a mixed strategy game Example. Row Minimum: -3 and 0 Maximin 0 Column Maximum: 2 and 3 Minimax 2 Rose\ColinAB A2-3 B03

Expected Value  To analyze the effect of one or both players using mixed strategies, we can use the concept of expected value.  Let’s say in our example Colin will flip a coin to decide between strategy A and B.  Colin A and Colin B have probability of ½ each  Example.  Expected Value. Rose A: ½ (2) + ½ (-3) = - ½ Rose B: ½ (0) + ½ (3) = 3/2  Thus, if Colin is playing the mixed strategy ½ A, ½ B, then Rose should play Rose B. Rose\ColinAB A2-3 B03

If you know that your opponent is playing a given mixed strategy, and will continue to play it regardless of what you do, you should play your strategy which has the largest expected value. Expected Value Principle

Colin’s Point of View  How can Colin choose a mixed strategy such that Rose cannot take advantage of it!  Let Colin play a mixed strategy of probability x for strategy A and (1- x) for B where 0<x<1.  Thus, Colin can should play mixed strategy ¾ A, ¼ B  Expected Value. Rose A: x(2) + (1-x)(-3) = x Rose B: x (0) + (1-x)(3) = 3 - 3x  What can we do with this information? x = 3 – 3x So x = ¾  What would Rose’s average payoff be? Rose\ColinAB A2-3 B03 Rose A: ¾ (2) + ¼ (-3) = ¾ Rose B: ¾ (0) + ¼ (3) = ¾ ¾

What about 3x3?  Colin has strategies A, B, and C with probabilities (x, y, 1 – x – y)  Solve using a system of two equations in two unknowns. Rose A: Rose B: Rose C: Rose\ColinABC A122 B212 C220 (2/5, 2/5, ½)