When dealing with a model, we use the letter  for the mean. We write or, more often, replacing p by, Instead of , we can also write E(X ). ( Think of.

Slides:



Advertisements
Similar presentations
The Mean of a Discrete Random Variable
Advertisements

NON - zero sum games.
GAME THEORY.
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
Totally Unimodular Matrices
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.
A Beautiful Game John C. Sparks AFRL/WS (937) Wright-Patterson Educational Outreach The Air Force Research Laboratory.
1 1 Slide © 2009 South-Western, a part of Cengage Learning Slides by John Loucks St. Edward’s University.
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
Study Group Randomized Algorithms 21 st June 03. Topics Covered Game Tree Evaluation –its expected run time is better than the worst- case complexity.
Game theory.
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: introduction and applications to computer networks Game Theory: introduction and applications to computer networks Zero-Sum Games (follow-up)
9.2 Mixed Strategies Two players, Robert and Carol, play a game with payoff matrix (to Robert): Is the game strictly determined? Why? Robert has strategy:
Random Variables. Definitions A random variable is a variable whose value is a numerical outcome of a random phenomenon,. A discrete random variable X.
Part 3: The Minimax Theorem
Artificial Intelligence for Games and Puzzles1 Games in the real world Many real-world situations and problems.
An Introduction to Game Theory Part III: Strictly Competitive Games Bernhard Nebel.
Lectures in Microeconomics-Charles W. Upton Minimax Strategies.
Finite Mathematics & Its Applications, 10/e by Goldstein/Schneider/SiegelCopyright © 2010 Pearson Education, Inc. 1 of 68 Chapter 9 The Theory of Games.
Artificial Intelligence for Games and Puzzles1 Games in the real world Many real-world situations and.
Game Theory Objectives:
HW Review Suppose a game has a payoff matrix of: Calculate the expected values for the following strategy: R WinsProb a)Prob b)Prob c)Prob d) R1, C111*.5=.5.3*.4=.120*.4=0.1*.2=.02.
Game Theory.
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.
Games of Incomplete Information. These games drop the assumption that players know each other’s preferences. Complete info: players know each other’s preferences.
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.
1. problem set 6 from Osborne’s Introd. To G.T. p.210 Ex p.234 Ex p.337 Ex. 26,27 from Binmore’s Fun and Games.
Game Theory.
Chapter 12 & Module E Decision Theory & Game Theory.
A study of education followed a large group of fourth-grade children to see how many years of school they eventually completed. Let x be the highest year.
Chapter 5 Discrete Probability Distributions
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 is the study of the best play–safe strategy to adopt if 2 players are playing a game where decisions affect each other. Ex Two men are caught.
Discrete Random Variables
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.
Lecture 12. Game theory So far we discussed: roulette and blackjack Roulette: – Outcomes completely independent and random – Very little strategy (even.
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. 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.
Chapter 16 Notes: Decision Making under Uncertainty Introduction Laplace Rule Maximin Rule Maximax Rule Hurwicz Rule Minimax Regret Rule Examples Homework:
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.
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.
Game Theory [geym theer-ee] : a mathematical theory that deals with the general features of competitive situations in a formal abstract way.
Game Theory Just last week:
Tools for Decision Analysis: Analysis of Risky Decisions
Input – Output Models P = # of items produced
Solve the following game graphically
Chapter 6 Game Theory (Module 4) 1.
Game Theory.
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
A study of education followed a large group of fourth-grade children to see how many years of school they eventually completed. Let x be the highest year.
Making Decisions Under Uncertainty
Lecture 20 Linear Program Duality
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.
Presentation transcript:

When dealing with a model, we use the letter  for the mean. We write or, more often, replacing p by, Instead of , we can also write E(X ). ( Think of this as being what we expect to get on average ). This notation comes from the idea of the mean being the E xpected value of the r.v. X. Mean of a Discrete Random Variable S1 Reminder about Expectation

e.g. 1. A random variable X has the probability distribution P x (X = ) p Find (a) the value of p and (b) the mean of X. Solution: (a) Since X is a discrete r.v., (b) mean,

54Col max – Row min 21 B A Mixed Strategies Using probabilities to determine the best mixed strategy 1) 2  2 games maximin minimax Max(row/min) 2 ≠ Min(col max) 4 so not stable Check to see if there is a stable solution

5– B A Suppose player A chooses option 1 (row1) with probability p and option 2 (row 2) with probability 1– p If B chooses option 2 then the expected win for A is: E(win) = 2  p + 5(1 – p) = –3p + 5 The expected pay–off is deduced using E(X) =  x  P(X=x) from S1 If B chooses option 1 then the expected win for A is: E(win) = 4p – 3(1 – p) = 7p – 3 p 1–p

A`s expected pay-off p B chooses 1 B chooses 2 7p – 3 = –3p p = 8 p = 0.8 These 2 lines are plotted as shown and intersect at the highest minimum winnings when: 7p – 3 = –3p p = 8 p = 0.8 E(win) = –3p + 5 E(win) = 7p – 3

So if A chooses option 1 with probability 0.8 then his expected win is: E(win) = 7  0.8 – 3 = 2.6 E(win) = 7p – 3 If B chooses option 1 then If A chooses option 1 with a value of less than 0.8 then: If B chooses option 2 thenE(win) = –3p + 5 E(win) = 7p – 3 E(win ) ≥ 2.6 E(win) ≤ 2.6 The expected win of 2.6 is the greatest that A can guarantee. The value of the game is 2.6.V(A) = 2.6

The same analysis can be carried out for player B but considering the losses. Remember the matrix shows A`s gain so to find B`s gain change the signs. 5– B A A`s gain –532 –2–41 21 B A B`s gain

Suppose player B chooses option 1(col 1) with probability q and option 2 (col 2) with probability 1 – q –532 –2–41 21 B A If A chooses option 2 then the expected win for B is: The expected pay–off is deduced using E(X) =  x  P(X=x) from S1 If A chooses option 1 then the expected win for B is: E(win) = –4q – 2(1 – q) = –2q – 2 E(win) = 3  q – 5(1 – q) = 8q – 5 q 1–q

The intersection of these 2 lines occurs when: –2q – 2 = 8q – 5 10q = 3 q = 0.3 If q = 0.3 then B expects to lose 2.6 as we expected from considering A`s winnings. So to minimise his loses B should choose option 1 with probability 0.3 and option 2 with probability 0.7 E(win) = –2q – 2 = -2.6