Cs-352 Theoretical Computer Science
88 Citations•2013•
Siddhartha Brahma, Milan Korda
journal unavailable
Two fundamental theorems in this regard are proved: the MinMax theorem and the Nash’s (Existence) theorem.
Abstract
Today we continue with the topic of the previous lecture – game theory. Last time we introduced a notion of Nash equilibrium and showed that all the examples of games we considered posses them. This begs to wonder: was it a coincidence or maybe every game has a Nash equilibrium? Answering this question is the main topic of this lecture. In particular, we prove two fundamental theorems in this regard: the MinMax theorem and the Nash’s (Existence) theorem.