Unformatted text preview: represented by the following payoff matrix. Let S = Stubborn and C = Chicken. Assume x > 0 . C S C 1, 1 0, 1+x S 1+x, 0 -1, -1 Find all the one-shot Nash equilibria. 4. Repeated Chicken . Consider the play of the above chicken game twice (assuming the drivers recover from any wreak in the previous play). Use the simple sum of period payoffs. (a) Draw the game tree. (b) Derive the normal form payoffs for at least two strategy profiles. (c) Consider the following strategy. Choose C in the first period. If both players choose the same action (C or S) in the first period, then choose C in the second period with probability 1/(1+x). But if different actions were chosen in the first period, then in the second period choose whatever action you did not choose in the first period (thereby punishing the player who was stubborn). For what values of x is it a subgame perfect Nash equilibrium for both players to use this strategy?...
View Full Document
- Spring '11
- Game Theory, $200, $100, $1000, discounted present value