60 citations · 237 across the 39 of their papers we have counts for
28 papers · 1 filter
On Robustness to -wise Independence of Optimal Bayesian Mechanisms
Nick Gravin, Zhiqi Wang
This paper reexamines the classic problem of revenue maximization in single-item auctions with buyers under the lens of the robust optimization framework. The celebrated Myerso…
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…
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…
Prophet inequality for bipartite matching: merits of being simple and non adaptive
Nick Gravin, Hongao Wang
We consider Bayesian online selection problem of a matching in bipartite graphs, i.e., online weighted matching problem with edge arrivals where online algorithm knows distribution…