60 citations · 237 across the 39 of their papers we have counts for
5 papers · 1 filter
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…
Online Ordinal Problems: Optimality of Comparison-based Algorithms and their Cardinal Complexity
Nick Gravin, Enze Sun, Zhihao Gavin Tang
We consider ordinal online problems, i.e., tasks that only require pairwise comparisons between elements of the input. A classic example is the secretary problem and the game of go…
Bayesian and Randomized Clock Auctions
Michal Feldman, Vasilis Gkatzelis, Nick Gravin +1
In a single-parameter mechanism design problem, a provider is looking to sell a service to a group of potential buyers. Each buyer has a private value for receiving the s…
"Who Is Next in Line?'' On the Significance of Knowing the Arrival Order in Bayesian Online Settings
Tomer Ezra, Michal Feldman, Nick Gravin +1
We introduce a new measure for the performance of online algorithms in Bayesian settings, where the input is drawn from a known prior, but the realizations are revealed one-by-one…