OCR Further Discrete 2018 September — Question 3

Exam BoardOCR
ModuleFurther Discrete (Further Discrete)
Year2018
SessionSeptember
TopicDynamic Programming
3 The pay-off matrix for a zero-sum game is
XYZ
\cline { 2 - 4 } A- 210
\cline { 2 - 4 } B35- 3
\cline { 2 - 4 } C- 4- 22
\cline { 2 - 4 } D02- 1
\cline { 2 - 4 }
\cline { 2 - 4 }
  1. Show that the game does not have a stable solution.
  2. Use a graphical technique to find the optimal mixed strategy for the player on columns.
  3. Formulate an initial simplex tableau for the problem of finding the optimal mixed strategy for the player on rows.
This paper (7 questions)
View full paper
Q1 Q2 Q3 Q4 Q5 Q6 Q7