COMPSCI 240 Lecture 17: COMPSCI240 Lecture 17
4 Dec 2018
School
Department
Course
Professor
Document Summary
Ii pure strategy e players choose a strategy to select a single action and play it forever: mix strategy. E players randomize over the set of available actions according to some probability distribution - a player mixes between different actions : example = Alice picks a tf h 23 and bob picks b ell. Bob $ cat b) if it at b is even at b is odd payotmatrixlbtinger2bling. li. Move , zero-sum game consists of a set of action. Ai for player di and ai for player pj where each strategy profile at ai x aj where its pay off function un at t. Suppose bob randomizes his action by playing l. Alice does not have to prefer one action over the other . When bob "s strategy makes the payoff of alice equal i. Uh ice can then choose a strategy to make bob "s action to have the equal pay of >
