research
∙
07/27/2023
Learning in Repeated Multi-Unit Pay-As-Bid Auctions
Motivated by Carbon Emissions Trading Schemes, Treasury Auctions, and Pr...
share
research
∙
06/21/2023
Online Resource Allocation with Convex-set Machine-Learned Advice
Decision-makers often have access to a machine-learned prediction about ...
research
∙
06/12/2023
Multi-Platform Budget Management in Ad Markets with Non-IC Auctions
In online advertising markets, budget-constrained advertisers acquire ad...
research
∙
06/12/2023
Interpolating Item and User Fairness in Recommendation Systems
Online platforms employ recommendation systems to enhance customer engag...
research
∙
05/27/2023
Online Learning in Multi-unit Auctions
We consider repeated multi-unit auctions with uniform pricing, which are...
research
∙
02/03/2023
Multi-channel Autobidding with Budget and ROI Constraints
In digital online advertising, advertisers procure ad impressions simult...
research
∙
10/28/2022
Dynamic Bandits with an Auto-Regressive Temporal Structure
Multi-armed bandit (MAB) problems are mainly studied under two extreme s...
research
∙
09/10/2022
Fairness in the Autobidding World with Machine-learned Advice
The increasing availability of real-time data has fueled the prevalence ...
research
∙
08/15/2022
Fair Assortment Planning
Many online platforms, ranging from online retail stores to social media...
research
∙
08/05/2022
Active Learning for Non-Parametric Choice Models
We study the problem of actively learning a non-parametric choice model ...
research
∙
08/07/2021
Online Resource Allocation with Time-Flexible Customers
In classic online resource allocation problems, a decision-maker tries t...
research
∙
07/16/2021
Bidding and Pricing in Budget and ROI Constrained Markets
In online advertising markets, setting budget and return on investment (...
research
∙
02/18/2021
Online Learning via Offline Greedy Algorithms: Applications in Market Design and Optimization
Motivated by online decision-making in time-varying combinatorial enviro...
research
∙
11/07/2020
No-regret Learning in Price Competitions under Consumer Reference Effects
We study long-run market stability for repeated price competitions betwe...
research
∙
09/10/2020
Learning Product Rankings Robust to Fake Users
In many online platforms, customers' decisions are substantially influen...
research
∙
07/14/2020
Optimal Learning for Structured Bandits
We study structured multi-armed bandits, which is the problem of online ...
research
∙
02/25/2020
Dynamic Incentive-aware Learning: Robust Pricing in Contextual Auctions
Motivated by pricing in ad exchange markets, we consider the problem of ...
research
∙
11/08/2019
Incentive-aware Contextual Pricing with Non-parametric Market Noise
We consider a dynamic pricing problem for repeated contextual second-pri...
research
∙
05/04/2019
LP-based Approximation for Personalized Reserve Prices
We study the problem of computing revenue-optimal personalize (non-anony...
research
∙
09/25/2018
Contextual Bandits with Cross-learning
In the classical contextual bandits problem, in each round t, a learner ...
research
∙
07/10/2018
