research
∙
06/22/2023
The Power of Menus in Contract Design
We study the power of menus of contracts in principal-agent problems wit...
share
research
∙
10/05/2022
A Fourier Approach to Mixture Learning
We revisit the problem of learning mixtures of spherical Gaussians. Give...
research
∙
07/19/2022
Prior-Independent Auctions for Heterogeneous Bidders
We study the design of prior-independent auctions in a setting with hete...
research
∙
11/19/2021
Maximizing revenue in the presence of intermediaries
We study the mechanism design problem of selling k items to unit-demand ...
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
∙
09/07/2021
Learning to Bid in Contextual First Price Auctions
In this paper, we investigate the problem about how to bid in repeated c...
research
∙
06/09/2021
Contextual Recommendations and Low-Regret Cutting-Plane Algorithms
We consider the following variant of contextual linear bandits motivated...
research
∙
10/22/2020
Scalable Bottom-Up Hierarchical Clustering
Bottom-up algorithms such as the classic hierarchical agglomerative clus...
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/14/2020
Convergence Analysis of No-Regret Bidding Algorithms in Repeated Auctions
The connection between games and no-regret algorithms has been widely st...
research
∙
07/28/2020
Big Bird: Transformers for Longer Sequences
Transformers-based models, such as BERT, have been one of the most succe...
research
∙
05/28/2020
Dimension-Free Bounds on Chasing Convex Functions
We consider the problem of chasing convex functions, where functions arr...
research
∙
05/28/2019
Chasing Convex Bodies with Linear Competitive Ratio
We study the problem of chasing convex bodies online: given a sequence o...
research
∙
04/19/2019
Stochastic Online Metric Matching
We study the minimum-cost metric perfect matching problem under online i...
research
∙
12/19/2018
Sticky Brownian Rounding and its Applications to Constraint Satisfaction Problems
Semidefinite programming is a powerful tool in the design and analysis o...
research
∙
11/06/2017