12:00pm

Lunch

1:20pm

Welcome Remarks

1:30pm

Allan Borodin

Simple Algorithms for Sequential k-Independent Graphs

2:30pm

Katrina Ligett

Differentially Private Approximation Algorithms

3:30pm

Coffee Break

4:00pm

Mark Braverman

Poly-logarithmic Independence Fools AC₀ Circuits

5:00pm

Yevgeniy Vahlis
Graduate Student Hour

Leakage Resilient Computation

5:15pm

Yogeshwer Sharma
Graduate Student Hour

Characterizing Truthful Multi-Armed Bandit Mechanisms

5:30pm

Yi Wu
Graduate Student Hour

Agnostic Learning of Monomials by Halfspaces is Hard

5:45pm

Georgios Piliouras
Graduate Student Hour

No Regret Learning in Oligopolies: Cournot vs Bertrand

6:00pm

Dinner

Attendees on their own

8:00am

Breakfast

9:00am

Dexter Kozen

Optimal Coin Flipping

10:00am

Coffee Break

10:30am

Adam Smith

Integrating Differential Privacy with Statistical Theory

11:30am

Nick Harvey

Approximating Submodular Functions Everywhere

12:30pm

Lunch

2:00pm

Workshop Over