research
∙
06/18/2023
Bidder Selection Problem in Position Auctions via Poisson Approximation
We consider Bidder Selection Problem (BSP) in position auctions motivate...
share
research
∙
11/20/2022
Bidder Subset Selection Problem in Auction Design
Motivated by practical concerns in the online advertising industry, we s...
research
∙
09/26/2022
Lookahead Auctions with Pooling
A Lookahead Auction (LA), introduced by Ronen, is an auction format for ...
research
∙
04/04/2022
The Cardinal Complexity of Comparison-based Online Algorithms
We consider ordinal online problems, i.e., those tasks that only depend ...
research
∙
02/18/2022
Bayesian and Randomized Clock Auctions
In a single-parameter mechanism design problem, a provider is looking to...
research
∙
02/18/2022
On the Significance of Knowing the Arrival Order in Prophet Inequality
In a prophet inequality problem, n boxes arrive online, each containing ...
research
∙
11/03/2020
Secretary Matching with General Arrivals
We provide online algorithms for secretary matching in general weighted ...
research
∙
02/23/2020
Online Stochastic Max-Weight Matching: prophet inequality for vertex and edge arrival models
We provide prophet inequality algorithms for online weighted matching in...
research
∙
11/12/2019
Online Stochastic Matching with Edge Arrivals
Online bipartite matching with edge arrivals is an important extension o...
research
∙
02/17/2019
Prophet inequality for bipartite matching: merits of being simple and non adaptive
We consider Bayesian online selection problem of a matching in bipartite...
research
∙
02/12/2019
Optimal Budget-Feasible Mechanisms for Additive Valuations
In this paper, we obtain tight approximation guarantee for budget-feasib...
research
∙
02/12/2019
Envy-freeness up to any item with high Nash welfare: The virtue of donating items
Several fairness concepts have been proposed recently in attempts to app...
research
∙
09/13/2018
A Simple Mechanism for a Budget-Constrained Buyer
We study a classic Bayesian mechanism design setting of monopoly problem...
research
∙
02/08/2018
