Lecture 7: Zero-Sum Games
MIT OpenCourseWare · 80:39
This lecture defines finite two-player zero-sum games, develops security (maxmin/minmax) strategies, and proves von Neumann’s 1928 minimax theorem: the payoff player 1 can guarantee equals the loss player 2 can hold t...