research
∙
11/10/2022
Multi-Agent Contracts
We study a natural combinatorial single-principal multi-agent contract d...
share
research
∙
11/01/2022
Simplified Prophet Inequalities for Combinatorial Auctions
We consider prophet inequalities for XOS and MPH-k combinatorial auction...
research
∙
10/25/2022
Online and Bandit Algorithms Beyond ℓ_p Norms
Vector norms play a fundamental role in computer science and optimizatio...
research
∙
09/29/2021
Combinatorial Contracts
We introduce a new model of combinatorial contracts in which a principal...
research
∙
07/01/2021
Asymptotically Optimal Welfare of Posted Pricing for Multiple Items with MHR Distributions
We consider the problem of posting prices for unit-demand buyers if all ...
research
∙
05/31/2021
Truthful Mechanisms for Two-Sided Markets via Prophet Inequalities
We design novel mechanisms for welfare-maximization in two-sided markets...
research
∙
10/14/2020
Online Learning with Vector Costs and Bandits with Knapsacks
We introduce online learning with vector costs () where in each time ste...
research
∙
10/03/2020
Improved Truthful Mechanisms for Subadditive Combinatorial Auctions: Breaking the Logarithmic Barrier
We present a computationally-efficient truthful mechanism for combinator...
research
∙
06/20/2020
Knapsack Secretary with Bursty Adversary
The random-order or secretary model is one of the most popular beyond-wo...
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
∙
09/18/2019
How to Hire Secretaries with Stochastic Departures
We study a generalization of the secretary problem, where decisions do n...
research
∙
04/25/2018
Price of Anarchy for Mechanisms with Risk-Averse Agents
We study the price of anarchy of mechanisms in the presence of risk-aver...
research
∙
10/30/2017