STAT 155 Lecture Notes - Lecture 6: Saddle Point, Xz
Document Summary
Zero sum aij ) game player hnaasg strategy i i. z. , 2 , n } and mixed strategies. I would be fei } ; in ei co , o , Minimax thin : m miynxtay = my maxx may = v y # attain the above is safety strategy x" ay mmsingxaaiti saddle is a z , a it ( Ait if then ci-k. jo ) claim : point optimal strategies. * smxaxmiyn x" ay suffices show to ei . , ej * are min across rows max across columns my maxx. C vt y i y : on y . on ) V min eyi ei minimax id c thin we min ai # j have play i plays given the aioj @ = maxx miyn xtay= miynm xtay = aiojo. 2 , n domination each player picks a number between. If play i picks i i j payoff - If obs . suffices we have to drool re.
