Moving in sequence
1.[2p] Player 1 moves first with three actions, and after each of them player 2 chooses between two actions. How many strategies does player 2 have?
Player 1 moves first with three actions, and after each of them player 2 chooses between two actions. How many strategies does player 2 have?
2.[3p] Why must a strategy specify an action at nodes that will never be reached?
Why must a strategy specify an action at nodes that will never be reached?
3.[2p] Put the steps of backward induction in order.
Put the steps of backward induction in order.
Find a decision node whose branches all lead to terminal nodes
Settle what the player there would choose by comparing payoffs
Repeat on the shortened tree until the first node is reached
Replace that node with the payoffs its choice produces
Show the answer
a, b, c, d
4.[2p] Kuhn's 1953 theorem says that every finite game of perfect information
Kuhn's 1953 theorem says that every finite game of perfect information
5.[3p] Demand is with unit cost £40, and firm 1 chooses its quantity first. What quantity does the leader produce?
Demand is with unit cost £40, and firm 1 chooses its quantity first. What quantity does the leader produce?
6.[3p] In that Stackelberg equilibrium, what is the leader's profit in pounds?
In that Stackelberg equilibrium, what is the leader's profit in pounds?
7.[3p] Comparing the Stackelberg outcome with the simultaneous Cournot outcome in that market, which are true?
Comparing the Stackelberg outcome with the simultaneous Cournot outcome in that market, which are true?
Select all that apply
8.[2p] Moving first is an advantage in every game where one player can commit before the other.
Moving first is an advantage in every game where one player can commit before the other.
9.[2p] In the centipede game, backward induction predicts that
In the centipede game, backward induction predicts that