Title of Lecture

1 Faculty of computing
 
 Value of game
 Movement Diagram
 Saddle Point
 Pure Strategy
 Dominance Strategy

2 Faculty of computing
3 Faculty of computing
Zero-sum game

Value of Game

4 Faculty of computing
 (+1)+(-1)=0

5
Saddle In a matrix game, an outcome is a saddle point if the
Point
outcome is a minimum in its row and maximum in its
column.

Finding
Some matrix games the row maximin and the column
the
saddle
minimax are same numbers, and in those games there
point is saddle point.

Pure A game in which the best strategy for each player is to

Strategy play one strategy throughout the game.

6 Faculty of computing
 Movement diagram

Colin Colin

H T H T
H (0,0) (1,-1) H
Rose Rose
T (-1,1) (2,-2) T

7 Faculty of computing
 Colin
Row
H T min

H 0 1 0 maximin
Saddle Point = 0
Rose
T -1 2 -1

Col max 0 2
Value of game = 0
minimax

8 Faculty of computing
  A strategy S dominates a strategy T if every outcome in S is
at least as good as the corresponding outcome in T, and at
least one outcome in S is strictly better than the
corresponding outcome in T.

Dominance Principle

 A rational player should never play a dominated strategy.

9 Faculty of computing
Example. Find all cases of dominance among Rose strategies and
among Colin strategies.

Colin
A B C D

A 3 -6 2 -4

Rose B 2 1 0 1

C -4 3 -5 4

10 Faculty of computing
 Colin
B C
A -6 2
Rose B 1 0
C 3 -5

Colin B dominates Colin D.

Colin C dominates Colin A.

11 Faculty of computing
 Finding the saddle points in the following game.
Draw the movement diagrams for the game.

Colin
A B C
Rose A -2 0 4
B 2 1 3
C 3 -1 -2

12 Faculty of computing
 Summary of Lecture

Two-Person
 Value of game
 Movement Diagram
 Saddle Point
 Pure Strategy
 Dominance Strategy

13 Faculty of computing
 Preview Next Lecture

 Mixed Strategies
 Expected Value
Oddment Method
Equalizing Expectation Method

14 Faculty of computing