Theory Lunch

TIME:: Wednesday, Oct. 10, noon till 1pm

PLACE:: 7220 Wean Hall

TITLE::  Learning in Games

SPEAKER::  Martin Zinkevich


In this talk, I will talk about learning in Repeated Bimatrix Games. I will
discuss various solution concepts, such as Nash Equilibria, Correlated
Equilibria, and Bayes Envelope, and the relationships between them, as well
as regret minimization and Hannan Consistency. I will introduce some of the
tools used in this area, like Blackwell's Approachability Theorem, as well
as some algorithms for achieving these solution concepts developed by Mannor
and Shimkin and Hart and Mas-Colell. If there is time, I will go into
stochastic games.