【正文】
y Buying and caring each goat cost and value to a farmer of grazing each goat is . nthiig1 ... nG g g? ? ?c()vGCont’d A maximum number of goats : , for but for Also The villagers’ problem is simultaneously choosing how many goats to own (to choose ). m a x : ( ) 0G v G ?m a xGG? ( ) 0vG ? m a xGG?39。 , ..., }nnG S S u u?**1( , ..., )nss*is* * * * * * * * *1 1 1 1 1 1( , . . . , , , , . . . , ) ( , . . . , , , , . . . , )i i i n i i i i ns s s s s u s s s s s? ? ? ??Cont’d Proposition B In the player normal form game if the strategies are a NE, then they survive iterated elimination of strictly dominated strategies. 11{ , . . . , 。Game Theory (Microeconomic Theory (IV)) Instructor: Yongqin Wang Email: School of Economics, Fudan University December, 2020 Main Reference: Robert Gibbons,1992: Game Theory for Applied Economists, Princeton University Press Fudenberg and Tirole,1991: Game Theory, MIT Press Game of Complete Information ? Further Discussion on Nash Equilibrium (NE) ? NE versus Iterated Elimination of Strict Dominance Strategies Proposition A In the player normal form game if iterated elimination of strictly dominated strategies eliminates all but the strategies , then these strategies are the unique NE of the game. 11{ , . . . , 。 , . . . , }nnG S S u u?n**1( , ..., )nssA Formal Definition of NE ? In the nplayer normal form the strategies are a NE, if for each player i, is (at least tied for) player i’s best response to the strategies specified for the n1 other players, 11{ , ..., 。 , . . . , }nnG S S u u?**1( , ..., )nssn Existence of NE Theorem (Nash, 1950): In the player no