research
∙
08/22/2023
When Are Two Lists Better than One?: Benefits and Harms in Joint Decision-making
Historically, much of machine learning research has focused on the perfo...
share
research
∙
01/23/2023
Congested Bandits: Optimal Routing via Short-term Resets
For traffic routing platforms, the choice of which route to recommend to...
research
∙
11/04/2022
Online Learning and Bandits with Queried Hints
We consider the classic online learning and stochastic multi-armed bandi...
research
∙
05/09/2022
Improved Price of Anarchy via Predictions
A central goal in algorithmic game theory is to analyze the performance ...
research
∙
09/14/2021
Machine-Learned Prediction Equilibrium for Dynamic Traffic Assignment
We study a dynamic traffic assignment model, where agents base their ins...
research
∙
06/09/2021
Contextual Recommendations and Low-Regret Cutting-Plane Algorithms
We consider the following variant of contextual linear bandits motivated...
research
∙
09/20/2020
Almost Envy-free Repeated Matching in Two-sided Markets
A two-sided market consists of two sets of agents, each of whom have pre...
research
∙
07/12/2019
On the Price of Anarchy of Cost-Sharing in Real-Time Scheduling Systems
We study cost-sharing games in real-time scheduling systems where the ac...
research
∙
09/07/2018
Cost Sharing in Two-Sided Markets
Motivated by the emergence of popular service-based two-sided markets wh...
research
∙
11/30/2017