D2.5.3 Reduction of pay-off matrices using dominance arguments.

Section
D2.5 Game theory
Level
A level only
Statement
Reduction of pay-off matrices using dominance arguments.
Since 2018
5 parts, 16 marks · topic pages: Game theory

Back to the checklist

June 2023 · Paper 4D (Decision 2) · Q8(b) 2 marks
(b) Explain why player A should never play option T. You must make your reasoning clear. (2)
June 2023 · Paper 4D (Decision 2) · Q8(d) 6 marks
The linear programming problem is solved using the Simplex algorithm. The optimal value of p1 and the optimal value of p2 is is (d) Find the best strategy for player B, defining any variables you use. (6)
June 2022 · Paper 4D (Decision 2) · Q7(c) 2 marks
(c) Explain why player B should never play option X. You must make your reasoning clear. (2)
Oct 2020 · Paper 4D (Decision 2) · Q6(a) 2 marks
6. Player B Option X Option Y Option Z Option Q Option R -3 Player A Option S -4 -2 Option T -2 A two person zero-sum game is represented by the pay-off matrix for player A, shown above. (a) Explain, with justification, why this matrix may be reduced to a 3 x 3 matrix by removing option S from player A’s choices. (2)
June 2019 · Paper 4D (Decision 2) · Q4(e) 4 marks
(e) Determine the optimal strategy for player B, making your reasoning clear. (4)

Find an Edexcel Further Maths tutor

Stuck on this? Book a trial lesson with our Further Maths tutor.

Prefer email? Send an enquiry

If you are under 18, please include a parent's contact details. Enquiries go to enquiries@alevelfurthermathstutor.com and are deleted once handled.