7.1. a. The first-price sealed-bid auction has a Nash equilibrium bidding strategy of: bid = true value.
2.1. a. The payoff matrix is:
4.2. a. The payoff matrix is:
b. The subgame perfect Nash equilibrium is (Enter, Accommodate). Games Of Strategy 5th Edition Solutions Pdf
3.1. a. The game tree is:
| | Left | Right | | --- | --- | --- | | Up | 2, 2 | 0, 3 | | Down | 3, 0 | 1, 1 |
5.2. a. The payoff matrix is:
7.2. a. The all-pay auction has a Nash equilibrium bidding strategy of: bid = true value.
6.2. a. The payoff matrix is:
4.1. a. The payoff matrix is:
2.2. a. The payoff matrix is:
c. The Nash equilibrium is (Down, Right).
| | Cooperate | Defect | | --- | --- | --- | | Cooperate | 3, 3 | 0, 4 | | Defect | 4, 0 | 1, 1 | 4 | | Defect | 4
1.1. a. The best outcome for both players is (A, A), which gives a payoff of 3 to each player.