Workshops

Fall 2016

Optimization and Decision-Making Under Uncertainty

Sep 19, 2016 to Sep 23, 2016

Return to event »

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.

Monday, September 19th, 2016
9:00 am–9:20 am		Coffee and Check-In
9:20 am–9:30 am		Opening Remarks
9:30 am–10:20 am		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
10:20 am–10:50 am		Break
10:50 am–11:40 am		Optimal A-B Testing Vivek Farias, Massachusetts Institute of Technology
11:40 am–12:10 pm		Stable Marriages in Metric Spaces Balaji Prabhakar, Stanford University
12:10 pm–2:10 pm		Lunch
2:10 pm–3:00 pm		The Simplex and Policy-Iteration Methods are Strongly Polynomial for the Markov Decision Problem with Fixed Discount Factors Yinyu Ye, Stanford University
3:00 pm–3:30 pm		Break
3:30 pm–4:00 pm		Interpolating Between Stochastic and Worst-case Optimization R. Ravi, Carnegie Mellon University
4:00 pm–4:30 pm		Smarter Tools for (Citi)Bike-Sharing David Shmoys, Cornell University
4:30 pm–5:30 pm		Reception

Tuesday, September 20th, 2016
9:00 am–9:30 am		Coffee and Check-In
9:30 am–10:20 am		How to Predict When Estimation is Hard: Algorithms for Learning on Graphs Sasha Rakhlin, University of Pennsylvania
10:20 am–10:50 am		Break
10:50 am–11:40 am		From Predictions to Decisions: Limitations and Possibilities of Optimization from Samples Yaron Singer, Harvard University
11:40 am–12:10 pm		Distributed Partial Clustering Sudipto Guha, University of Pennsylvania
12:10 pm–2:10 pm		Lunch
2:10 pm–3:00 pm		Online Vector Packing Yossi Azar, Tel Aviv University
3:00 pm–3:30 pm		Break
3:30 pm–4:00 pm		Clustering Using Pairwise Comparisons R. Srikant, University of Illinois at Urbana-Champaign
4:00 pm–4:30 pm		Online Algorithms for Covering and Packing Problems with Convex Objectives Niv Buchbinder, Tel Aviv University

Wednesday, September 21st, 2016
9:00 am–9:30 am		Coffee and Check-In
9:30 am–10:20 am		Kernel-Based Methods for Bandit Convex Optimization Sebastien Bubeck, Microsoft Research
10:20 am–10:50 am		Break
10:50 am–11:40 am		Always Valid Inference: Continuous Monitoring of A/B Tests Ramesh Johari, Stanford University
11:40 am–12:10 pm		Revisiting the Exploration-Exploitation Trade-Off in Bandit Models Emilie Kaufmann, CNRS, Université Lille
12:10 pm–2:10 pm		Lunch
2:10 pm–3:00 pm		Distribution-Free Models of Social and Information Networks Tim Roughgarden, Stanford University
3:00 pm–3:30 pm		Break
3:30 pm–4:00 pm		Learning in Games with Best-Response Oracles Tomer Koren, Google Research
4:00 pm–4:30 pm		Online Optimization and Learning Under Long-Term Convex Constraints and Objectives Nikhil Devanur, Microsoft Research

Thursday, September 22nd, 2016
9:00 am–9:30 am		Coffee and Check-In
9:30 am–10:00 am		Avoiding Cascading Failures for Time-of-Use Pricing Anna Karlin, University of Washington
10:00 am–10:30 am		Simple Pricing Schemes for Consumers with Evolving Values Shuchi Chawla, University of Wisconsin-Madison
10:30 am–11:00 am		Break
11:00 am–11:30 am		Procrastination with Variable Present Bias Nicole Immorlica, Microsoft
11:30 am–12:00 pm		A Unified Duality Theory for Bayesian Mechanism Design Matt Weinberg, Princeton University
12:00 pm–2:00 pm		Lunch
2:00 pm–2:30 pm		Bandits and Agents: How to Incentivize Exploration? Aleksandrs Slivkins, Microsoft Research
2:30 pm–3:00 pm		Online Ad Allocation: Robust Optimization for Repeated Auctions Vahab Mirrokni, Google
3:00 pm–3:30 pm		Break

Friday, September 23rd, 2016
9:00 am–9:30 am		Coffee and Check-In
9:30 am–10:20 am		Competitive Algorithms from Competitive Equilibria Kamesh Munagala, Duke University
10:20 am–10:50 am		Online Flow-Time Optimization Janardhan Kulkarni, Microsoft Research Redmond
10:50 am–11:20 am		Break
11:20 am–11:50 am		Online Algorithms with Recourse Amit Kumar, IIT Delhi
11:50 am–12:20 pm		Scheduling with Uncertain Processing Times Marc Uetz, University of Twente
12:20 pm–2:40 pm		Lunch
2:40 pm–3:30 pm		Secretary Problems and Online Selection with A Priori Information Ola Svensson, École Polytechnique Fédérale de Lausanne
3:30 pm–4:00 pm		Break
4:00 pm–4:30 pm		Optimal Online Algorithms via Linear Scaling Thomas Kesselheim, Max Planck Institute for Informatics and Saarland University