17 citations · 95 across the 34 of their papers we have counts for
10 papers · 1 filter
Incentives for Early Arrival in Cost Sharing
Junyu Zhang, Yao Zhang, Yaoxin Ge +4
In cooperative games, we study how values created or costs incurred by a coalition are shared among the members within it, and the players may join the coalition in a online manner…
Choosing Behind the Veil: Tight Bounds for Identity-Blind Online Algorithms
Tomer Ezra, Michal Feldman, Zhihao Gavin Tang
In Bayesian online settings, every element has a value that is drawn from a known underlying distribution, which we refer to as the element's identity. The elements arrive sequenti…
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…
"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…
Generalizing Complex Hypotheses on Product Distributions: Auctions, Prophet Inequalities, and Pandora's Problem
Chenghao Guo, Zhiyi Huang, Zhihao Gavin Tang +1
This paper explores a theory of generalization for learning problems on product distributions, complementing the existing learning theories in the sense that it does not rely on an…
Tight Approximation Ratio of Anonymous Pricing
Yaonan Jin, Pinyan Lu, Qi Qi +2
We consider two canonical Bayesian mechanism design settings. In the single-item setting, we prove tight approximation ratio for anonymous pricing: compared with Myerson Auction, i…
Tight Revenue Gaps among Simple Mechanisms
Yaonan Jin, Pinyan Lu, Zhihao Gavin Tang +1
We consider a fundamental problem in microeconomics: selling a single item to a number of potential buyers, whose values are drawn from known independent and regular (not necessari…
Monopoly pricing with buyer search
Nick Gravin, Zhihao Gavin Tang
In many shopping scenarios, e.g., in online shopping, customers have a large menu of options to choose from. However, most of the buyers do not browse all the options and make deci…
The Value of Information Concealment
Hu Fu, Chris Liaw, Pinyan Lu +1
We consider a revenue optimizing seller selling a single item to a buyer, on whose private value the seller has a noisy signal. We show that, when the signal is kept private, arbit…