AQA Further Paper 3 Discrete Specimen — Question 8

Exam BoardAQA
ModuleFurther Paper 3 Discrete (Further Paper 3 Discrete)
SessionSpecimen
TopicDynamic Programming
8 John and Danielle play a zero-sum game which does not have a stable solution. The game is represented by the following pay-off matrix for John.
\multirow{2}{*}{}Danielle
Strategy\(\boldsymbol { X }\)\(Y\)\(\boldsymbol { Z }\)
\multirow{3}{*}{John}\(A\)21-1
B-3-22
\(\boldsymbol { C }\)-3-41
Find the optimal mixed strategy for John.
This paper (8 questions)
View full paper
Q1 1 Q2 1 Q3 2 Q4 3 Q5 3 Q6 10 Q7 4 Q8