Edexcel A-Level Further Maths
Mixed strategies: the graphical method
Total 27 marks
Name
Class
Date
- 1Rose and Colin play a zero-sum game with Rose's pay-off matrix , where Rose chooses the rows. Rose plays row 1 with probability and row 2 with probability .(a)Which expression is Rose's expected pay-off when Colin plays column 1?[1 mark]
- A
- B
- C
- D
Show the mark scheme
Mark scheme
Answer: A(b)What is the value of the game to Rose?[1 mark]- A
- B
- C
- D
Show the mark scheme
Mark scheme
Answer: D(c)Find Colin's optimal strategy.[2 marks]Show the mark scheme
Mark scheme
M1: Colin plays column 1 with probability ; row 1 gives and row 2 gives ; equate them
A1: , so Colin plays each column with probabilityTotal for question 1: 4 marks
- 2Rose and Colin play a zero-sum game with Rose's pay-off matrix , where Rose chooses the rows. Rose plays row 1 with probability and row 2 with probability .(a)The expected pay-off lines for columns 1 and 2 intersect at which value of ?[1 mark]
- A
- B
- C
- D
Show the mark scheme
Mark scheme
Answer: C(b)Which column does Colin never play in an optimal strategy?[1 mark]- AColumn 1
- BColumn 3
- CColumn 2
- DNone: he uses all three columns
Show the mark scheme
Mark scheme
Answer: B(c)Find Colin's optimal strategy.[2 marks]Show the mark scheme
Mark scheme
M1: uses columns 1 and 2 only; with probability on column 1, rows give and ; equate
A1: : column 1 with probability , column 2 with , column 3 withTotal for question 2: 4 marks
- 3A zero-sum game has Rose's pay-off matrix , where Rose chooses the rows. Colin plays column 1 with probability and column 2 with probability .(a)Find Colin's optimal strategy.[3 marks]
Show the mark scheme
Mark scheme
B1: Rose's expected pay-offs against Colin's mix: , , for rows 1, 2, 3
M1: Colin minimises the highest of the lines, which is where the lines for rows 1 and 2 meet:
A1: : column 1 with probability , column 2 with probability(b)Find Rose's optimal strategy and the value of the game.[4 marks]Show the mark scheme
Mark scheme
M1: Rose uses only rows 1 and 2 (the lines that meet at Colin's optimum)
M1: with row 1 played with probability : column 1 gives and column 2 gives ; equate
A1: : row 1 with , row 2 with , row 3 never
A1: valueTotal for question 3: 7 marks
- 4Two supermarkets, X and Y, each choose a promotion. The pay-off matrix shows the change in daily customers (in hundreds) for X, where X chooses between two promotions (the rows) and Y chooses between four (the columns): . Every customer gained by X is lost by Y. X plays row 1 with probability and row 2 with probability .(a)Use a graphical method to find X's optimal strategy and the value of the game to X.[6 marks]
Show the mark scheme
Mark scheme
B1: expected gains for X against Y's columns: , , ,
M1: X maximises the lowest of the four lines, the highest point of the lower boundary
M1: the boundary peaks where the lines for columns 2 and 4 meet:
A1: , so row 1 with probability and row 2 with
A1: value hundred customers
R1: at the lines for columns 1 and 3 are and , above , so they are not on the lower boundary(b)Hence find Y's optimal strategy and interpret the value of the game in context.[6 marks]Show the mark scheme
Mark scheme
B1: Y uses only columns 2 and 4 (the lines that meet at X's optimum)
M1: with column 2 played with probability and column 4 with , X's expected gains are (row 1) and (row 2)
A1: equate: , so
A1: Y plays column 2 with probability , column 4 with , columns 1 and 3 never
B1: value hundred, the same as in (a)
R1: in the long run X gains about customers per day and Y loses the same numberTotal for question 4: 12 marks
End of questions