Sequential Posted-Price Mechanisms with Correlated Valuations

We study the revenue performance of sequential posted-price mechanisms and some natural extensions for a setting where the valuations of the buyers are drawn from a correlated distribution. Sequential posted-price mechanisms are conceptually simple mechanisms that work by proposing a “take-it-or-leave-it” offer to each buyer. We apply sequential posted-price mechanisms to single-parameter multiunit settings in which each buyer demands only one item and the mechanism can assign the service to at most k of the buyers. For standard sequential posted-price mechanisms, we prove that with the valuation distribution having finite support, no sequential posted-price mechanism can extract a constant fraction of the optimal expected revenue, even with unlimited supply. We extend this result to the case of a continuous valuation distribution when various standard assumptions hold simultaneously (i.e., everywhere-supported, continuous, symmetric, and normalized (conditional) distributions that satisfy regularity, the MHR condition, and affiliation). In fact, it turns out that the best fraction of the optimal revenue that is extractable by a sequential posted-price mechanism is proportional to the ratio of the highest and lowest possible valuation. We prove that a simple generalization of these mechanisms achieves a better revenue performance; namely, if the sequential posted-price mechanism has for each buyer the option of either proposing an offer or asking the buyer for its valuation, then a Ω (1/max { 1,d}) fraction of the optimal revenue can be extracted, where d denotes the degree of dependence of the valuations, ranging from complete independence (d=0) to arbitrary dependence (d = n-1).

[1]  P. Reny,et al.  Correlated Information and Mechanism Design , 1992 .

[2]  Noam Nisan,et al.  Competitive analysis of incentive compatible on-line auctions , 2000, EC '00.

[3]  Moshe Babaioff,et al.  Peaches, lemons, and cookies: designing auction markets with dispersed information , 2013, EC '13.

[4]  Atri Rudra,et al.  Approximating Matches Made in Heaven , 2009, ICALP.

[5]  Lawrence M. Ausubel A Generalized Vickrey Auction , 2000 .

[6]  Michal Feldman,et al.  Combinatorial Auctions via Posted Prices , 2014, SODA.

[7]  Shuchi Chawla,et al.  Multi-parameter mechanism design and sequential posted pricing , 2010, BQGT.

[8]  Roger B. Myerson,et al.  Optimal Auction Design , 1981, Math. Oper. Res..

[9]  Shengwu Li Obviously Strategy-Proof Mechanisms , 2017 .

[10]  Avrim Blum,et al.  Near-optimal online auctions , 2005, SODA '05.

[11]  Vol Cxv Issue EFFICIENT AUCTIONS , 2000 .

[12]  Qiqi Yan,et al.  Mechanism design via correlation gap , 2010, SODA '11.

[13]  Maxim Sviridenko,et al.  Submodular Stochastic Probing on Matroids , 2013, Math. Oper. Res..

[14]  Ran El-Yaniv,et al.  Optimal Search and One-Way Trading Online Algorithms , 2001, Algorithmica.

[15]  Nikhil R. Devanur,et al.  Simple Auctions with Simple Strategies , 2015, EC.

[16]  Christos H. Papadimitriou,et al.  On optimal single-item auctions , 2010, STOC '11.

[17]  Allan Borodin,et al.  Sequential Posted Price Mechanisms with Correlated Valuations , 2015, WINE.

[18]  S. Matthew Weinberg,et al.  Matroid prophet inequalities , 2012, STOC '12.

[19]  Tuomas Sandholm,et al.  Sequences of Take-It-or-Leave-It Offers: Near-Optimal Auctions Without Full Valuation Revelation , 2003, AMEC.

[20]  R. McAfee,et al.  Extracting the Surplus in the Common-Value Auction , 1989 .

[21]  Tilman Börgers,et al.  An introduction to the theory of mechanism design , 2015 .

[22]  Amir Ronen,et al.  On approximating optimal auctions , 2001, EC '01.

[23]  E. H. Clarke Multipart pricing of public goods , 1971 .

[24]  T. Roughgarden,et al.  Optimal and near-optimal mechanism design with interdependent values , 2013, EC '13.

[25]  S. Matthew Weinberg,et al.  A Simple and Approximately Optimal Mechanism for an Additive Buyer , 2014, 2014 IEEE 55th Annual Symposium on Foundations of Computer Science.

[26]  Jason D. Hartline,et al.  Multi-parameter mechanism design and sequential posted pricing , 2009, STOC '10.

[27]  Anna R. Karlin,et al.  Approximate revenue maximization in interdependent value settings , 2014, EC.

[28]  Frank Thomson Leighton,et al.  The value of knowing a demand curve: bounds on regret for online posted-price auctions , 2003, 44th Annual IEEE Symposium on Foundations of Computer Science, 2003. Proceedings..

[29]  Ola Svensson,et al.  Online Contention Resolution Schemes , 2015, SODA.

[30]  Theodore Groves,et al.  Incentives in Teams , 1973 .

[31]  Rajeev Motwani,et al.  Randomized Algorithms , 1995, SIGA.

[32]  Ronald M. Harstad,et al.  Information Impact and Allocation Rules in Auctions with Affiliated Private Values: A Laboratory Study , 1987 .

[33]  Shahar Dobzinski,et al.  Optimal auctions with correlated bidders are easy , 2010, STOC '11.

[34]  Amin Saberi,et al.  On the hardness of optimal auctions , 2002, The 43rd Annual IEEE Symposium on Foundations of Computer Science, 2002. Proceedings..

[35]  Ilya Segal,et al.  Optimal Pricing Mechanisms with Unknown Demand , 2002 .

[36]  Tim Roughgarden,et al.  Simple versus optimal mechanisms , 2009, SECO.

[37]  Vijay Kumar,et al.  Online learning in online auctions , 2003, SODA '03.

[38]  Nicole Immorlica,et al.  Matroids, secretary problems, and online mechanisms , 2007, SODA '07.

[39]  Tuomas Sandholm,et al.  Sequences of take-it-or-leave-it offers: near-optimal auctions without full valuation revelation , 2003, AAMAS '06.

[40]  William Vickrey,et al.  Counterspeculation, Auctions, And Competitive Sealed Tenders , 1961 .

[41]  Renato Paes Leme,et al.  Optimal mechanisms for selling information , 2012, EC '12.

[42]  Yunan Li,et al.  Approximation in mechanism design with interdependent values , 2013, EC '13.

[43]  Richard P. McLean,et al.  FULL EXTRACTION OF THE SURPLUS IN BAYESIAN AND DOMINANT STRATEGY AUCTIONS , 1988 .

[44]  Liad Blumrosen,et al.  Posted prices vs. negotiations: an asymptotic analysis , 2008, EC '08.

[45]  Éva Tardos,et al.  Information Asymmetries in Common-Value Auctions with Discrete Signals , 2013, EC.

[46]  Anupam Gupta,et al.  A Stochastic Probing Problem with Applications , 2013, IPCO.

[47]  S. Matthew Weinberg,et al.  Simple Mechanisms for a Subadditive Buyer and Applications to Revenue Monotonicity , 2018, ACM Trans. Economics and Comput..