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/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
∙
06/22/2023
The Power of Menus in Contract Design
We study the power of menus of contracts in principal-agent problems wit...
research
∙
05/31/2023
Is Learning in Games Good for the Learners?
We consider a number of questions related to tradeoffs between reward an...
research
∙
02/03/2023
Pseudonorm Approachability and Applications to Regret Minimization
Blackwell's celebrated approachability theory provides a general framewo...
research
∙
10/21/2022
Anonymous Bandits for Multi-User Systems
In this work, we present and study a new framework for online learning i...
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
∙
05/28/2022
History-Restricted Online Learning
We introduce the concept of history-restricted no-regret online learning...
research
∙
05/17/2022
Strategizing against Learners in Bayesian Games
We study repeated two-player games where one of the players, the learner...
research
∙
02/15/2022
Multiparameter Bernoulli Factories
We consider the problem of computing with many coins of unknown bias. We...
research
∙
11/15/2021
Margin-Independent Online Multiclass Learning via Convex Geometry
We consider the problem of multi-class classification, where a stream of...
research
∙
06/09/2021
Contextual Recommendations and Low-Regret Cutting-Plane Algorithms
We consider the following variant of contextual linear bandits motivated...
research
∙
03/02/2021
Prior-free Dynamic Mechanism Design With Limited Liability
We study the problem of repeatedly auctioning off an item to one of k bi...
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
∙
10/14/2020
Contracts under Moral Hazard and Adverse Selection
In the classical principal-agent problem, a principal must design a cont...
research
∙
09/10/2020
Learning Product Rankings Robust to Fake Users
In many online platforms, customers' decisions are substantially influen...
research
∙
06/11/2020
Reserve Price Optimization for First Price Auctions
The display advertising industry has recently transitioned from second- ...
research
∙
04/21/2020
Competing Optimally Against An Imperfect Prophet
Consider a gambler who observes the realizations of n independent, non-n...
research
∙
03/03/2020
Contextual Search for General Hypothesis Classes
We study a general version of the problem of online learning under binar...
research
∙
09/30/2019
Strategizing against No-regret Learners
How should a player who repeatedly plays a game against a no-regret lear...
research
∙
09/25/2018
Contextual Bandits with Cross-learning
In the classical contextual bandits problem, in each round t, a learner ...
research
∙
04/09/2018
Contextual Search via Intrinsic Volumes
We study the problem of contextual search, a multidimensional generaliza...
research
∙
11/25/2017
Selling to a No-Regret Buyer
We consider the problem of a single seller repeatedly selling a single i...
research
∙
10/08/2017
The space complexity of mirror games
We consider a simple streaming game between two players Alice and Bob, w...
research
∙
06/27/2017
Multi-armed Bandit Problems with Strategic Arms
We study a strategic version of the multi-armed bandit problem, where ea...
research
∙
05/12/2016