 Computational analysis of perfect-information position auctionsDavid R.M. Thompson and Kevin Leyton-Brown Games and Economic Behavior, 2017, vol. 102, issue C, 583-623 Abstract: After experimentation with other designs, major search engines converged on weighted, generalized second-price auctions (wGSPs) for selling keyword advertisements. Theoretical analysis is still not able to settle the question of why they found this design preferable to other alternatives. We approach this question in a new way, adopting an analytical paradigm we dub “computational mechanism analysis.” Specifically, we sample position auction games from a given distribution, encode them in a computationally efficient representation language, compute their Nash equilibria, and calculate economic quantities of interest. We considered seven widely studied valuation models from the literature and three position auction variants. We found that wGSP consistently showed the best ads of any position auction, measured both by social welfare and expected number of clicks. In contrast, we found that revenue was extremely variable across auction mechanisms and was highly sensitive to equilibrium selection, the preference model, and the valuation distribution. Keywords: Computational mechanism analysis; Position auctions; Sponsored search; Compact game representations (search for similar items in EconPapers) Downloads: (external link) Related works: Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text Persistent link: https://EconPapers.repec.org/RePEc:eee:gamebe:v:102:y:2017:i:c:p:583-623 DOI: 10.1016/j.geb.2017.02.009 Access Statistics for this article Games and Economic Behavior is currently edited by E. Kalai More articles in Games and Economic Behavior from Elsevier |
Is your work missing from RePEc? Here is how to contribute.
Questions or problems? Check the EconPapers FAQ or send mail to .
EconPapers is hosted by the
School of Business at Örebro University.