| Exam Board | AQA |
|---|---|
| Module | Further Paper 3 Discrete (Further Paper 3 Discrete) |
| Year | 2019 |
| Session | June |
| Marks | 1 |
| Paper | Download PDF ↗ |
| Mark scheme | Download PDF ↗ |
| Topic | Dynamic Programming |
| Type | Zero-sum game stable solution |
| Difficulty | Moderate -0.5 This is a straightforward application of the play-safe (maximin) strategy concept in game theory. Students simply need to find the minimum value in each row and select the row with the maximum of these minimums. The calculation is mechanical with no problem-solving required, though it's a Further Maths topic which elevates it slightly above basic A-level content. |
| Spec | 7.08c Pure strategies: play-safe strategies and stable solutions |
| \multirow{6}{*}{Deanna} | Will | |||
| Strategy | X | Y | Z | |
| A | -1 | 0 | 2 | |
| B | -2 | -1 | 3 | |
| C | 5 | -2 | -3 | |
| D | 6 | -2 | 0 | |
| Answer | Marks | Guidance |
|---|---|---|
| Answer | Marks | Guidance |
| A | B1 | Selects correct answer |
| Total: 1 |
## Question 1:
| Answer | Marks | Guidance |
|--------|-------|----------|
| **A** | B1 | Selects correct answer |
| **Total: 1** | | |
---1 Deanna and Will play a zero-sum game.\\
The game is represented by the following pay-off matrix for Deanna.
\begin{center}
\begin{tabular}{|l|l|l|l|l|}
\hline
\multirow{6}{*}{Deanna} & \multicolumn{4}{|c|}{Will} \\
\hline
& Strategy & X & Y & Z \\
\hline
& A & -1 & 0 & 2 \\
\hline
& B & -2 & -1 & 3 \\
\hline
& C & 5 & -2 & -3 \\
\hline
& D & 6 & -2 & 0 \\
\hline
\end{tabular}
\end{center}
Which strategy is Deanna's play-safe strategy?\\
Circle your answer.\\
A\\
B\\
C\\
D
\hfill \mbox{\textit{AQA Further Paper 3 Discrete 2019 Q1 [1]}}