Winter 2013 Schedule

Computing approximate pure Nash equilibria in congestion games
Ioannis Caragiannis   January 14th   4pm   Burnside 1205   abstract
The Erdos-Hajnal Conjecture
Kryzyzstof Choromanski   January 21st   4pm   Burnside 1205   abstract
Game Theory and Computational Complexity (SOCS Colloquium)
Costis Daskalakis   February 15th   2:30   MC 103   abstract
Algorithms for Optimization over Noisy Data
Claire Mathieu   March 12th   4:00   Burnside 1205   abstract
Computation of Least Fixed Points (SOCS Colloquium)
Mihalis Yannakakis   March 15th   3:30   MC 103   abstract
Convex Sets, Conic Matrix Factorizations and Rank Lower Bounds
Pablo Parrilo   March 18th   4pm   Burnside 1205   abstract
Irreducible triangulations of surfaces and an application in extremal graph theory
David Wood   March 25th   4pm   Burnside 1205   abstract
DMO Homepage