research
∙
07/14/2023
Strategic Budget Selection in a Competitive Autobidding World
We study a game played between advertisers in an online ad platform. The...
share
research
∙
01/31/2023
Certification Design for a Competitive Market
Motivated by applications such as voluntary carbon markets and education...
research
∙
01/30/2023
Autobidders with Budget and ROI Constraints: Efficiency, Regret, and Pacing Dynamics
We study a game between autobidding algorithms that compete in an online...
research
∙
05/26/2022
Communicating with Anecdotes
We study a communication game between a sender and receiver where the se...
research
∙
05/18/2022
Budget Pacing in Repeated Auctions: Regret and Efficiency without Convergence
We study the aggregate welfare and individual regret guarantees of dynam...
research
∙
03/02/2022
Truthful Online Scheduling of Cloud Workloads under Uncertainty
Cloud computing customers often submit repeating jobs and computation pi...
research
∙
07/13/2021
On the Impact of Information Acquisition and Aftermarkets on Auction Efficiency
A common assumption in auction theory is that the information available ...
research
∙
03/05/2021
Revenue Maximization for Buyers with Outside Options
We study mechanisms for selling a single item when buyers have private v...
research
∙
02/17/2021
Designing Approximately Optimal Search on Matching Platforms
We study the design of a decentralized two-sided matching market in whic...
research
∙
01/18/2021
Buying Data Over Time: Approximately Optimal Strategies for Dynamic Data-Driven Decisions
We consider a model where an agent has a repeated decision to make and w...
research
∙
12/04/2020
Non-quasi-linear Agents in Quasi-linear Mechanisms
Mechanisms with money are commonly designed under the assumption that ag...
research
∙
12/01/2020
Dynamic Weighted Matching with Heterogeneous Arrival and Departure Rates
We study a dynamic non-bipartite matching problem. There is a fixed set ...
research
∙
11/03/2020
Maximizing Welfare with Incentive-Aware Evaluation Mechanisms
Motivated by applications such as college admission and insurance rate d...
research
∙
06/04/2020
Two-Buyer Sequential Multiunit Auctions with No Overbidding
We study equilibria in two-buyer sequential second-price (or first-price...
research
∙
04/21/2020
An O(log log m) Prophet Inequality for Subadditive Combinatorial Auctions
Prophet inequalities compare the expected performance of an online algor...
research
∙
03/21/2020
Black-box Methods for Restoring Monotonicity
In many practical applications, heuristic or approximation algorithms ar...
research
∙
03/12/2020
Escaping Cannibalization? Correlation-Robust Pricing for a Unit-Demand Buyer
A single seller wishes to sell n items to a single unit-demand buyer. We...
research
∙
02/16/2020
Simple, Credible, and Approximately-Optimal Auctions
We identify the first static credible mechanism for multi-item additive ...
research
∙
12/13/2019
Reducing Inefficiency in Carbon Auctions with Imperfect Competition
We study auctions for carbon licenses, a policy tool used to control the...
research
∙
10/09/2019
Prophets, Secretaries, and Maximizing the Probability of Choosing the Best
Suppose a customer is faced with a sequence of fluctuating prices, such ...
research
∙
06/26/2019
The Complexity of Black-Box Mechanism Design with Priors
We study black-box reductions from mechanism design to algorithm design ...
research
∙
02/14/2019
Procrastinating with Confidence: Near-Optimal, Anytime, Adaptive Algorithm Configuration
Algorithm configuration methods optimize the performance of a parameteri...
research
∙
01/30/2019
Online Pandora's Boxes and Bandits
We consider online variations of the Pandora's box problem (Weitzman. 19...
research
∙
11/07/2017
Combinatorial Assortment Optimization
Assortment optimization refers to the problem of designing a slate of pr...
research
∙
11/03/2017
Optimal Data Acquisition for Statistical Estimation
We consider a data analyst's problem of purchasing data from strategic a...
research
∙
07/04/2017