A2 June 2025 Q6

EdexcelCurrent spec15 marksGame Theory

6.

Player B
Option POption QOption R
Player AOption X\(4\)\(-2\)\(-5\)
Option Y\(-1\)\(1\)\(3\)

A two person zero-sum game is represented by the pay-off matrix for player A shown above.

(a) Verify that there is no stable solution to this game. (2)

Let player A play option X with probability \(p\)

(b) Use a graphical method to find the optimal value of \(p\) and hence find the best strategy for player A in this game. (6)

A third option, Z, is added to player A’s options. Option Z has the pay-offs shown in the matrix below.

Player B
Option POption QOption R
Player AOption X\(4\)\(-2\)\(-5\)
Option Y\(-1\)\(1\)\(3\)
Option Z\(4\)\(-1\)\(1\)

Player A now intends to make a random choice between options X, Y and Z, choosing option X with probability \(x\), option Y with probability \(y\) and option Z with probability \(z\)

Player A decides to use the Simplex algorithm to find the optimal values of \(x\), \(y\) and \(z\)

(c) Determine an initial Simplex tableau to solve this \(3 \times 3\) game, making your variables clear. (4)

In the optimal Simplex tableau for this \(3 \times 3\) game, \(x = 0\) and \(y = \dfrac{5}{7}\)

(d) By considering the values of the two games, determine how much better the \(3 \times 3\) game (with option Z) is for player A compared with the \(2 \times 3\) game (without option Z).
You must make your reasoning clear. (3)