6.853 Topics in Algorithmic Game Theory
September 20, 2011
Lecture 4
Lecturer: Constantinos Daskalakis
Scribe: Constantinos Daskalakis
We have seen that Nash equilibria in two-player zero-sum games (and generalizations thereof) are
polynomial-time tractab
6.853 Topics in Algorithmic Game Theory
September 22, 2011
Lecture 5
Lecturer: Constantinos Daskalakis
Scribe: Constantinos Daskalakis
We continue our discussion from last lecture, looking at the performance of Multiplicative-WeightsUpdates. We then see h
6.853 Topics in Algorithmic Game Theory
September 15, 2011
Lecture 3
Lecturer: Constantinos Daskalakis
Scribe: Constantinos Daskalakis
In the previous lecture we saw that there always exists a Nash equilibrium in two-player zero-sum
games. Moreover, the e
6.853 Topics in Algorithmic Game Theory
September 13, 2011
Lecture 2
Lecturer: Constantinos Daskalakis
Scribe: Constantinos Daskalakis
In this lecture, we focus on two-player zero-sum games. Our goal is to show that linear programming
(LP) duality implies
6.853 Topics in Algorithmic Game Theory
November 3, 2011
Lecture 16
Lecturer: Constantinos Daskalakis
Scribe: Warut Suksompong
NOTE: The content of these notes has not been formally reviewed by the
lecturer. It is recommended that they are read critically