9 citations · 38 across the 12 of their papers we have counts for
23 papers
Bidder Subset Selection Problem in Auction Design
Xiaohui Bei, Nick Gravin, Pinyan Lu +1
Motivated by practical concerns in the online advertising industry, we study a bidder subset selection problem in single-item auctions. In this problem, a large pool of candidate b…
Lookahead Auctions with Pooling
Almog Wald, Michal Feldman, Nick Gravin +1
A Lookahead Auction (LA), introduced by Ronen, is an auction format for the sale of a single item among multiple buyers, which is considered simpler and more fair than the optimal…
(Fractional) Online Stochastic Matching via Fine-Grained Offline Statistics
Zhihao Gavin Tang, Hongxun Wu, Jinzhao Wu
Motivated by display advertising on the internet, the online stochastic matching problem is proposed by Feldman, Mehta, Mirrokni, and Muthukrishnan (FOCS 2009). Consider a stochast…
Order Selection Prophet Inequality: From Threshold Optimization to Arrival Time Design
Bo Peng, Zhihao Gavin Tang
In the classical prophet inequality, a gambler faces a sequence of items, whose values are drawn independently from known distributions. Upon the arrival of each item, its value is…
Improved Bounds for Fractional Online Matching Problems
Zhihao Gavin Tang, Yuhao Zhang
Online bipartite matching with one-sided arrival and its variants have been extensively studied since the seminal work of Karp, Vazirani, and Vazirani (STOC 1990). Motivated by rea…
Secretary Matching with General Arrivals
Tomer Ezra, Michal Feldman, Nick Gravin +1
We provide online algorithms for secretary matching in general weighted graphs, under the well-studied models of vertex and edge arrivals. In both models, edges are associated with…