All talks listed in Pacific Time. Schedule subject to change.

–
Coffee and Check-in
–
Opening Remarks
–
Robust Identification and Estimation in Repeated Games

Niccolò Lomys (CSEF and Università degli Studi di Napoli Federico II)
–
Fair Price Discrimination

Kangning Wang (Stanford University)
–
Break
–
The Feedback Loop of Statistical Discrimination

Jackie Baek (NYU Stern)
–
Lunch (on your own)
–
Group Fairness in Dynamic Refugee Assignment

Daniel Freund (MIT)
–
Break
–
Overbooking with Priority-Respecting Reassignment

Irene Lo (Stanford University)
–
Reception
–
Coffee and Check-in
–
Online Combinatorial Auctions with Few Samples

Sahil Singla (Georgia Tech)
–
Instance-dependent guarantees for stochastic matrix games

Kevin Jamieson (University of Washington)
–
Break
–
Calibrated Stackelberg Games: Learning Optimal Commitments Against Calibrated Agents

Chara Podimata (MIT)
–
Lunch (on your own)
–
The SMART Approach to Instance-Optimal Online Learning

Christina Lee Yu (Cornell University)
–
Break
–
Learning to Defer in Content Moderation: The Human-AI Interplay

Thodoris Lykouris (MIT)
–
Coffee and Check-in
–
Learning Augmented Algorithms for MDPs

Adam Wierman (Caltech)
–
Recent advances in average-reward restless bandits

Weina Wang (Carnegie Mellon University)
–
Break
–
Local hedging approximately solves Pandora's box problems with optional inspection

Ziv Scully (Cornell ORIE)
–
Lunch (on your own)
–
Learning Inventory Policies on Arbitrary Demand Sequences

Will Ma (Columbia University)
–
Break
–
Leveraging Reviews: Learning to Price with Buyer and Seller Uncertainty

Ellen Vitercik (Stanford University)