| Exam Board | OCR |
|---|---|
| Module | Further Discrete AS (Further Discrete AS) |
| Year | 2023 |
| Session | June |
| Marks | 6 |
| Paper | Download PDF ↗ |
| Mark scheme | Download PDF ↗ |
| Topic | Linear Programming |
| Type | Game theory LP formulation |
| Difficulty | Challenging +1.2 This is a standard game theory question requiring dominance reduction and LP formulation for mixed strategies. While it involves multiple steps (identifying dominated strategies, setting up inequalities, solving), the techniques are routine for Further Maths students who have studied this topic. The payoff matrix is straightforward with no unusual complications, making this slightly above average difficulty but well within expected scope. |
| Spec | 7.08a Pay-off matrix: zero-sum games7.08b Dominance: reduce pay-off matrix7.08e Mixed strategies: optimal strategy using equations or graphical method |
| W | X | Y | Z | ||
| \cline { 2 - 6 } Ryan | A | 4 | 0 | 2 | 1 |
| B | 0 | 2 | - 3 | 4 | |
| C | 1 | 4 | - 4 | 5 | |
| D | 6 | - 1 | 5 | 0 |
| Answer | Marks | Guidance |
|---|---|---|
| 6 | (a) | Delete W |
| Answer | Marks |
|---|---|
| D -1 5 | B1 |
| Answer | Marks |
|---|---|
| [2] | 2.2a |
| 2.2a | From column headings in a reduced table |
| Answer | Marks | Guidance |
|---|---|---|
| A | B | C |
| X | 0 | -2 |
| Y | -2 | 3 |
| Answer | Marks | Guidance |
|---|---|---|
| 6 | (b) | X has probability p and Y has prob 1 – p |
| Answer | Marks | Guidance |
|---|---|---|
| D: –p + 5(1 – p) = 5 – 6p | M1 ft | 3.1a |
| Answer | Marks | Guidance |
|---|---|---|
| D: p – 5(1 – p) = –5 + 6p | X has probability p and Y has prob 1 – p | M1 ft |
| A: 0p – 2(1 – p) = –2 + 2p | M1 ft | Using their reduced table (or correct) and their (single) variable |
| B: –2p + 3(1 – p) = –5p + 3 | At least two correct expressions (need not be simplified) | |
| C: –4p + 4(1 – p) = –8p + 4 | seen or implied from graph | |
| D: p – 5(1 – p) = –5 + 6p | Using negatives of values from original table means that these are |
| Answer | Marks |
|---|---|
| 14 | M1 ft |
| Answer | Marks |
|---|---|
| [4] | 3.1a |
| Answer | Marks |
|---|---|
| 3.2a | Solving for (their) p (graphically or algebraically or implied) |
| Answer | Marks | Guidance |
|---|---|---|
| 6 | (b) | cont |
| Answer | Marks |
|---|---|
| 2 | Or the negatives of these for the alternative method |
| Answer | Marks | Guidance |
|---|---|---|
| 6 | 0 | 24 |
| 10.5 | 1.5 | 43.5 |
| 11.25 | 3.75 | 48.75 |
Question 6:
6 | (a) | Delete W
Delete Z
X Y
A 0 2
B 2 -3
C 4 -4
D -1 5 | B1
B1
[2] | 2.2a
2.2a | From column headings in a reduced table
Ignore if any rows also deleted
In each row, value in col W > value in col Y
So col W is dominated by col Y or col Y dominates col W
From column headings in a reduced table
Ignore if any rows also deleted
In each row, value in col Z > value in X
So col Z is dominated by col X or col X dominates col Z
Alternative method
A | B | C | D
X | 0 | -2 | -4 | 1
Y | -2 | 3 | 4 | -5
Or transposed
For reference:
W X Y Z
A 4 0 2 1
B 0 2 -3 4
C 1 4 -4 5
D 6 -1 5 0
6 | (b) | X has probability p and Y has prob 1 – p
A: 0p + 2(1 – p) = 2 – 2p
B: 2p – 3(1 – p) = 5p – 3
C: 4p – 4(1 – p) = 8p – 4
D: –p + 5(1 – p) = 5 – 6p | M1 ft | 3.1a | Definition of p may be implied for M marks
Using their reduced table (or correct) and their (single) variable
At least two correct expressions (need not be simplified)
seen or implied from graph
Using values from original table means that these are losses for
Casey, so will need the minimax (lowest point of upper boundary)
Alternative method (change signs)
X has probability p and Y has prob 1 – p
A: 0p – 2(1 – p) = –2 + 2p
B: –2p + 3(1 – p) = –5p + 3
C: –4p + 4(1 – p) = –8p + 4
D: p – 5(1 – p) = –5 + 6p | X has probability p and Y has prob 1 – p | M1 ft | Definition of p may be implied for M marks
A: 0p – 2(1 – p) = –2 + 2p | M1 ft | Using their reduced table (or correct) and their (single) variable
B: –2p + 3(1 – p) = –5p + 3 | At least two correct expressions (need not be simplified)
C: –4p + 4(1 – p) = –8p + 4 | seen or implied from graph
D: p – 5(1 – p) = –5 + 6p | Using negatives of values from original table means that these are
gains for Casey, so will need the maximin (highest point of lower
boundary)
8p – 4 = 5 – 6p
9
p =
14
Optimal mixed strategy: choose randomly
9
between X and Y, choosing X with prob
14
5
and Y with prob
14 | M1 ft
A1
A1
[4] | 3.1a
1.1
3.2a | Solving for (their) p (graphically or algebraically or implied)
p = 0.643 (or better) (0.6428571…) (cao)
Correct probabilities described in context involving both X and Y
Or correct ratios o.e.
e.g randomly choose X 1.8 times as often as Y
6 | (b) | cont | If W and Z are chosen
X has probability p and Y has prob 1 – p
A: 4p + (1 – p) = 1 + 3p
B: 0 + 4(1 – p) = 4 –4p
C: p + 5(1 – p) = 5 –4p
D: 6p + 0(1 – p) = 6p
5 – 4p = 6p (= 1)
2 | Or the negatives of these for the alternative method
Definition of p may be implied for M marks
Using their reduced table (or correct) and their (single) variable
At least two correct expressions (need not be simplified)
seen or implied from graph
Or 4p – 5 = -6p for the alternative method
M1 ft
M1 ft
A0
A0
If W and Z are chosen
X has probability p and Y has prob 1 – p
A: 4p + (1 – p) = 1 + 3p
B: 0 + 4(1 – p) = 4 –4p
C: p + 5(1 – p) = 5 –4p
D: 6p + 0(1 – p) = 6p
5 – 4p = 6p (= 1)
2
Or the negatives of these for the alternative method
Definition of p may be implied for M marks
Using their reduced table (or correct) and their (single) variable
At least two correct expressions (need not be simplified)
seen or implied from graph
Or 4p – 5 = -6p for the alternative method
6 | 0 | 24
10.5 | 1.5 | 43.5
11.25 | 3.75 | 48.75
6 Ryan and Casey are playing a card game in which they each have four cards.
\begin{itemize}
\item Ryan's cards have the letters A, B, C and D.
\item Casey's cards have the letters W, X, Y and Z.
\end{itemize}
Each player chooses one of their four cards and they simultaneously reveal their choices.
The table shows the number of points won by Ryan for each combination of strategies.
\begin{table}[h]
\begin{center}
\captionsetup{labelformat=empty}
\caption{Casey}
\begin{tabular}{ c c | c c c c }
& & W & X & Y & Z \\
\cline { 2 - 6 }
Ryan & A & 4 & 0 & 2 & 1 \\
& B & 0 & 2 & - 3 & 4 \\
& C & 1 & 4 & - 4 & 5 \\
& D & 6 & - 1 & 5 & 0 \\
\end{tabular}
\end{center}
\end{table}
For example, if Ryan chooses A and Casey chooses W then Ryan wins 4 points (and Casey loses 4 points).
Both Ryan and Casey are trying to win as many points as possible.
\begin{enumerate}[label=(\alph*)]
\item Use dominance to reduce the $4 \times 4$ table for the zero-sum game above to a $4 \times 2$ table.
\item Determine an optimal mixed strategy for Casey.
\end{enumerate}
\hfill \mbox{\textit{OCR Further Discrete AS 2023 Q6 [6]}}