This preview shows page 1. Sign up to view the full content.
Unformatted text preview: o Full and partial mixing o In a Nash equilibrium, any pure strategies that a player uses with positive probability must have the same expected payoff, and any pure strategy that a player uses with zero probability must have a lower expected payoff than any pure strategy that player uses with positive probability Complicated examples War of attrition: drawing utilities in order to figure out the best responses Expert advice: writing a sequential game in strategic form in order to find Nash equilibria (pure and mixed) Cheap talk: Multiple subgame-perfect Nash equilibria in a game with both sequential and simultaneous moves...
View Full Document
This note was uploaded on 04/14/2010 for the course ECON 398 taught by Professor Emre during the Spring '07 term at University of Michigan.
- Spring '07