research
∙
11/20/2022
Bidder Subset Selection Problem in Auction Design
Motivated by practical concerns in the online advertising industry, we s...
share
research
∙
10/19/2022
On the Perturbation Function of Ranking and Balance for Weighted Online Bipartite Matching
Ranking and Balance are arguably the two most important algorithms in th...
research
∙
09/26/2022
Lookahead Auctions with Pooling
A Lookahead Auction (LA), introduced by Ronen, is an auction format for ...
research
∙
04/14/2022
(Fractional) Online Stochastic Matching via Fine-Grained Offline Statistics
Motivated by display advertising on the internet, the online stochastic ...
research
∙
04/04/2022
Order Selection Prophet Inequality: From Threshold Optimization to Arrival Time Design
In the classical prophet inequality, a gambler faces a sequence of items...
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
On the Significance of Knowing the Arrival Order in Prophet Inequality
In a prophet inequality problem, n boxes arrive online, each containing ...
research
∙
02/07/2022
Improved Bounds for Fractional Online Matching Problems
Online bipartite matching with one-sided arrival and its variants have b...
research
∙
11/20/2021
Oblivious Online Contention Resolution Schemes
Contention resolution schemes (CRSs) are powerful tools for obtaining "e...
research
∙
10/17/2021
Online Facility Location with Predictions
We provide nearly optimal algorithms for online facility location (OFL) ...
research
∙
11/03/2020
Secretary Matching with General Arrivals
We provide online algorithms for secretary matching in general weighted ...
research
∙
05/13/2020
Fully Online Matching II: Beating Ranking and Water-filling
Karp, Vazirani, and Vazirani (STOC 1990) initiated the study of online b...
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
∙
02/14/2020
A Simple 1-1/e Approximation for Oblivious Bipartite Matching
We study the oblivious matching problem, which aims at finding a maximum...
research
∙
11/27/2019
Generalizing Complex Hypotheses on Product Distributions: Auctions, Prophet Inequalities, and Pandora's Problem
This paper explores a theory of generalization for learning problems on ...
research
∙
11/12/2019
Online Stochastic Matching with Edge Arrivals
Online bipartite matching with edge arrivals is an important extension o...
research
∙
07/11/2019
Perturbed Greedy on Oblivious Matching Problems
We study the maximum matching problem in the oblivious setting, i.e. the...
research
∙
11/02/2018
Tight Approximation Ratio of Anonymous Pricing
We consider two canonical Bayesian mechanism design settings. In the sin...
research
∙
10/18/2018
Tight Competitive Ratios of Classic Matching Algorithms in the Fully Online Model
Huang et al. (STOC 2018) introduced the fully online matching problem, a...
research
∙
06/06/2018
Online Makespan Minimization: The Power of Restart
We consider the online makespan minimization problem on identical machin...
research
∙
04/20/2018
Online Vertex-Weighted Bipartite Matching: Beating 1-1/e with Random Arrivals
We introduce a weighted version of the ranking algorithm by Karp et al. ...
research
∙
04/02/2018
Tight Revenue Gaps among Simple Mechanisms
We consider the simplest and most fundamental problem of selling a singl...
research
∙
02/12/2018
How to Match when All Vertices Arrive Online
We introduce a fully online model of maximum cardinality matching in whi...
research
∙
02/08/2018
Monopoly pricing with buyer search
In many shopping scenarios, e.g., in online shopping, customers have a l...
research
∙
11/05/2017