Lecture 14: Zero-Sum Games
MIT OpenCourseWare · 74:17
Two-player zero-sum games are fully described by one payoff matrix \(C\): Alice (row) chooses among \(M\) strategies, Bob (column) among \(N\), and \(C{ij}\) is the net payment from Bob to Alice. Von Neumann’s minimax...