AQA A-Level Further Maths
Dominance and mixed strategies
Total 27 marks
Name
Class
Date
- 1Rowan and Colin play a zero-sum game. The pay-off matrix for Rowan is . Rows are Rowan's strategies and columns are Colin's. Rowan wants to maximise his pay-off and Colin wants to minimise it.(a)Which statement about dominance in this game is correct?[1 mark]
- ARow 1 dominates row 3
- BRow 2 dominates row 1
- CRow 3 dominates row 1
- DRow 2 dominates row 3
Show the mark scheme
Mark scheme
Answer: C(b)All dominated rows and columns are removed. What is the reduced matrix?[1 mark]- A
- B
- C
- D
Show the mark scheme
Mark scheme
Answer: D(c)Explain why Colin will never play column 3.[2 marks]Show the mark scheme
Mark scheme
M1: compares columns 1 and 3, e.g. , ,
A1: Colin minimises Rowan's pay-off, so column 1 is at least as good for Colin as column 3 whatever Rowan does, so column 3 is dominatedTotal for question 1: 4 marks
- 2Rowan and Colin play a zero-sum game with pay-off matrix for Rowan . The game has no stable solution. Rowan chooses row 1 with probability and row 2 with probability , to maximise his smallest expected pay-off.(a)What is the optimal value of ?[1 mark]
- A
- B
- C
- D
Show the mark scheme
Mark scheme
Answer: B(b)What is the value of the game?[1 mark]- A
- B
- C
- D
Show the mark scheme
Mark scheme
Answer: A(c)Find Colin's optimal strategy.[2 marks]Show the mark scheme
Mark scheme
M1: Colin plays column 1 with probability and equates expected pay-offs for the two rows,
A1: , so Colin plays each column with probabilityTotal for question 2: 4 marks
- 3Rowan and Colin play a zero-sum game with pay-off matrix for Rowan . The game has no stable solution. Rowan chooses row 1 with probability and row 2 with probability . Colin has three strategies, columns 1, 2 and 3.(a)Write down Rowan's expected pay-off, in terms of , when Colin plays each of columns 1, 2 and 3.[3 marks]
Show the mark scheme
Mark scheme
B1: column 1:
B1: column 2:
B1: column 3:(b)Use these expressions to find Rowan's optimal strategy and the value of the game, and show that Colin should never play column 3.[4 marks]Show the mark scheme
Mark scheme
M1: Rowan's best guaranteed pay-off is where the lowest line is highest, i.e. equates the lines for columns 1 and 2,
A1: , so Rowan plays each row with probability
A1: value of the game is
B1: at column 3 gives , so it is worse for Colin than columns 1 and 2, and he never plays itTotal for question 3: 7 marks
- 4Rowan and Colin play a zero-sum game with pay-off matrix for Rowan . Rows are Rowan's strategies and columns are Colin's.(a)Use dominance to reduce the game to a game, and hence find Rowan's optimal mixed strategy and the value of the game.[6 marks]
Show the mark scheme
Mark scheme
M1: row 3 is dominated by row 1 (, , )
M1: column 3 is dominated by column 1 (, , )
A1: reduced matrix
M1: row 1 with probability , equate expected pay-offs,
A1: , so row 1 with probability and row 2 with probability
A1: value of the game is(b)Find Colin's optimal mixed strategy for the reduced game. Show that if Rowan uses the strategy found in part (a), Colin does worse by playing column 3.[6 marks]Show the mark scheme
Mark scheme
M1: Colin plays column 1 with probability ; expected pay-offs against rows 1 and 2
A1: and
M1: equates them,
A1: , so columns 1 and 2 each with probability and column 3 never
M1: expected pay-off to Rowan against column 3 when Rowan plays ,
A1: , so playing column 3 gives Rowan more, and so is worse for ColinTotal for question 4: 12 marks
End of questions