• Click on the titles of individual talks for abstract, slides and archived video.

Please note that this schedule is subject to change. All events take place in the Calvin Lab Auditorium.

–
Coffee and Check-In
–
Opening Remarks
–
Introducing Decision-Making Under Uncertainty to Medical Research: Designing More Efficient and More Accurate Clinical Trials
Don Berry, University of Texas MD Anderson Cancer Center
–
Break
–
Optimal A-B Testing
Vivek Farias, Massachusetts Institute of Technology
–
Stable Marriages in Metric Spaces
Balaji Prabhakar, Stanford University
–
Lunch
–
The Simplex and Policy-Iteration Methods are Strongly Polynomial for the Markov Decision Problem with Fixed Discount Factors
Yinyu Ye, Stanford University
–
Break
–
Interpolating Between Stochastic and Worst-case Optimization
R. Ravi, Carnegie Mellon University
–
Smarter Tools for (Citi)Bike-Sharing
David Shmoys, Cornell University
–
Reception
–
Coffee and Check-In
–
How to Predict When Estimation is Hard: Algorithms for Learning on Graphs
Sasha Rakhlin, University of Pennsylvania
–
Break
–
From Predictions to Decisions: Limitations and Possibilities of Optimization from Samples
Yaron Singer, Harvard University
–
Distributed Partial Clustering
Sudipto Guha, University of Pennsylvania 
–
Lunch
–
Online Vector Packing
Yossi Azar, Tel Aviv University
–
Break
–
Clustering Using Pairwise Comparisons
R. Srikant, University of Illinois at Urbana-Champaign 
–
Online Algorithms for Covering and Packing Problems with Convex Objectives
Niv Buchbinder, Tel Aviv University
–
Coffee and Check-In
–
Kernel-Based Methods for Bandit Convex Optimization
Sebastien Bubeck, Microsoft Research
–
Break
–
Always Valid Inference: Continuous Monitoring of A/B Tests
Ramesh Johari, Stanford University
–
Revisiting the Exploration-Exploitation Trade-Off in Bandit Models
Emilie, Kaufmann, CNRS, Université Lille
–
Lunch
–
Distribution-Free Models of Social and Information Networks
Tim Roughgarden (Stanford University)
–
Break
–
Learning in Games with Best-Response Oracles
Tomer Koren, Google Research
–
Online Optimization and Learning Under Long-Term Convex Constraints and Objectives
Nikhil Devanur, Microsoft Research 
–
Coffee and Check-In
–
Avoiding Cascading Failures for Time-of-Use Pricing
Anna Karlin, University of Washington
–
Simple Pricing Schemes for Consumers with Evolving Values
Shuchi Chawla, University of Wisconsin-Madison
–
Break
–
Procrastination with Variable Present Bias
Nicole Immorlica, Microsoft
–
A Unified Duality Theory for Bayesian Mechanism Design
Matt Weinberg, Princeton University 
–
Lunch
–
Bandits and Agents: How to Incentivize Exploration?
Aleksandrs Slivkins, Microsoft Research
–
Online Ad Allocation: Robust Optimization for Repeated Auctions
Vahab Mirrokni, Google
–
Break
–
Coffee and Check-In
–
Competitive Algorithms from Competitive Equilibria
Kamesh Munagala, Duke University
–
Online Flow-Time Optimization
Janardhan Kulkarni, Microsoft Research Redmond
–
Break
–
Online Algorithms with Recourse
Amit Kumar, IIT Delhi
–
Scheduling with Uncertain Processing Times
Marc Uetz, University of Twente
–
Lunch
–
Secretary Problems and Online Selection with A Priori Information
Ola Svensson, École Polytechnique Fédérale de Lausanne
–
Break
–
Optimal Online Algorithms via Linear Scaling
Thomas Kesselheim, Max Planck Institute for Informatics and Saarland University