IDEAS home Printed from https://ideas.repec.org/a/spr/jogath/v45y2016i4d10.1007_s00182-015-0501-y.html
   My bibliography  Save this article

Incentivizing advertiser networks to submit multiple bids

Author

Listed:
  • Patrick Hummel

    (Google Inc.)

  • R. Preston McAfee

    (Microsoft Corp.)

  • Sergei Vassilvitskii

    (Google Inc.)

Abstract

This paper illustrates a method for making side payments to advertiser networks that creates an incentive for the advertiser networks to submit the second-highest bids they received to an ad exchange and simultaneously ensures that the publishers will make more money on average in the short run as a result of adopting this scheme. We also illustrate how this payment scheme affects publisher payoffs in the long run after advertisers have a chance to modify their strategies in response to the changed incentives of the mechanism.

Suggested Citation

  • Patrick Hummel & R. Preston McAfee & Sergei Vassilvitskii, 2016. "Incentivizing advertiser networks to submit multiple bids," International Journal of Game Theory, Springer;Game Theory Society, vol. 45(4), pages 1031-1052, November.
    • Handle: RePEc:spr:jogath:v:45:y:2016:i:4:d:10.1007_s00182-015-0501-y
    DOI: 10.1007/s00182-015-0501-y
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s00182-015-0501-y
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.
    File URL: https://libkey.io/10.1007/s00182-015-0501-y?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. Santiago R. Balseiro & Omar Besbes & Gabriel Y. Weintraub, 2015. "Repeated Auctions with Budgets in Ad Exchanges: Approximations and Design," Management Science, INFORMS, vol. 61(4), pages 864-884, April.
    2. Arieh Gavious & Yizhaq Minchuk, 2014. "Ranking asymmetric auctions," International Journal of Game Theory, Springer;Game Theory Society, vol. 43(2), pages 369-393, May.
    3. Vlad Mares & Jeroen Swinkels, 2014. "Comparing first and second price auctions with asymmetric bidders," International Journal of Game Theory, Springer;Game Theory Society, vol. 43(3), pages 487-514, August.
    4. Roger B. Myerson, 1981. "Optimal Auction Design," Mathematics of Operations Research, INFORMS, vol. 6(1), pages 58-73, February.
    5. Santiago R. Balseiro & Jon Feldman & Vahab Mirrokni & S. Muthukrishnan, 2014. "Yield Optimization of Display Advertising with Ad Exchange," Management Science, INFORMS, vol. 60(12), pages 2886-2907, December.
    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. Gagan Aggarwal & Kshipra Bhawalkar & Guru Guruganesh & Andres Perlroth, 2021. "Maximizing revenue in the presence of intermediaries," Papers 2111.10472, arXiv.org.

    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. Sameer Mehta & Milind Dawande & Ganesh Janakiraman & Vijay Mookerjee, 2020. "Sustaining a Good Impression: Mechanisms for Selling Partitioned Impressions at Ad Exchanges," Information Systems Research, INFORMS, vol. 31(1), pages 126-147, March.
    2. Hana Choi & Carl F. Mela & Santiago R. Balseiro & Adam Leary, 2020. "Online Display Advertising Markets: A Literature Review and Future Directions," Information Systems Research, INFORMS, vol. 31(2), pages 556-575, June.
    3. Ilan Lobel, 2021. "Revenue Management and the Rise of the Algorithmic Economy," Management Science, INFORMS, vol. 67(9), pages 5389-5398, September.
    4. Santiago R. Balseiro & Ozan Candogan & Huseyin Gurkan, 2021. "Multistage Intermediation in Display Advertising," Manufacturing & Service Operations Management, INFORMS, vol. 23(3), pages 714-730, May.
    5. Ying-Ju Chen, 2017. "Optimal Dynamic Auctions for Display Advertising," Operations Research, INFORMS, vol. 65(4), pages 897-913, August.
    6. 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.
    7. Jason Rhuggenaath & Alp Akcay & Yingqian Zhang & Uzay Kaymak, 2022. "Setting Reserve Prices in Second-Price Auctions with Unobserved Bids," INFORMS Journal on Computing, INFORMS, vol. 34(6), pages 2950-2967, November.
    8. W. Jason Choi & Amin Sayedi, 2019. "Learning in Online Advertising," Marketing Science, INFORMS, vol. 38(4), pages 584-608, July.
    9. Santiago R. Balseiro & Yonatan Gur, 2019. "Learning in Repeated Auctions with Budgets: Regret Minimization and Equilibrium," Management Science, INFORMS, vol. 65(9), pages 3952-3968, September.
    10. Miguel A. Lejeune & John Turner, 2019. "Planning Online Advertising Using Gini Indices," Operations Research, INFORMS, vol. 67(5), pages 1222-1245, September.
    11. Shumpei Goke & Gabriel Y. Weintraub & Ralph Mastromonaco & Sam Seljan, 2021. "Bidders' Responses to Auction Format Change in Internet Display Advertising Auctions," Papers 2110.13814, arXiv.org, revised Jan 2022.
    12. Zikun Ye & Dennis J. Zhang & Heng Zhang & Renyu Zhang & Xin Chen & Zhiwei Xu, 2023. "Cold Start to Improve Market Thickness on Online Advertising Platforms: Data-Driven Algorithms and Field Experiments," Management Science, INFORMS, vol. 69(7), pages 3838-3860, July.
    13. Kotowski, Maciej H., 2020. "First-price auctions with budget constraints," Theoretical Economics, Econometric Society, vol. 15(1), January.
    14. Santiago R. Balseiro & Ozan Candogan, 2017. "Optimal Contracts for Intermediaries in Online Advertising," Operations Research, INFORMS, vol. 65(4), pages 878-896, August.
    15. Radha Mookerjee & Subodha Kumar & Vijay S. Mookerjee, 2017. "Optimizing Performance-Based Internet Advertisement Campaigns," Operations Research, INFORMS, vol. 65(1), pages 38-54, February.
    16. Zhaohua Chen & Mingwei Yang & Chang Wang & Jicheng Li & Zheng Cai & Yukun Ren & Zhihua Zhu & Xiaotie Deng, 2022. "Budget-Constrained Auctions with Unassured Priors: Strategic Equivalence and Structural Properties," Papers 2203.16816, arXiv.org, revised Feb 2024.
    17. Santiago R. Balseiro & Omar Besbes & Gabriel Y. Weintraub, 2015. "Repeated Auctions with Budgets in Ad Exchanges: Approximations and Design," Management Science, INFORMS, vol. 61(4), pages 864-884, April.
    18. Doni Nicola & Menicucci Domenico, 2013. "Revenue Comparison in Asymmetric Auctions with Discrete Valuations," The B.E. Journal of Theoretical Economics, De Gruyter, vol. 13(1), pages 1-33, September.
    19. Javier Castro & Rosa Espínola & Inmaculada Gutiérrez & Daniel Gómez, 2023. "Auctions: A New Method for Selling Objects with Bimodal Density Functions," Computational Economics, Springer;Society for Computational Economics, vol. 61(4), pages 1707-1743, April.
    20. Shinjini Pandey & Goutam Dutta & Harit Joshi, 2017. "Survey on Revenue Management in Media and Broadcasting," Interfaces, INFORMS, vol. 47(3), pages 195-213, June.

    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:jogath:v:45:y:2016:i:4:d:10.1007_s00182-015-0501-y. 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.