Testing Incentive Compatibility in Display Ad Auctions

Consider a buyer participating in a repeated auction, such as those prevalent in display advertising. How would she test whether the auction is incentive compatible? To bid effectively, she is interested in whether the auction is single-shot incentive compatible---a pure second-price auction, with fixed reserve price---and also dynamically incentive compatible---her bids are not used to set future reserve prices. In this work we develop tests based on simple bid perturbations that a buyer can use to answer these questions, with a focus on dynamic incentive compatibility. There are many potential A/B testing setups that one could use, but we find that many natural experimental designs are, in fact, flawed. For instance, we show that additive perturbations can lead to paradoxical results, where higher bids lead to lower optimal reserve prices. We precisely characterize this phenomenon and show that reserve prices are only guaranteed to be monotone for distributions satisfying the Monotone Hazard Rate (MHR) property. The experimenter must also decide how to split traffic to apply systematic perturbations. It is tempting to have this split be randomized, but we demonstrate empirically that unless the perturbations are aligned with the partitions used by the seller to compute reserve prices, the results are guaranteed to be inconclusive. We validate our results with experiments on real display auction data and show that a buyer can quantify both single-shot and dynamic incentive compatibility even under realistic conditions where only the cost of the impression is observed (as opposed to the exact reserve price). We analyze the cost of running such experiments, exposing trade-offs between test accuracy, cost, and underlying market dynamics.

[1]  Itai Ashlagi,et al.  Sequential Mechanisms with Ex-post Participation Guarantees , 2016, EC.

[2]  Tim Roughgarden,et al.  Simple versus optimal mechanisms , 2009, EC '09.

[3]  Shuchi Chawla,et al.  The power of randomness in bayesian optimal mechanism design , 2010, EC '10.

[4]  David C. Parkes,et al.  Practical secrecy-preserving, verifiably correct and trustworthy auctions , 2006, ICEC '06.

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

[6]  David C. Parkes,et al.  Practical secrecy-preserving, verifiably correct and trustworthy auctions , 2006, ICEC '06.

[7]  Umar Syed,et al.  Learning Prices for Repeated Auctions with Strategic Buyers , 2013, NIPS.

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

[9]  Tim Roughgarden,et al.  Making the Most of Your Samples , 2014, EC.

[10]  Tim Roughgarden,et al.  Minimizing Regret with Multiple Reserves , 2016, EC.

[11]  Mehryar Mohri,et al.  Revenue Optimization against Strategic Buyers , 2015, NIPS.

[12]  Yuval Peres,et al.  Perfect Bayesian Equilibria in Repeated Sales , 2014, SODA.

[13]  Alexey Drutsa,et al.  Horizon-Independent Optimal Pricing in Repeated Auctions with Truthful and Strategic Buyers , 2017, WWW.

[14]  Tim Roughgarden,et al.  Revenue maximization with a single sample , 2015, Games Econ. Behav..

[15]  Richard Cole,et al.  The sample complexity of revenue maximization , 2014, STOC.

[16]  Yashodhan Kanoria,et al.  Incentive-Compatible Learning of Reserve Prices for Repeated Auctions , 2014, WINE.

[17]  Sergei Vassilvitskii,et al.  A Field Guide to Personalized Reserve Prices , 2016, WWW.

[18]  Renato Paes Leme,et al.  Dynamic Auctions with Bank Accounts , 2016, IJCAI.

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

[20]  Tim Roughgarden,et al.  The Pseudo-Dimension of Near-Optimal Auctions , 2015, NIPS 2015.

[21]  Renato Paes Leme,et al.  Dynamic Mechanisms with Martingale Utilities , 2017, EC.