 | Chapter 8 True/False Quiz | | Chapter 9 Summary |
| Chapter 10 True/False Quiz | | Return to Quiz Index | | Return to Main Page |
Game Theory
|
| Chapter 8 True/False Quiz | | Chapter 9 Summary |
| Chapter 10 True/False Quiz | | Return to Quiz Index | | Return to Main Page |
1. A negative payoff indicates a loss to the row player.
True 
False
2. The row [
1 1 2] dominates the row [1 0 0]. True False
3. The column [1 2 3]T dominates the column [1 1 0]T. True False
4. If the payoff matrix of a game reduces to a 1 x 1 matrix, then the row and column that are left give each player's optimal pure strategy. True False
5. If a game has no saddle points, it may still be possible to reduce the game to a 1 x 1 game using dominance. True False
6. Some strictly determined games do not have saddle points. True False
7. The game
| 1 | 3 | |
| 4 |
is not strictly determined. True False
8. The game
| 1 | 2 | 3 |
| 2 | 3 | 1 |
| 3 | 2 | 1 |
is not strictly determined. True False
9. In a strictly determined game, the row and column corresponding to optimal pure strategies always intersect in a saddle point. True False
10. When analyzing a game, it pays to first check for saddle points. True False
11. Different saddle points in the same payoff matrix may have different payoffs. True False
12. If a game is not strictly determined, there is a mixed strategy for the row player that is better for the row player than any pure strategy. True False
13. For every mixed row strategy, there is a pure strategy for the column player that maximizes his or her outcome. True False
14. If you fail to use an optimal strategy, then there is a counter strategy your opponent can use that is worse for you than anything he or she might do if you use an optimal strategy. True False
15. It is necessary to first reduce a game by dominance when solving it by the simplex method. True False
16. If you use the simplex method to solve a strictly determined game, then the value of the game may differ from the value of a saddle point. True False
17. If both players' optimal mixed strategies for a game happen to be pure strategies, then the game is strictly determined. True False
18. If a game is strictly determined, it may still be necessary to use the simplex method to solve it. True False
19. Every game can be solved by the simplex method. True False
20. If you know your opponent's strategy, it is still always best to use your optimal mixed strategy. True False