| Exam Board | AQA |
|---|---|
| Module | D2 (Decision Mathematics 2) |
| Year | 2015 |
| Session | June |
| Marks | 8 |
| Paper | Download PDF ↗ |
| Mark scheme | Download PDF ↗ |
| Topic | Dynamic Programming |
| Type | Zero-sum game stable solution |
| Difficulty | Moderate -0.8 This is a standard textbook exercise in zero-sum game theory requiring only routine application of well-defined algorithms: finding row minima/column maxima for play-safe strategies, then checking if maximin equals minimax for stability. No problem-solving insight or novel reasoning is required, making it easier than average A-level maths questions. |
| Spec | 7.08a Pay-off matrix: zero-sum games7.08b Dominance: reduce pay-off matrix7.08c Pure strategies: play-safe strategies and stable solutions |
| \multirow{5}{*}{Stan} | Strategy | D | E | F |
| A | 3 | - 3 | - 1 | |
| B | - 1 | - 4 | 2 | |
| C | 1 | 0 | - 3 | |
| \cline { 2 - 5 } | - 2 |
| Answer | Marks | Guidance |
|---|---|---|
| Answer | Mark | Guidance |
| Stan's play-safe strategy: finds row minima: A=\(-3\), B=\(-4\), C=\(-3\); maximin = \(-3\), so Stan plays A or C | M1 | Finding row minima |
| Christine's play-safe strategy: finds column maxima: D=\(3\), E=\(0\), F=\(2\), G=\(3\); minimax = \(0\), so Christine plays E | A1 A1 | A1 Stan; A1 Christine |
| Answer | Marks | Guidance |
|---|---|---|
| Answer | Mark | Guidance |
| Maximin (\(-3\)) \(\neq\) minimax (\(0\)), therefore no stable solution | B1 | Must reference both values |
| Answer | Marks | Guidance |
|---|---|---|
| Answer | Mark | Guidance |
| Dominance: strategies D and G are dominated by E (or similar argument reducing columns) | M1 | Identifying dominated strategies |
| Rows B dominated by A or C, reducing to \(2 \times 3\) then \(2 \times 2\) matrix | M1 | Further reduction shown |
| Final \(2 \times 2\) matrix for Christine correctly derived as \(\begin{pmatrix}3 & 4 & 0 \\ 1 & -2 & 3\end{pmatrix}\) explained | A1 A1 | A1 correct elimination steps; A1 correct final matrix |
# Question 2:
## Part (a)
| Answer | Mark | Guidance |
|--------|------|----------|
| Stan's play-safe strategy: finds row minima: A=$-3$, B=$-4$, C=$-3$; maximin = $-3$, so Stan plays A or C | M1 | Finding row minima |
| Christine's play-safe strategy: finds column maxima: D=$3$, E=$0$, F=$2$, G=$3$; minimax = $0$, so Christine plays E | A1 A1 | A1 Stan; A1 Christine |
## Part (b)
| Answer | Mark | Guidance |
|--------|------|----------|
| Maximin ($-3$) $\neq$ minimax ($0$), therefore no stable solution | B1 | Must reference both values |
## Part (c)
| Answer | Mark | Guidance |
|--------|------|----------|
| Dominance: strategies D and G are dominated by E (or similar argument reducing columns) | M1 | Identifying dominated strategies |
| Rows B dominated by A or C, reducing to $2 \times 3$ then $2 \times 2$ matrix | M1 | Further reduction shown |
| Final $2 \times 2$ matrix for Christine correctly derived as $\begin{pmatrix}3 & 4 & 0 \\ 1 & -2 & 3\end{pmatrix}$ explained | A1 A1 | A1 correct elimination steps; A1 correct final matrix |
I can see these are answer space pages (pages 7-11) for Questions 2 and 3 of what appears to be an AQA Decision Mathematics paper (P/Jun15/MD02). However, these images show only the **blank answer spaces** for students to write in — they do not contain any mark scheme content.
To extract mark scheme content, I would need images of the actual **mark scheme document**, which is a separate publication. The pages shown here contain:
- Page 7: Blank answer space for Question 2
- Pages 8–11: Question 3 stimulus material and blank answer spaces for Question 3
**For Question 3**, I can summarize the question content (not a mark scheme):
The question presents a 5×4 cost matrix for the Hungarian Algorithm (columns-first reduction), asking students to assign athletes A–E to Legs 1–4 to minimize total relay time.
---
If you have images of the **actual mark scheme pages**, please share those and I can extract the structured marking information you're looking for. Mark schemes are typically separate documents published by the exam board after the embargo period.
2 Stan and Christine play a zero-sum game. The game is represented by the following pay-off matrix for Stan.
\begin{table}[h]
\begin{center}
\captionsetup{labelformat=empty}
\caption{Christine}
\begin{tabular}{ | c | c | c | c | c | }
\hline
\multirow{5}{*}{Stan} & Strategy & D & E & F \\
\hline
& A & 3 & - 3 & - 1 \\
\hline
& B & - 1 & - 4 & 2 \\
\hline
& C & 1 & 0 & - 3 \\
\cline { 2 - 5 }
& & & - 2 & \\
\hline
\end{tabular}
\end{center}
\end{table}
\begin{enumerate}[label=(\alph*)]
\item Find the play-safe strategy for each player.
\item Show that there is no stable solution.
\item Explain why a suitable pay-off matrix for Christine is given by
\end{enumerate}
\hfill \mbox{\textit{AQA D2 2015 Q2 [8]}}