Offered by Thomas Kesselheim

In this seminar, we cover topics in the area of online algorithms and optimization under uncertainty. That is, algorithms have to make decisions under incomplete information.

If you are interested in the seminar, please contact Thomas Kesselheim by April 7.

It is also possible (but not necessary) to combine this seminar with the lab.

• Online Stochastic Matching: Beating 1-1/e, Jon Feldman, Aranyak Mehta, Vahab Mirrokni, S. Muthukrishnan, FOCS 2009
• Randomized Primal-Dual Analysis of RANKING for Online Bipartite Matching, Nikhil R. Devanur, Kamal Jain, Robert D. Kleinberg, SODA 2013
• Combinatorial Auctions via Posted Prices, Michal Feldman, Nick Gravin, Brendan Lucier, SODA 2015
• Polylogarithmic Bounds on the Competitiveness of Min-cost Perfect Matching with Delays, Yossi Azar, Ashish Chiplunkar, Haim Kaplan, SODA 2017
• Online service with delay, Yossi Azar, Arun Ganesh, Rong Ge, Debmalya Panigrahi, STOC 2017
• …