research
∙
07/22/2023
Nonbossy Mechanisms: Mechanism Design Robust to Secondary Goals
We study mechanism design when agents may have hidden secondary goals wh...
share
research
∙
07/21/2023
Bandits with Deterministically Evolving States
We propose a model for learning with bandit feedback while accounting fo...
research
∙
07/17/2023
Bayesian Conversations
We initiate the study of Bayesian conversations, which model interactive...
research
∙
06/30/2023
U-Calibration: Forecasting for an Unknown Agent
We consider the problem of evaluating forecasts of binary events whose p...
research
∙
05/09/2023
Description Complexity of Regular Distributions
Myerson's regularity condition of a distribution is a standard assumptio...
research
∙
07/18/2022
Bernoulli Factories for Flow-Based Polytopes
We construct explicit combinatorial Bernoulli factories for the class of...
research
∙
06/15/2022
Corruption-Robust Contextual Search through Density Updates
We study the problem of contextual search in the adversarial noise model...
research
∙
02/15/2022
Multiparameter Bernoulli Factories
We consider the problem of computing with many coins of unknown bias. We...
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
∙
06/09/2021
Contextual Recommendations and Low-Regret Cutting-Plane Algorithms
We consider the following variant of contextual linear bandits motivated...
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
Interactive Communication in Bilateral Trade
We define a model of interactive communication where two agents with pri...
research
∙
05/19/2021
Calibrated Click-Through Auctions: An Information Design Approach
We analyze the optimal information design in a click-through auction wit...
research
∙
11/13/2020
Secretaries with Advice
The secretary problem is probably the purest model of decision making un...
research
∙
11/07/2020
Combinatorial Bernoulli Factories: Matchings, Flows and Other Polytopes
A Bernoulli factory is an algorithmic procedure for exact sampling of ce...
research
∙
04/21/2020
Competing Optimally Against An Imperfect Prophet
Consider a gambler who observes the realizations of n independent, non-n...
research
∙
03/04/2020
Bandits with adversarial scaling
We study "adversarial scaling", a multi-armed bandit model where rewards...
research
∙
03/03/2020
Contextual Search for General Hypothesis Classes
We study a general version of the problem of online learning under binar...
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/04/2019
Learning to Clear the Market
The problem of market clearing is to set a price for an item such that q...
research
∙
05/04/2019
LP-based Approximation for Personalized Reserve Prices
We study the problem of computing revenue-optimal personalize (non-anony...
research
∙
12/07/2018
Optimal Dynamic Auctions are Virtual Welfare Maximizers
We are interested in the setting where a seller sells sequentially arriv...
research
∙
11/15/2018
Secretary Ranking with Minimal Inversions
We study a twist on the classic secretary problem, which we term the sec...
research
∙
07/10/2018
Improved Approximations for Free-Order Prophets and Second-Price Auctions
We study the fundamental problem of selling a single indivisible item to...
research
∙
05/09/2018
On the Construction of Substitutes
Gross substitutability is a central concept in Economics and is connecte...
research
∙
04/09/2018
Contextual Search via Intrinsic Volumes
We study the problem of contextual search, a multidimensional generaliza...
research
∙
03/25/2018