: Edexcel past-paper questions pack
Back to the topic page

Game theory

Past-paper questions pack

Name
Class
Date set
Date due
Score/ 199

Questions are numbered; the mark schemes (the answer key) follow on separate pages so the question pages can be handed out alone. www.alevelfurthermathstutor.com

Edexcel AS and A-level Further Maths past-paper questions since June 2018 · 62 parts, 199 marks · mark schemes follow the questions · www.alevelfurthermathstutor.com · Questions and mark schemes © Pearson Education Ltd

1. June 2025 · AS Paper 2 (Decision 2) · Q3(a) · 3 marks
3. Layla and Mohsin play a zero-sum game represented by the following pay-off matrix for Layla. Mohsin plays X Mohsin plays Y Mohsin plays Z Layla plays P -2 Layla plays Q -4 -5 Layla plays R -1 -3 (a) (i) Find the play-safe strategies for each player. (ii) State, giving a reason, whether there is a stable solution to this game. (3)
2. June 2025 · AS Paper 2 (Decision 2) · Q3(b)(i) · 1 marks
(b) Option R is now removed from Layla’s choices. (i) For each of Mohsin’s three options, find the expected pay-off to Layla when she plays options P and Q equally often. (1)
3. June 2025 · AS Paper 2 (Decision 2) · Q3(b)(ii) · 7 marks
(ii) Use a graphical method to determine Layla’s optimal mixed strategy. You should define any variables you use. (7)
4. June 2025 · Paper 4D (Decision 2) · Q6(a) · 2 marks
6. Player B Option P Option Q Option R Option X –2 –5 Player A Option Y –1 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)
5. June 2025 · Paper 4D (Decision 2) · Q6(b) · 6 marks
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)
6. June 2025 · Paper 4D (Decision 2) · Q6(c) · 4 marks
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 P Option Q Option R Option X –2 –5 Player A Option Y –1 Option Z –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 x 3 game, making your variables clear. (4)
7. June 2025 · Paper 4D (Decision 2) · Q6(d) · 3 marks
In the optimal Simplex tableau for this 3 x 3 game, x = 0 and y = 5 (d) By considering the values of the two games, determine how much better the 3 x 3 game (with option Z) is for player A compared with the 2 x 3 game (without option Z). You must make your reasoning clear. (3)
8. June 2024 · AS Paper 2 (Decision 2) · Q3(a) · 2 marks
3. Haruki and Meera play a zero‑sum game. The game is represented by the following pay‑off matrix for Haruki. Meera Option X Option Y Option Z Option A –2 –5 Option B –3 Haruki Option C –1 Option D –4 (a) Determine whether the game has a stable solution. (2)
9. June 2024 · AS Paper 2 (Decision 2) · Q3(b) · 1 marks
Option Y for Meera is now removed. (b) Write down the reduced pay‑off matrix for Meera. (1)
10. June 2024 · AS Paper 2 (Decision 2) · Q3(c) · 7 marks
(c) (i) Given that Meera plays Option X with probability p, determine her best strategy. (ii) State the value of the game to Haruki. (iii) State which option(s) Haruki should never play. (7)
11. June 2024 · AS Paper 2 (Decision 2) · Q3(d) · 4 marks
The number of points scored by Haruki when he plays Option C and Meera plays Option X changes from –1 to k Given that the value of the game is now the same for both players, (d) determine the value of k. You must make your method and working clear. (4)
12. June 2024 · Paper 4D (Decision 2) · Q7(a) · 2 marks
7. Player B Option X Option Y Option Z Option R –3 Player A Option S –2 Option T –1 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)
13. June 2024 · Paper 4D (Decision 2) · Q7(b) · 5 marks
Player A intends to make a random choice between options R, S and T, choosing option R with probability p1, option S with probability p2 and option T with probability p3 Player A wants to find the optimal values of p1, p2 and p3 using the Simplex algorithm. Player A formulates the following objective function for the corresponding linear programme. Maximise P = V where V = the value of the game + 3 (b) Determine an initial Simplex tableau, making your variables and working clear. (5)
14. June 2024 · Paper 4D (Decision 2) · Q7(c) · 3 marks
After several iterations of the Simplex algorithm, a possible final tableau is b.v. V p1 p2 p3 r s t u Value -3 -1 p3 -1 -1 p2 V -1 p1 P (c) (i) State the best strategy for player A. (ii) Calculate the value of the game for player B. (3)
15. June 2024 · Paper 4D (Decision 2) · Q7(d) · 3 marks
Player B intends to make a random choice between options X, Y and Z. (d) Determine the best strategy for player B, making your method and working clear. (3)
16. June 2023 · AS Paper 2 (Decision 2) · Q3(a) · 3 marks
3. A two‑person zero‑sum game is represented by the following pay‑off matrix for player A. B plays X B plays Y A plays Q –2 A plays R –1 A plays S A plays T (a) (i) Show that this game is stable. (ii) State the value of this game to player B. (3)
17. June 2023 · AS Paper 2 (Decision 2) · Q3(b) · 1 marks
Option S is removed from player A’s choices and the reduced game, with option S removed, is no longer stable. (b) Write down the reduced pay‑off matrix for player B. (1)
18. June 2023 · AS Paper 2 (Decision 2) · Q3(c) · 6 marks
Let B play option X with probability p and option Y with probability 1 – p. (c) Use a graphical method to find the optimal value of p and hence find the best strategy for player B in the reduced game. (6)
19. June 2023 · AS Paper 2 (Decision 2) · Q3(d) · 4 marks
(d) (i) Find the value of the reduced game to player A. (ii) State which option player A should never play in the reduced game. (iii) Hence find the best strategy for player A in the reduced game. (4)
20. June 2023 · Paper 4D (Decision 2) · Q8(a) · 2 marks
8. A two-person zero-sum game is represented by the pay-off matrix for player A shown below. Player B Option X Option Y Option Z Option Q -3 Option R -1 Player A Option S -2 -1 Option T -4 (a) Verify that there is no stable solution to this game. (2)
21. 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)
22. June 2023 · Paper 4D (Decision 2) · Q8(c) · 7 marks
Player A intends to make a random choice between options Q, R and S, choosing option Q with probability p1, option R with probability p2 and option S with probability p3 Player A wants to calculate the optimal values of p1, p2 and p3 using the Simplex algorithm. (c) (i) Formulate the game as a linear programming problem for player A. You should write the constraints as equations. (ii) Write down an initial Simplex tableau for this linear programming problem, making your variables clear. (7)
23. 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)
24. June 2022 · AS Paper 2 (Decision 2) · Q3(a) · 1 marks
3. Terry and June play a zero‑sum game. The pay‑off matrix shows the number of points that Terry scores for each combination of strategies. June Option X Option Y Option A Option B –2 Terry Option C –1 Option D –4 (a) Explain the meaning of ‘zero‑sum’ game. (1)
25. June 2022 · AS Paper 2 (Decision 2) · Q3(b) · 2 marks
(b) Verify that there is no stable solution to the game. (2)
26. June 2022 · AS Paper 2 (Decision 2) · Q3(c) · 1 marks
(c) Write down the pay‑off matrix for June. (1)
27. June 2022 · AS Paper 2 (Decision 2) · Q3(d) · 7 marks
(d) (i) Find the best strategy for June, defining any variables you use. (ii) State the value of the game to Terry. (7)
28. June 2022 · AS Paper 2 (Decision 2) · Q3(e) · 3 marks
Let Terry play option A with probability t. (e) By writing down a linear equation in t, find the best strategy for Terry. (3)
29. June 2022 · Paper 4D (Decision 2) · Q7(a) · 2 marks
7. Player B Option W Option X Option Y Option Z Option Q –1 –2 Player A Option R –3 –4 k Option S –1 –3 A two person zero‑sum game is represented by the pay‑off matrix for player A shown above. It is given that k is an integer. (a) Show that Q is the play‑safe option for player A regardless of the value of k. (2)
30. June 2022 · Paper 4D (Decision 2) · Q7(b) · 2 marks
Given that Z is the play‑safe option for player B, (b) determine the range of possible values of k. You must make your working clear. (2)
31. 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)
32. June 2022 · Paper 4D (Decision 2) · Q7(d) · 7 marks
Player A intends to make a random choice between options Q, R and S, choosing option Q with probability p1, option R with probability p2 and option S with probability p3 Player A wants to find the optimal values of p1, p2 and p3 using the Simplex algorithm. Given that k > –4, player A formulates the following objective function for the corresponding linear program. Maximise P = V, where V = the value of the original game + 4 (d) (i) Formulate the constraints of the linear programming problem for player A. You should write the constraints as equations. (ii) Write down an initial Simplex tableau, making your variables clear. (7)
33. June 2022 · Paper 4D (Decision 2) · Q7(e) · 4 marks
The Simplex algorithm is used to solve the linear programming problem. It is given that in the final Simplex tableau the optimal value of p1 = 7 37 , the optimal value of p2 = 17 and all the slack variables are zero. (e) Determine the value of k, making your method clear. (4)
34. Nov 2021 · Paper 4D (Decision 2) · Q7(a) · 2 marks
7. Alexis and Becky are playing a zero‑sum game. Alexis has two options, Q and R. Becky has three options, X, Y and Z. Alexis intends to make a random choice between options Q and R, choosing option Q with probability p1 and option R with probability p2 Alexis wants to find the optimal values of p1 and p2 and formulates the following linear programme, writing the constraints as inequalities. Maximise P = V where V = 3 + the value of the game to Alexis subject=to=$V 6p1 + p2 V 8p2 V 4p1 + 2p2 p1 + p2 1 p1 0 , p2 0 , V 0 (a) Complete the pay‑off matrix for Alexis in the answer book. (2)
35. Nov 2021 · Paper 4D (Decision 2) · Q7(b) · 6 marks
(b) Use a graphical method to find the best strategy for Alexis. (6)
36. Nov 2021 · Paper 4D (Decision 2) · Q7(c) · 1 marks
(c) Calculate the value of the game to Alexis. (1)
37. Nov 2021 · Paper 4D (Decision 2) · Q7(d) · 3 marks
Becky intends to make a random choice between options X, Y and Z, choosing option X with probability q1 , option Y with probability q2 and option Z with probability q3 (d) Determine the best strategy for Becky, making your method and working clear. (3)
38. Oct 2020 · AS Paper 2 (Decision 2) · Q3(a) · 2 marks
3. Two teams, A and B, each have three team members. One member of Team A will compete against one member of Team B for 10 rounds of a competition. None of the rounds can end in a draw. Table 1 shows, for each pairing, the expected number of rounds that the member of Team A will win minus the expected number of rounds that the member of Team B will win. These numbers are the scores awarded to Team A. This competition between Teams A and B is a zero‑sum game. Each team must choose one member to play. Each team wants to choose the member who will maximise its score. Team B Paul Qaasim Rashid Mischa –6 Team A Noel –2 Olive –6 Table 1 (a) (i) Find the number of rounds that Team A expects to win if Team A chooses Mischa and Team B chooses Paul. (ii) Find the number of rounds that Team B expects to win if Team A chooses Noel and Team B chooses Qaasim. (2)
39. Oct 2020 · AS Paper 2 (Decision 2) · Q3(b) · 4 marks
Table 1 models this zero-sum game. (b) (i) Find the play‑safe strategies for the game. (ii) Explain how you know that the game is not stable. (4)
40. Oct 2020 · AS Paper 2 (Decision 2) · Q3(c) · 1 marks
(c) Determine which team member Team B should choose if Team B thinks that Team A will play safe. Give a reason for your answer. (1)
41. Oct 2020 · AS Paper 2 (Decision 2) · Q3(d) · 7 marks
At the last minute, Rashid is ill and is therefore unavailable for selection by Team B. (d) Find the best strategy for Team B, defining any variables you use. (7)
42. 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)
43. Oct 2020 · Paper 4D (Decision 2) · Q6(b) · 3 marks
(b) Verify that there is no stable solution to the reduced game. (3)
44. Oct 2020 · Paper 4D (Decision 2) · Q6(c) · 1 marks
Player A intends to make a random choice between options Q, R and T, choosing option Q with probability p1, option R with probability p2 and option T with probability p3 Player A wants to find the optimal values of p1, p2 and p3 using the Simplex algorithm. Player A formulates the following linear programme, writing the constraints as inequalities. Maximise P = V, where V = the value of original game + 3 subject to V 4p1 + 7p2 + 6p3 V 8p1 + p3 V 6p1 + 4p2 + 3p3 p1 + p2 + p3 1 p1 0, p2 0, p3 0, V 0 (c) Explain why V cannot exceed any of the following expressions 4p1 + 7p2 + 6p3 8p1 + p3 6p1 + 4p2 + 3p3 (1)
45. Oct 2020 · Paper 4D (Decision 2) · Q6(d) · 1 marks
(d) Explain why it is necessary to use the constraint p1 + p2 + p3 1 (1)
46. Oct 2020 · Paper 4D (Decision 2) · Q6(e) · 3 marks
The Simplex algorithm is used to solve the linear programming problem. Given that the optimal value of p1 = 7 11 and the optimal value of p3 = 0 (e) calculate the value of the game to player A. (3)
47. Oct 2020 · Paper 4D (Decision 2) · Q6(f) · 4 marks
Player B intends to make a random choice between options X, Y and Z, choosing option X with probability q1, option Y with probability q2 and option Z with probability q3 (f) Determine the optimal strategy for player B, making your working clear. (4)
48. June 2019 · AS Paper 2 (Decision 2) · Q4(a) · 3 marks
4. The table below gives the pay-off matrix for a zero-sum game between two players, Aljaz and Brendan. The values in the table show the pay-offs for Aljaz. Brendan Option X Option Y Option Z Option P í6 í1 Aljaz Option Q í7 Option R (a) (i) Show that this game is stable. (ii) State the value of this game to Brendan. (3)
49. June 2019 · AS Paper 2 (Decision 2) · Q4(b) · 7 marks
Option R is removed from Aljaz’s choices and the reduced game, with option R removed, is no longer stable. (b) Find the best strategy for Aljaz in this reduced game, defining any variable you use. (7)
50. June 2019 · AS Paper 2 (Decision 2) · Q4(c) · 1 marks
(c) Explain why Brendan should never play option Y (1)
51. June 2019 · AS Paper 2 (Decision 2) · Q4(d) · 4 marks
Let Brendan play option X with probability q (d) (i) Explain why q satisfies the equation 6q í 2(1 í q) = 1.6 (ii) Hence find the best strategy for Brendan in this reduced game. (4)
52. June 2019 · Paper 4D (Decision 2) · Q4(a) · 2 marks
4. Player B Option X Option Y Option Z Option P –2 Player A Option Q –4 –2 Option R –1 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)
53. June 2019 · Paper 4D (Decision 2) · Q4(b) · 3 marks
Player A intends to make a random choice between options P, Q and R, choosing option P with probability p1, option Q with probability p2 and option R with probability p3 Player A wants to find the optimal values of p1 , p2 and p3 using the Simplex algorithm. Player A formulates the following linear programming problem for the game, writing the constraints as inequalities. Maximise P = V subject to V . 3p1 – 4p2 + p3 V . –2p1 + 4p2 + 2p3 V . –2p2 – p3 p1 + p2 + p3 - 1 p1 . 0, p2 . 0, p3 . 0, V . 0 (b) Correct the errors made by player A in the linear programming formulation of the game, giving reasons for your answer. (3)
54. June 2019 · Paper 4D (Decision 2) · Q4(c) · 3 marks
(c) Write down an initial Simplex tableau for the corrected linear programming problem. (3)
55. June 2019 · Paper 4D (Decision 2) · Q4(d) · 2 marks
The Simplex algorithm is used to solve the corrected linear programming problem. The optimal values are p1 = 0.6, p2 = 0 and p3= 0.4 (d) Calculate the value of the game to player A. (2)
56. June 2019 · Paper 4D (Decision 2) · Q4(e) · 4 marks
(e) Determine the optimal strategy for player B, making your reasoning clear. (4)
57. June 2018 · AS Paper 2 (Decision 2) · Q2(a) · 1 marks
2. (a) Explain what the term ‘zero-sum game’ means. (1)
58. June 2018 · AS Paper 2 (Decision 2) · Q2(b) · 1 marks
Two teams, A and B, are to face each other as part of a quiz. There will be several rounds to the quiz with 10 points available in each round. For each round, the two teams will each choose a team member and these two people will compete against each other until all 10 points have been awarded. The number of points that Team A can expect to gain in each round is shown in the table below. Team B Paul Qaasim Rashid Mischa Team A Noel Olive The teams are each trying to maximise their number of points. (b) State the number of points that Team B will expect to gain each round if Team A chooses Noel and Team B chooses Rashid. (1)
59. June 2018 · AS Paper 2 (Decision 2) · Q2(c) · 1 marks
(c) Explain why subtracting 5 from each value in the table will model this situation as a zero‑sum game. (1)
60. June 2018 · AS Paper 2 (Decision 2) · Q2(d)(i) · 4 marks
(d) (i) Find the play-safe strategies for the zero-sum game. (ii) Explain how you know that the game is not stable. (4)
61. June 2018 · AS Paper 2 (Decision 2) · Q2(e) · 6 marks
At the last minute, Olive becomes unavailable for selection by Team A. Team A decides to choose its player for each round so that the probability of choosing Mischa is p and the probability of choosing Noel is 1 - p. (e) Use a graphical method to find the optimal value of p for Team A and hence find the best strategy for Team A. (6)
62. June 2018 · AS Paper 2 (Decision 2) · Q2(f)(i) · 2 marks
For this value of p, (f) (i) find the expected number of points awarded, per round, to Team A, (ii) find the expected number of points awarded, per round, to Team B. (2)

