• 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
–
Approximation Algorithms for Stochastic Optimization I
Kamesh Munagala (Duke University)
–
Break
–
Approximation Algorithms for Stochastic Optimization II
Kamesh Munagala (Duke University)
–
Lunch
–
Sequential Decision Making: Prophets and Secretaries I
Matt Weinberg (Princeton University)
–
Break
–
Sequential Decision Making: Prophets and Secretaries II
Matt Weinberg (Princeton University)
–
Coffee and Check-In
–
Competitive Analysis of Online Algorithms I
Seffi Naor (Technion Israel Institute of Technology)
–
Break
–
Competitive Analysis of Online Algorithms II
Seffi Naor (Technion Israel Institute of Technology)
–
Lunch
–
Online Scheduling Meets Queueing I
Nikhil Bansal (University of Michigan), Adam Wierman (California Institute of Technology)
–
Break
–
Online Scheduling Meets Queueing II
Nikhil Bansal (University of Michigan), Adam Wierman (California Institute of Technology)
–
Break
–
Lightning Talks
–
Coffee and Check-In
–
Sample Complexity and Uniform Convergence I
Eli Upfal (Brown University)
–
Break
–
Sample Complexity and Uniform Convergence II
Eli Upfal (Brown University)
–
Break
–
Online Learning and Online Convex Optimization I
Nicolò Cesa-Bianchi (University of Milan)
–
Lunch
–
Online Learning and Online Convex Optimization II
Nicolò Cesa-Bianchi (University of Milan)
–
Break
–
Reinforcement Learning and Markov Decision Processes I
Yishay Mansour (Tel Aviv University)
–
Break
–
Reinforcement Learning and Markov Decision Processes II
Yishay Mansour (Tel Aviv University)
–
Coffee and Check-In
–
Beyond Worst-Case Analysis I
Tim Roughgarden (Stanford University)
–
Break
–
Beyond Worst-Case Analysis II
Tim Roughgarden (Stanford University)
–
Lunch
–
Understanding the Empirical Hardness of NP-Complete Problems I
Kevin Leyton-Brown (University of British Columbia)
–
Break
–
Understanding the Empirical Hardness of NP-Complete Problems II
Kevin Leyton-Brown (University of British Columbia)
–
Break
–
Lightning Talks
–
Coffee and Check-In
–
Uncertainty in Algorithmic Mechanism Design
Anna Karlin (University of Washington)
–
Break
–
Energy and Uncertainty I
Eilyan Bitar (Cornell University), Adam Wierman (California Institute of Technology)
–
Lunch
–
Energy and Uncertainty II
Eilyan Bitar (Cornell University), Adam Wierman (California Institute of Technology)
–
Break
–
Lightning Talks