The Schedule

 Note: Each talk has a 30 minute slot including questions.

Monday June 5, 10:00AM-12:30PM

10:00 

Jason Hartline (Northwestern). Title: Optimization of Scoring Rules.

10:30

Ioannis Panageas (UC Irvine). Title: Efficiently Computing Nash Equilibria in Adversarial Team Markov Games. 

Poster Session 11:00 - 11:30

11:30

Adrian Vetta (McGill). Title: One-Sided Allocation Problems with Multi-Unit Demand Bidders.

12:00 

Evangelia Gergatsouli (Wisconsin-Madison). Title: Opening Pandora’s Box: the Correlated Case.

Tuesday June 6, 10:00AM-12:30PM

10:00

Robert Kleinberg (Cornell). Title: Estimating an Empirical Distribution Using Threshold Queries.

10:30

Noah Golowich (MIT). Title: On the Complexity of Multi-Agent Decision Making: From Learning in Games to Partial Monitoring.

Poster Session 11:00 - 11:30

11:30

Mahsa Derakhshan (Northeastern). Title: Stochastic Weighted Matching with Commitment.

12:00

Manolis Vlatakis (UC Berkeley). Title: A Quest for Fixed Points: Reconsidering the Computational Complexity of Nash Equilibrium in Machine Learning and Economics Applications.

Wednesday June 7, 10:00AM-12:30PM

10:00

Mohammad Hajiaghayi (Maryland). Title: Trading Prophets.

10:30

Ruta Mehta (UIUC). Title: Fair Division of Indivisibles.

11:00

Rucha Kulkarni (UIUC). Title: Semi-online Algorithms for Envy free Route Recommendations.

Open Problem Session 11:30 - 12:30