Buy-It-Now or Take-a-Chance: Price Discrimination through Randomized Auctions

Increasingly detailed consumer information makes sophisticated price discrimination possible. At fine levels of aggregation, demand may not obey standard regularity conditions. We propose a new randomized sales mechanism for such environments. Bidders can “buy-it-now” at a posted price, or “take-a-chance” in an auction where the top d > 1 bidders are equally likely to win. The randomized allocation incentivizes high-valuation bidders to buy-it-now. We analyze equilibrium behavior and apply our analysis to advertiser bidding data from Microsoft Advertising Exchange. In counterfactual simulations, our mechanism increases revenue by 4.4% and consumer surplus by 14.5% compared to an optimal second-price auction. This paper was accepted by Assaf Zeevi, stochastic models and simulation.

[1]  Jon Feldman,et al.  Online Ad Assignment with Free Disposal , 2009, WINE.

[2]  P. Courty,et al.  Sequential Screening , 1998 .

[3]  Paul R. Milgrom,et al.  Monotone Comparative Statics , 1994 .

[4]  A. Ullah,et al.  Nonparametric Econometrics , 1999 .

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

[6]  David M. Kristol,et al.  HTTP State Management Mechanism , 1997, RFC.

[7]  Sergei Vassilvitskii,et al.  To Match or Not to Match , 2015, ACM Trans. Economics and Comput..

[8]  Andrea Prat,et al.  Screening with an Approximate Type Space , 2010 .

[9]  R. McAfee,et al.  An overview of practical exchange design , 2012 .

[10]  Vahab S. Mirrokni,et al.  Quasi-Proportional Mechanisms: Prior-Free Revenue Maximization , 2009, LATIN.

[11]  Péter Eso,et al.  Optimal Information Disclosure in Auctions and the Handicap Auction , 2007 .

[12]  David H. Reiley,et al.  Does Retail Advertising Work? Measuring the Effects of Advertising on Sales Via a Controlled Experiment on Yahoo! , 2008 .

[13]  L. Elisa Celis,et al.  Buy-it-now or take-a-chance: a simple sequential screening mechanism , 2011, WWW.

[14]  Jon Feldman,et al.  Yield optimization of display advertising with ad exchange , 2011, EC '11.

[15]  Assaf J. Zeevi,et al.  Revenue maximization through "smart" inventory management in reservation-based online advertising , 2010, PERV.

[16]  Dirk Bergemann,et al.  Targeting in Advertising Markets: Implications for Offline vs. Online Media , 2010 .

[17]  Jon Feldman,et al.  Online allocation of display ads with smooth delivery , 2012, KDD.

[18]  R. McAfee,et al.  The Design of Advertising Exchanges , 2011 .

[19]  A. Ullah,et al.  Nonparametric Econometrics: Semiparametric and Nonparametric Estimation of Simultaneous Equation Models , 1999 .

[20]  S. Athey,et al.  A Structural Model of Sponsored Search Advertising Auctions , 2011 .

[21]  Arpita Ghosh,et al.  Computing Optimal Bundles for Sponsored Search , 2007, WINE.

[22]  John Wooders,et al.  Auctions with a buy price , 2004 .

[23]  E. Maskin,et al.  Optimal Auctions with Risk Averse Buyers , 1984 .

[24]  G. Weintraub,et al.  Auctions for online display advertising exchanges: approximations and design , 2013, EC '13.

[25]  Michael Ostrovsky,et al.  Reserve Prices in Internet Advertising Auctions: A Field Experiment , 2009, Journal of Political Economy.

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

[27]  Janet L. Yellen,et al.  Commodity Bundling and the Burden of Monopoly , 1976 .

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

[29]  Dirk Bergemann,et al.  Information Structures in Optimal Auctions , 2001, J. Econ. Theory.

[30]  Lisa N. Takeyama,et al.  Buy prices in online auctions: irrationality on the internet? , 2001 .

[31]  M. Peitz,et al.  A Theory of Clearance Sales , 2007 .

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

[33]  Garrett A. Johnson The Impact of Privacy Policy on the Auction Market for Online Display Advertising , 2013 .

[34]  Alan T. Sorensen,et al.  Bundle-Size Pricing as an Approximation to Mixed Bundling , 2011 .

[35]  Rainer Storn,et al.  Differential Evolution – A Simple and Efficient Heuristic for global Optimization over Continuous Spaces , 1997, J. Glob. Optim..

[36]  Avi Goldfarb,et al.  Online Display Advertising: Targeting and Obtrusiveness , 2011, Mark. Sci..

[37]  J. Rochet,et al.  Ironing, Sweeping, and Multidimensional Screening , 1998 .

[38]  Philip A. Haile,et al.  Inference with an Incomplete Model of English Auctions , 2000, Journal of Political Economy.

[39]  Noam Nisan,et al.  Multi-unit Auctions with Budget Limits , 2008, 2008 49th Annual IEEE Symposium on Foundations of Computer Science.

[40]  D. Sappington,et al.  Supplying Information to Facilitate Price Discrimination , 1994 .

[41]  Avi Goldfarb,et al.  Privacy Regulation and Online Advertising , 2010, Manag. Sci..

[42]  E. Maskin,et al.  Monopoly with Incomplete Information , 1984 .

[43]  Sergei Vassilvitskii,et al.  Maximally representative allocations for guaranteed delivery advertising campaigns , 2013 .

[44]  M. Whinston,et al.  Multiproduct Monopoly, Commodity Bundling, and Correlation of Values , 1989 .

[45]  Jeremy I. Bulow,et al.  Auctions versus Negotiations , 1996 .

[46]  Matthew Backus,et al.  A Demand System for a Dynamic Auction Market with Directed Search , 2012 .

[47]  Paul R. Milgrom,et al.  A theory of auctions and competitive bidding , 1982 .

[48]  D. Bergemann,et al.  TARGETING IN ADVERTISING MARKETS: IMPLICATIONS FOR OFFLINE VS. ONLINE MEDIA By , 2010 .

[49]  Jennifer Wortman Vaughan,et al.  Sponsored Search with Contexts , 2007, WINE.

[50]  S. Muthukrishnan,et al.  Ad Exchanges: Research Issues , 2009, WINE.

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

[52]  D. Bergemann,et al.  Dynamic Auctions: A Survey , 2010 .

[53]  Andrzej Skrzypacz,et al.  Revenue Management with Forward-Looking Buyers , 2016, Journal of Political Economy.

[54]  Paul Milgrom,et al.  Online Advertising: Heterogeneity and Conflation in Market Design , 2010 .

[55]  Sham M. Kakade,et al.  Optimal Dynamic Mechanism Design and the Virtual Pivot Mechanism , 2013, Oper. Res..