Mark schemes

Each mark scheme shows the whole question; the parts on this topic are the ones listed above.

June 2025 · AS Paper 2 (Decision 2) · Q3
Mark scheme June 2025 Paper 2 (Decision 2) Q3(b)(ii)
June 2025 · Paper 4D (Decision 2) · Q6
Mark scheme June 2025 Paper 4D (Decision 2) Q6(d)
June 2024 · AS Paper 2 (Decision 2) · Q3
Mark scheme June 2024 Paper 2 (Decision 2) Q3(d)
June 2024 · Paper 4D (Decision 2) · Q7
Mark scheme June 2024 Paper 4D (Decision 2) Q7(d)
June 2023 · AS Paper 2 (Decision 2) · Q3
Mark scheme June 2023 Paper 2 (Decision 2) Q3(d)
June 2023 · Paper 4D (Decision 2) · Q8
Mark scheme June 2023 Paper 4D (Decision 2) Q8(d)
June 2022 · AS Paper 2 (Decision 2) · Q3
Mark scheme June 2022 Paper 2 (Decision 2) Q3(e)
June 2022 · Paper 4D (Decision 2) · Q7
Mark scheme June 2022 Paper 4D (Decision 2) Q7(e)
Nov 2021 · Paper 4D (Decision 2) · Q7
Mark scheme Nov 2021 Paper 4D (Decision 2) Q7(d)
Oct 2020 · AS Paper 2 (Decision 2) · Q3
Mark scheme Oct 2020 Paper 2 (Decision 2) Q3(d)
Oct 2020 · Paper 4D (Decision 2) · Q6
Mark scheme Oct 2020 Paper 4D (Decision 2) Q6(f)
June 2019 · AS Paper 2 (Decision 2) · Q4
Mark scheme June 2019 Paper 2 (Decision 2) Q4(d)
June 2019 · Paper 4D (Decision 2) · Q4
Mark scheme June 2019 Paper 4D (Decision 2) Q4(e)
June 2018 · AS Paper 2 (Decision 2) · Q2
Mark scheme June 2018 Paper 2 (Decision 2) Q2(f)(i)