IDEAS home Printed from https://ideas.repec.org/a/spr/joecth/v55y2014i1p243-256.html
   My bibliography  Save this article

Pricing in position auctions and online advertising

Author

Listed:
  • M. Yenmez

Abstract

Can search engines increase revenues by changing their position auctions? In this paper, I analyze position auctions with general pricing rules to answer this question. In these auctions, there are several items that are commonly ranked by bidders with unit demand. I show that revenues remain the same for position auctions with regular pricing rules where the price for an item depends on the bids of agents who win lower-ranked items. In addition, all of the bidders have the same ex post payoffs. I also show that regularity is a necessary condition to get ex post payoff equivalence. Copyright Springer-Verlag Berlin Heidelberg 2014

Suggested Citation

  • M. Yenmez, 2014. "Pricing in position auctions and online advertising," Economic Theory, Springer;Society for the Advancement of Economic Theory (SAET), vol. 55(1), pages 243-256, January.
    • Handle: RePEc:spr:joecth:v:55:y:2014:i:1:p:243-256
    DOI: 10.1007/s00199-013-0748-0
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1007/s00199-013-0748-0
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1007/s00199-013-0748-0?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. Sandro Brusco & Giuseppe Lopomo, 2009. "Simultaneous ascending auctions with complementarities and known budget constraints," Economic Theory, Springer;Society for the Advancement of Economic Theory (SAET), vol. 38(1), pages 105-124, January.
    2. Benjamin Edelman & Michael Schwarz, 2010. "Optimal Auction Design and Equilibrium Selection in Sponsored Search Auctions," Harvard Business School Working Papers 10-054, Harvard Business School.
    3. Benjamin Edelman & Michael Ostrovsky & Michael Schwarz, 2007. "Internet Advertising and the Generalized Second-Price Auction: Selling Billions of Dollars Worth of Keywords," American Economic Review, American Economic Association, vol. 97(1), pages 242-259, March.
    4. Michael Ostrovsky & Michael Schwarz, 2023. "Reserve Prices in Internet Advertising Auctions: A Field Experiment," Journal of Political Economy, University of Chicago Press, vol. 131(12), pages 3352-3376.
    5. Mas-Colell, Andreu & Whinston, Michael D. & Green, Jerry R., 1995. "Microeconomic Theory," OUP Catalogue, Oxford University Press, number 9780195102680.
    6. Riley, John G & Samuelson, William F, 1981. "Optimal Auctions," American Economic Review, American Economic Association, vol. 71(3), pages 381-392, June.
    7. Varian, Hal R., 2007. "Position auctions," International Journal of Industrial Organization, Elsevier, vol. 25(6), pages 1163-1178, December.
    8. Robert Wilson, 1998. "Sequential equilibria of asymmetric ascending auctions: The case of log-normal distributions," Economic Theory, Springer;Society for the Advancement of Economic Theory (SAET), vol. 12(2), pages 433-440.
    9. Paul Milgrom & Ilya Segal, 2002. "Envelope Theorems for Arbitrary Choice Sets," Econometrica, Econometric Society, vol. 70(2), pages 583-601, March.
    10. Benjamin Edelman & Michael Schwarz, 2010. "Optimal Auction Design and Equilibrium Selection in Sponsored Search Auctions," American Economic Review, American Economic Association, vol. 100(2), pages 597-602, May.
    11. Lawrence Ausubel & Peter Cramton, 2004. "Vickrey auctions with reserve pricing," Economic Theory, Springer;Society for the Advancement of Economic Theory (SAET), vol. 23(3), pages 493-505, March.
    12. Gian Albano & Fabrizio Germano & Stefano Lovo, 2006. "Ascending auctions for multiple objects: the case for the Japanese design," Economic Theory, Springer;Society for the Advancement of Economic Theory (SAET), vol. 28(2), pages 331-355, June.
    13. M. Yenmez, 2015. "Incentive compatible market design with applications," International Journal of Game Theory, Springer;Game Theory Society, vol. 44(3), pages 543-569, August.
    14. Krishna, Vijay & Maenner, Eliot, 2001. "Convex Potentials with an Application to Mechanism Design," Econometrica, Econometric Society, vol. 69(4), pages 1113-1119, July.
    15. Roger B. Myerson, 1981. "Optimal Auction Design," Mathematics of Operations Research, INFORMS, vol. 6(1), pages 58-73, February.
    16. Hafalir, Isa E. & Ravi, R. & Sayedi, Amin, 2012. "A near Pareto optimal auction with budget constraints," Games and Economic Behavior, Elsevier, vol. 74(2), pages 699-708.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Patrick Hummel, 2018. "Hybrid mechanisms for Vickrey–Clarke–Groves and generalized second-price bids," International Journal of Game Theory, Springer;Game Theory Society, vol. 47(1), pages 331-350, March.
    2. Youngwoo Koh, 2013. "Keyword auctions with budget-constrained bidders," Review of Economic Design, Springer;Society for Economic Design, vol. 17(4), pages 307-321, December.
    3. Duan, Yongrui & Liu, Peng & Feng, Yixuan, 2022. "Pricing strategies of two-sided platforms considering privacy concerns," Journal of Retailing and Consumer Services, Elsevier, vol. 64(C).
    4. Hummel, Patrick, 2016. "Position auctions with dynamic resizing," International Journal of Industrial Organization, Elsevier, vol. 45(C), pages 38-46.
    5. Alison Watts, 2018. "Generalized Second Price Auctions over a Network," Games, MDPI, vol. 9(3), pages 1-11, September.
    6. Estrella Alonso & Joaquín Sánchez-Soriano & Juan Tejada, 2020. "Mixed Mechanisms for Auctioning Ranked Items," Mathematics, MDPI, vol. 8(12), pages 1-26, December.
    7. Yan, Haomin, 2021. "Position auctions with multi-unit demands," Games and Economic Behavior, Elsevier, vol. 127(C), pages 179-193.

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Hummel, Patrick, 2016. "Position auctions with dynamic resizing," International Journal of Industrial Organization, Elsevier, vol. 45(C), pages 38-46.
    2. Michael Ostrovsky & Michael Schwarz, 2023. "Reserve Prices in Internet Advertising Auctions: A Field Experiment," Journal of Political Economy, University of Chicago Press, vol. 131(12), pages 3352-3376.
    3. Nicolás Figueroa & Vasiliki Skreta, 2011. "Optimal allocation mechanisms with single-dimensional private information," Review of Economic Design, Springer;Society for Economic Design, vol. 15(3), pages 213-243, September.
    4. Kaplan, Todd R. & Zamir, Shmuel, 2015. "Advances in Auctions," Handbook of Game Theory with Economic Applications,, Elsevier.
    5. Yi Zhu & Kenneth C. Wilbur, 2011. "Hybrid Advertising Auctions," Marketing Science, INFORMS, vol. 30(2), pages 249-273, 03-04.
    6. Che, Yeon-Koo & Choi, Syngjoo & Kim, Jinwoo, 2017. "An experimental study of sponsored-search auctions," Games and Economic Behavior, Elsevier, vol. 102(C), pages 20-43.
    7. Renato Gomes, 2014. "Optimal auction design in two-sided markets," RAND Journal of Economics, RAND Corporation, vol. 45(2), pages 248-272, June.
    8. Mahsa Derakhshan & Negin Golrezaei & Renato Paes Leme, 2022. "Linear Program-Based Approximation for Personalized Reserve Prices," Management Science, INFORMS, vol. 68(3), pages 1849-1864, March.
    9. Avi Goldfarb, 2014. "What is Different About Online Advertising?," Review of Industrial Organization, Springer;The Industrial Organization Society, vol. 44(2), pages 115-129, March.
    10. W. Jason Choi & Amin Sayedi, 2019. "Learning in Online Advertising," Marketing Science, INFORMS, vol. 38(4), pages 584-608, July.
    11. Estrella Alonso & Joaquín Sánchez-Soriano & Juan Tejada, 2020. "Mixed Mechanisms for Auctioning Ranked Items," Mathematics, MDPI, vol. 8(12), pages 1-26, December.
    12. Caragiannis, Ioannis & Kaklamanis, Christos & Kanellopoulos, Panagiotis & Kyropoulou, Maria & Lucier, Brendan & Paes Leme, Renato & Tardos, Éva, 2015. "Bounding the inefficiency of outcomes in generalized second price auctions," Journal of Economic Theory, Elsevier, vol. 156(C), pages 343-388.
    13. Hitoshi Matsushima, 2018. "Optimal Deterministic Mechanism Design: Type-Independent Preference Orderings," The Japanese Economic Review, Springer, vol. 69(4), pages 363-373, December.
    14. Tomoya Kazumura & Debasis Mishra & Shigehiro Serizawa, 2017. "Strategy-proof multi-object auction design: Ex-post revenue maximization with no wastage," ISER Discussion Paper 1001, Institute of Social and Economic Research, Osaka University.
    15. Gomes, Renato & Sweeney, Kane, 2014. "Bayes–Nash equilibria of the generalized second-price auction," Games and Economic Behavior, Elsevier, vol. 86(C), pages 421-437.
    16. Burguet, Roberto & Caminal, Ramon & Ellman, Matthew, 2015. "In Google we trust?," International Journal of Industrial Organization, Elsevier, vol. 39(C), pages 44-55.
    17. L. Elisa Celis & Gregory Lewis & Markus Mobius & Hamid Nazerzadeh, 2014. "Buy-It-Now or Take-a-Chance: Price Discrimination Through Randomized Auctions," Management Science, INFORMS, vol. 60(12), pages 2927-2948, December.
    18. Hitoshi Matsushima, 2015. "Optimal Mechanism Design: Type-Independent Preference Orderings," CIRJE F-Series CIRJE-F-955, CIRJE, Faculty of Economics, University of Tokyo.
    19. Carbajal, Juan Carlos & Ely, Jeffrey C., 2013. "Mechanism design without revenue equivalence," Journal of Economic Theory, Elsevier, vol. 148(1), pages 104-133.
    20. Hitoshi Matsushima, 2015. "Optimal Mechanism Design: Type-Independent Preference Orderings (Published in the Japanese Economic Review 69 (4), 2018.)," CARF F-Series CARF-F-357, Center for Advanced Research in Finance, Faculty of Economics, The University of Tokyo.

    More about this item

    Keywords

    Position auctions; Online advertising; Multidimensional types; Ex post payoff equivalence; C71; C78;
    All these keywords.

    JEL classification:

    • C71 - Mathematical and Quantitative Methods - - Game Theory and Bargaining Theory - - - Cooperative Games
    • C78 - Mathematical and Quantitative Methods - - Game Theory and Bargaining Theory - - - Bargaining Theory; Matching Theory

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:joecth:v:55:y:2014:i:1:p:243-256. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.