research
∙
05/09/2023
Description Complexity of Regular Distributions
Myerson's regularity condition of a distribution is a standard assumptio...
share
research
∙
02/16/2023
Joint Feedback Loop for Spend and Return-On-Spend Constraints
Budget pacing is a popular service that has been offered by major intern...
research
∙
02/03/2023
Robust Budget Pacing with a Single Sample
Major Internet advertising platforms offer budget pacing tools as a stan...
research
∙
02/03/2023
Pseudonorm Approachability and Applications to Regret Minimization
Blackwell's celebrated approachability theory provides a general framewo...
research
∙
05/17/2022
Strategizing against Learners in Bayesian Games
We study repeated two-player games where one of the players, the learner...
research
∙
03/22/2022
Price Manipulability in First-Price Auctions
First-price auctions have many desirable properties, including uniquely ...
research
∙
02/12/2022
From Online Optimization to PID Controllers: Mirror Descent with Momentum
We study a family of first-order methods with momentum based on mirror d...
research
∙
11/05/2021
Approximately Efficient Bilateral Trade
We study bilateral trade between two strategic agents. The celebrated re...
research
∙
11/04/2021
Pricing Query Complexity of Revenue Maximization
The common way to optimize auction and pricing systems is to set aside a...
research
∙
10/13/2021
Online Bipartite Matching with Reusable Resources
We study the classic online bipartite matching problem with a twist: off...
research
∙
07/14/2021
Online Allocation and Display Ads Optimization with Surplus Supply
In this work, we study a scenario where a publisher seeks to maximize it...
research
∙
06/08/2021
Learning to Price Against a Moving Target
In the Learning to Price setting, a seller posts prices over time with t...
research
∙
06/03/2021
Optimal Pricing Schemes for an Impatient Buyer
A patient seller aims to sell a good to an impatient buyer (i.e., one wh...
research
∙
04/21/2020
Competing Optimally Against An Imperfect Prophet
Consider a gambler who observes the realizations of n independent, non-n...
research
∙
01/16/2020
Why Do Competitive Markets Converge to First-Price Auctions?
We consider a setting in which bidders participate in multiple auctions ...
research
∙
06/27/2019
Separation between Second Price Auctions with Personalized Reserves and the Revenue Optimal Auction
What fraction of the single item n buyers setting's expected optimal rev...
research
∙
06/07/2019
Dynamic First Price Auctions Robust to Heterogeneous Buyers
We study dynamic mechanisms for optimizing revenue in repeated auctions,...
research
∙
03/10/2019
Near Optimal Online Algorithms and Fast Approximation Algorithms for Resource Allocation Problems
We present prior robust algorithms for a large class of resource allocat...
research
∙
03/01/2018