【正文】
1, s2, ... si 1, si , si+ 1, ..., sn) fo r all s1? S1, s2? S2, . . ., si 1? Si 1, si+ 1? Si + 1, ..., sn? Sn. Definition: weakly dominated strategy 1 , 1 2 , 0 0 , 2 2 , 2 Player 1 Player 2 R U B L regardless of other players’ choices si” is at least as good as si’ May 20, 2021 73347 Game TheoryLecture 2 11 Strictly and weakly dominated strategy ? A rational player never chooses a strictly dominated strategy. Hence, any strictly dominated strategy can be eliminated. ? A rational player may choose a weakly dominated strategy. May 20, 2021 73347 Game TheoryLecture 2 12 Iterated elimination of strictly dominated strategies ? If a strategy is strictly dominated, eliminate it ? The size and plexity of the game is reduced ? Eliminate any strictly dominated strategies from the reduced game ? Continue doing so successively May 20, 2021 73347 Game TheoryLecture 2 13 Iterated elimination of strictly dominated strategies: an example 1 , 0 1 , 2 0 , 1 0 , 3 0 , 1 2 , 0 Player 1 Player 2 Middle Up Down Left 1 , 0 1 , 2 0 , 3 0 , 1 Player 1 Player 2 Middle Up Down Left Right May 20, 2021 73347 Game TheoryLecture 2 14 Example: Tourists amp。 , si ? Si b e feas ib le strategies fo r p la y er i . Strateg y si39。 is strictly do mi na ted by strat egy si if ui( s1, s2, ... si 1, si39。May 20, 2021 73347 Game TheoryLecture 2 1 Static (or SimultaneousMove) Games of Complete Information Dominated Strategies Nash Equilibrium May 20, 2021 73347 Game TheoryLecture 2 2 Outline of Static Games of Complete Information ? Introduction to games ? Normalform (or strategicform) representation ? Iterated elimination of strictly dominated strategies