Lesson DF1-DF4
DF1-DF4 Pay-off matrices, play-safe strategies and dominance Quiz: AQA Further Maths, Unit 5
20 questions
In partnership with Revision Ninja
Lesson DF1-DF4, Pay-off matrices, play-safe strategies and dominance: 20 multiple choice questions for the AQA Further Maths (7367), Unit 5: Optional application 3: discrete mathematics, written with Revision Ninja.
Host it live on the board and students join with a game code on their own devices, or revise alone with Free Play. The answers are revealed in the game.
The 20 questions
-
What does a pay-off matrix record in a zero-sum game?
- Combined game profits
- Column player gains
- Row player gains
- Total player losses
-
In a zero-sum game, what is the sum of all players' pay-offs?
- Zero
- One
- Maximum row value
- Matrix dimension
-
Which value does a play-safe strategy for the row player maximise?
- Minimum column payoff
- Average row payoff
- Minimum row payoff
- Maximum row payoff
-
What does the value of a zero-sum game represent with optimal play?
- Guaranteed row payoff
- Saddle point sum
- Maximum column loss
- Zero net utility
-
A zero-sum game has pay-off matrix (gains to the row player A) with rows A1: 2 4 1; A2: 3 5 4; A3: 1 3 0, and columns B1, B2, B3. What is the value of this game?
- 4
- 2
- 5
- 3
-
What is the saddle point value for a game with matrix rows A1(2,4,1), A2(3,5,4), A3(1,3,0)?
- 4
- 1
- 5
- 3
-
For matrix rows A1(2,4,1), A2(3,5,4), A3(1,3,0), which is the play-safe row?
- Row A1
- Row B1
- Row A3
- Row A2
-
A zero-sum game has pay-off matrix (gains to the row player A) with rows A1: 3 -1; A2: -2 4, and columns B1, B2. What is the play-safe value for the row player, using the maximin method?
- 4
- 1
- 3
- -1
-
Does a zero-sum game with rows A1(3,-1) and A2(-2,4) have a stable solution in pure strategies?
- Undefined
- Yes
- No
- Infinitely many
-
A zero-sum game has pay-off matrix (gains to the row player A) with rows A1: 3 -1; A2: -2 4, and columns B1, B2. In an optimal mixed strategy, what probability does the row player assign to A1?
- 0.4
- 0.6
- 0.3
- 0.5
-
A zero-sum game has pay-off matrix (gains to the row player A) with rows A1: 3 -1; A2: -2 4, and columns B1, B2. What is the value of this game when both players use optimal mixed strategies?
- 2
- 0
- -1
- 1
-
For matrix rows A1(2,3,1) and A2(1,2,0), which row dominates the other?
- A1 dominates A2
- Both rows dominate
- A2 dominates A1
- Neither row dominates
-
For row A1(2,3,1) with columns B1, B2, B3, which column should player B choose?
- Column B2
- Column B1
- Row A1
- Column B3
-
What properties must the value of a saddle point satisfy in a pay-off matrix?
- Row min, column min
- Row max, column min
- Row max, column max
- Row min, column max
-
What can be done with a dominated row in a pay-off matrix?
- It must be doubled
- It becomes the value
- It defines pure strategy
- It can be deleted
-
For matrix rows A1(2,4,1), A2(3,5,4), A3(1,3,0), which rows are dominated?
- A1 only
- A3 only
- A1 and A3
- A2 only
-
For any pay-off matrix in a two-person zero-sum game, which inequality always holds between the maximin and minimax values?
- Maximin ≥ minimax
- Maximin + minimax = 0
- Maximin = minimax always
- Maximin ≤ minimax
-
If only row A2(3,5,4) remains, which column B1, B2, or B3 will player B choose?
- Column B1
- Row A2
- Column B2
- Column B3
-
In a zero-sum game with a saddle point, how do maximin and minimax relate?
- Minimax is larger
- They are equal
- They are unrelated
- Maximin is larger
-
When should a player use a mixed strategy in a zero-sum game?
- Saddle point exists
- Positive payoffs only
- No saddle point
- Strictly dominant row
Related quizzes
- Graph language, Eulerian graphs and Euler's formula Quiz · DA1-DA3 · 20 questions
- Planarity, complete and bipartite graphs Quiz · DA4-DA5 · 20 questions
- Trees and isomorphism of graphs Quiz · DA6-DA7 · 20 questions
- Network language, spanning trees and route inspection Quiz · DB1-DB3 · 20 questions
- Travelling salesperson bounds and refining network models Quiz · DB4-DB5 · 20 questions
- Flows, cuts and the maximum flow-minimum cut theorem Quiz · DC1-DC3 · 20 questions
- Supersources, augmenting flows and capacities Quiz · DC4-DC7 · 20 questions
- Formulating and solving linear programmes graphically Quiz · DD1-DD2 · 20 questions
- The Simplex algorithm Quiz · DD3-DD4 · 20 questions
- Activity networks and critical paths Quiz · DE1-DE3 · 20 questions