11.1: Strictly Determined Games

Last updated
Save as PDF

Page ID: 37939

$ \newcommand{\vecs}[1]{\overset { \scriptstyle \rightharpoonup} {\mathbf{#1}} } $

$ \newcommand{\vecd}[1]{\overset{-\!-\!\rightharpoonup}{\vphantom{a}\smash {#1}}} $

$ \newcommand{\id}{\mathrm{id}}$ $ \newcommand{\Span}{\mathrm{span}}$

( \newcommand{\kernel}{\mathrm{null}\,}\) $ \newcommand{\range}{\mathrm{range}\,}$

$ \newcommand{\RealPart}{\mathrm{Re}}$ $ \newcommand{\ImaginaryPart}{\mathrm{Im}}$

$ \newcommand{\Argument}{\mathrm{Arg}}$ $ \newcommand{\norm}[1]{\| #1 \|}$

$ \newcommand{\inner}[2]{\langle #1, #2 \rangle}$

$ \newcommand{\Span}{\mathrm{span}}$

$ \newcommand{\id}{\mathrm{id}}$

$ \newcommand{\Span}{\mathrm{span}}$

$ \newcommand{\kernel}{\mathrm{null}\,}$

$ \newcommand{\range}{\mathrm{range}\,}$

$ \newcommand{\RealPart}{\mathrm{Re}}$

$ \newcommand{\ImaginaryPart}{\mathrm{Im}}$

$ \newcommand{\Argument}{\mathrm{Arg}}$

$ \newcommand{\norm}[1]{\| #1 \|}$

$ \newcommand{\inner}[2]{\langle #1, #2 \rangle}$

$ \newcommand{\Span}{\mathrm{span}}$ $ \newcommand{\AA}{\unicode[.8,0]{x212B}}$

$ \newcommand{\vectorA}[1]{\vec{#1}} % arrow$

$ \newcommand{\vectorAt}[1]{\vec{\text{#1}}} % arrow$

$ \newcommand{\vectorB}[1]{\overset { \scriptstyle \rightharpoonup} {\mathbf{#1}} } $

$ \newcommand{\vectorC}[1]{\textbf{#1}} $

$ \newcommand{\vectorD}[1]{\overrightarrow{#1}} $

$ \newcommand{\vectorDt}[1]{\overrightarrow{\text{#1}}} $

$ \newcommand{\vectE}[1]{\overset{-\!-\!\rightharpoonup}{\vphantom{a}\smash{\mathbf {#1}}}} $

$ \newcommand{\vecs}[1]{\overset { \scriptstyle \rightharpoonup} {\mathbf{#1}} } $

$ \newcommand{\vecd}[1]{\overset{-\!-\!\rightharpoonup}{\vphantom{a}\smash {#1}}} $

$\newcommand{\avec}{\mathbf a}$ $\newcommand{\bvec}{\mathbf b}$ $\newcommand{\cvec}{\mathbf c}$ $\newcommand{\dvec}{\mathbf d}$ $\newcommand{\dtil}{\widetilde{\mathbf d}}$ $\newcommand{\evec}{\mathbf e}$ $\newcommand{\fvec}{\mathbf f}$ $\newcommand{\nvec}{\mathbf n}$ $\newcommand{\pvec}{\mathbf p}$ $\newcommand{\qvec}{\mathbf q}$ $\newcommand{\svec}{\mathbf s}$ $\newcommand{\tvec}{\mathbf t}$ $\newcommand{\uvec}{\mathbf u}$ $\newcommand{\vvec}{\mathbf v}$ $\newcommand{\wvec}{\mathbf w}$ $\newcommand{\xvec}{\mathbf x}$ $\newcommand{\yvec}{\mathbf y}$ $\newcommand{\zvec}{\mathbf z}$ $\newcommand{\rvec}{\mathbf r}$ $\newcommand{\mvec}{\mathbf m}$ $\newcommand{\zerovec}{\mathbf 0}$ $\newcommand{\onevec}{\mathbf 1}$ $\newcommand{\real}{\mathbb R}$ $\newcommand{\twovec}[2]{\left[\begin{array}{r}#1 \\ #2 \end{array}\right]}$ $\newcommand{\ctwovec}[2]{\left[\begin{array}{c}#1 \\ #2 \end{array}\right]}$ $\newcommand{\threevec}[3]{\left[\begin{array}{r}#1 \\ #2 \\ #3 \end{array}\right]}$ $\newcommand{\cthreevec}[3]{\left[\begin{array}{c}#1 \\ #2 \\ #3 \end{array}\right]}$ $\newcommand{\fourvec}[4]{\left[\begin{array}{r}#1 \\ #2 \\ #3 \\ #4 \end{array}\right]}$ $\newcommand{\cfourvec}[4]{\left[\begin{array}{c}#1 \\ #2 \\ #3 \\ #4 \end{array}\right]}$ $\newcommand{\fivevec}[5]{\left[\begin{array}{r}#1 \\ #2 \\ #3 \\ #4 \\ #5 \\ \end{array}\right]}$ $\newcommand{\cfivevec}[5]{\left[\begin{array}{c}#1 \\ #2 \\ #3 \\ #4 \\ #5 \\ \end{array}\right]}$ $\newcommand{\mattwo}[4]{\left[\begin{array}{rr}#1 \amp #2 \\ #3 \amp #4 \\ \end{array}\right]}$ $\newcommand{\laspan}[1]{\text{Span}\{#1\}}$ $\newcommand{\bcal}{\cal B}$ $\newcommand{\ccal}{\cal C}$ $\newcommand{\scal}{\cal S}$ $\newcommand{\wcal}{\cal W}$ $\newcommand{\ecal}{\cal E}$ $\newcommand{\coords}[2]{\left\{#1\right\}_{#2}}$ $\newcommand{\gray}[1]{\color{gray}{#1}}$ $\newcommand{\lgray}[1]{\color{lightgray}{#1}}$ $\newcommand{\rank}{\operatorname{rank}}$ $\newcommand{\row}{\text{Row}}$ $\newcommand{\col}{\text{Col}}$ $\renewcommand{\row}{\text{Row}}$ $\newcommand{\nul}{\text{Nul}}$ $\newcommand{\var}{\text{Var}}$ $\newcommand{\corr}{\text{corr}}$ $\newcommand{\len}[1]{\left|#1\right|}$ $\newcommand{\bbar}{\overline{\bvec}}$ $\newcommand{\bhat}{\widehat{\bvec}}$ $\newcommand{\bperp}{\bvec^\perp}$ $\newcommand{\xhat}{\widehat{\xvec}}$ $\newcommand{\vhat}{\widehat{\vvec}}$ $\newcommand{\uhat}{\widehat{\uvec}}$ $\newcommand{\what}{\widehat{\wvec}}$ $\newcommand{\Sighat}{\widehat{\Sigma}}$ $\newcommand{\lt}{<}$ $\newcommand{\gt}{>}$ $\newcommand{\amp}{&}$ $\definecolor{fillinmathshade}{gray}{0.9}$

In this chapter, we will study games that involve only two players. In these games, since a win for one person is a loss for the other, we refer to them as two-person zero-sum games. Although the games we will study here are fairly simple, they will provide us with an understanding of how games work and how they are applied in practical situations. We begin with an example.

Example $\PageIndex{1}$

Robert and Carol decide to play a game using a dime and a quarter. Each chooses one of the two coins, puts it in their hand and closes their fist. At a given signal, they simultaneously open their fists. If the sum of the coins is less than 35 cents, Robert gets both coins, otherwise, Carol gets both coins. Write the matrix for the game, determine the optimal strategies for each player, and find the expected payoff for Robert.

Solution

Suppose Robert is the row player, that is, he plays the rows, and Carol is a column player. If Robert shows a dime and Carol shows a dime, the sum will be less than thirty five cents and Robert will win ten cents. But, if Robert shows a dime and Carol shows a quarter, the sum will not be less than thirty five cents and Carol will win ten cents or Robert will lose ten cents. The following matrix depicts all four cases and their corresponding payoffs for Robert. Remember a negative value is a loss for Robert and a win for Carol.

$Example11.1.1.png$

The best strategy for Robert is to always show a dime because this way the worst he can do is lose ten cents. And, the best strategy for Carol is to always show a quarter because that way the worst she can do is to lose ten cents. If both Robert and Carol play their optimal strategies, Robert will lose ten cents each time. Therefore, the value of the game is negative ten cents.

In the above example, since there is only one fixed optimal strategy for each player, regardless of their opponent's strategy, we say the game possesses a pure strategy and is strictly determined.

Next, we formulate a method to find the optimal strategy for each player and the value of the game. The method involves considering the worst scenario for each player.

To consider the worst situation, the row player considers the minimum value in each row, and the column player considers the maximum value in each column. Note that the maximum value really represents a minimum value for the column player because the game matrix depicts the payoffs for the row player. We list the method below.

Finding the Optimal Strategy and the Value for Strictly Determined Games

Put an asterisk(*) next to the minimum entry in each row.
Put a box around the maximum entry in each column.
The entry that has both an asterisk and a box represents the value of the game and is called a saddle point.
The row that is associated with the saddle point represents the best strategy for the row player, and the column that is associated with the saddle point represents the best strategy for the column player.
A game matrix can have more than one saddle point, but all saddle points have the same value.
If no saddle point exists, the game is not strictly determined. Non-strictly determined games are the subject of the next section.

Example $\PageIndex{2}$

Find the saddle points and optimal strategies for the following game.

$Example11.1.1a.png$

Solution

We find the saddle point by placing an asterisk next to the minimum entry in each row, and by putting a box around the maximum entry in each column as shown below.

$Example11.1.1b.png$

Since the second row, first column entry, which happens to be 10, has both an asterisk and a box, it is a saddle point. This implies that the value of the game is 10, and the optimal strategy for the row player is to always play row 2, and the optimal strategy for the column player is to always play column 1. If both players play their optimal strategies, the row player will win 10 units each time.

The row player's strategy is written as $\left[\begin{array}{ll}
0 & 1
\end{array}\right]$ indicating that he will play row 1 with a probability of 0 and row 2 with a probability of 1.

Similarly the column player's strategy is written as $\left[\begin{array}{l}
1 \\
0
\end{array}\right]$ implying that he will play column 1 with a probability of 1, and column 2 with a probability of 0.

Search

Text Color

Text Size

Margin Size

Font Type

Solution

Solution

Example \(\PageIndex{1}\)

Solution

Finding the Optimal Strategy and the Value for Strictly Determined Games

Example \(\PageIndex{2}\)

Solution