博弈论第三讲 SPE 复旦大学 王永钦.pptVIP

Spring,2007, Fudan June 4, 2003 Lecture 12 Dynamic Games of Complete Information Yongqin Wang, CCES, Fudan Fall, 2007 Outline of dynamic games of complete information Dynamic games of complete information Extensive-form representation Dynamic games of complete and perfect information Game tree Subgame-perfect Nash equilibrium Backward induction Applications Dynamic games of complete and imperfect information More applications Repeated games Entry game An incumbent monopolist faces the possibility of entry by a challenger. The challenger may choose to enter or stay out. If the challenger enters, the incumbent can choose either to accommodate or to fight. The payoffs are common knowledge. Sequential-move matching pennies Each of the two players has a penny. Player 1 first chooses whether to show the Head or the Tail. After observing player 1’s choice, player 2 chooses to show Head or Tail Both players know the following rules: If two pennies match (both heads or both tails) then player 2 wins player 1’s penny. Otherwise, player 1 wins player 2’s penny. Dynamic (or sequential-move) games of complete information A set of players Who moves when and what action choices are available? What do players know when they move? Players’ payoffs are determined by their choices. All these are common knowledge among the players. Definition: extensive-form representation The extensive-form representation of a game specifies: the players in the game when each player has the move what each player can do at each of his or her opportunities to move what each player knows at each of his or her opportunities to move the payoff received by each player for each combination of moves that could be chosen by the players Dynamic games of complete and perfect information Perfect information All previous moves are observed before the next move is chosen. A player knows Who has moved What before she makes a decision Game tree A game tree has a set of nodes and a set of edges such that ea