IDEAS home Printed from https://ideas.repec.org/p/arx/papers/2111.08311.html
   My bibliography  Save this paper

Optimal bidding strategies for digital advertising

Author

Listed:
  • M'ed'eric Motte

    (LPSM)

  • Huy^en Pham

    (LPSM)

Abstract

With the emergence of new online channels and information technology, digital advertising tends to substitute more and more to traditional advertising by offering the opportunity to companies to target the consumers/users that are really interested by their products or services. We introduce a novel framework for the study of optimal bidding strategies associated to different types of advertising, namely, commercial advertising for triggering purchases or subscriptions, and social marketing for alerting population about unhealthy behaviours (anti-drug, vaccination, road-safety campaigns). Our continuoustime models are based on a common framework encoding users online behaviours via their web-browsing at random times, and the targeted advertising auction mechanism widely used on Internet, the objective being to efficiently diffuse advertising information by means of digital channels. Our main results are to provide semi-explicit formulas for the optimal value and bidding policy for each of these problems. We show some sensitivity properties of the solution with respect to model parameters, and analyse how the different sources of digital information accessible to users including the social interactions affect the optimal bid for advertising auctions. We also study how to efficiently combine targeted advertising and non-targeted advertising mechanisms. Finally, some classes of examples with fully explicit formulas are derived.

Suggested Citation

  • M'ed'eric Motte & Huy^en Pham, 2021. "Optimal bidding strategies for digital advertising," Papers 2111.08311, arXiv.org.
  • Handle: RePEc:arx:papers:2111.08311
    as

    Download full text from publisher

    File URL: http://arxiv.org/pdf/2111.08311
    File Function: Latest version
    Download Restriction: no
    ---><---

    References listed on IDEAS

    as
    1. Pui Chan Lon & Mihail Zervos, 2011. "A Model for Optimally Advertising and Launching a Product," Mathematics of Operations Research, INFORMS, vol. 36(2), pages 363-376, May.
    2. 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.
    3. F. Gozzi & C. Marinelli & S. Savin, 2009. "On Controlled Linear Diffusions with Delay in a Model of Optimal Advertising under Uncertainty with Memory Effects," Journal of Optimization Theory and Applications, Springer, vol. 142(2), pages 291-321, August.
    4. Daron Acemoglu & Asuman Ozdaglar, 2011. "Opinion Dynamics and Learning in Social Networks," Dynamic Games and Applications, Springer, vol. 1(1), pages 3-49, March.
    5. William Vickrey, 1961. "Counterspeculation, Auctions, And Competitive Sealed Tenders," Journal of Finance, American Finance Association, vol. 16(1), pages 8-37, March.
    6. Gustav Feichtinger & Richard F. Hartl & Suresh P. Sethi, 1994. "Dynamic Optimal Control Models in Advertising: Recent Developments," Management Science, INFORMS, vol. 40(2), pages 195-226, February.
    7. Jonathan Levin & Paul Milgrom, 2010. "Online Advertising: Heterogeneity and Conflation in Market Design," American Economic Review, American Economic Association, vol. 100(2), pages 603-607, May.
    8. M. L. Vidale & H. B. Wolfe, 1957. "An Operations-Research Study of Sales Response to Advertising," Operations Research, INFORMS, vol. 5(3), pages 370-381, June.
    9. 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.
    Full references (including those not matched with items on IDEAS)

    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. Médéric Motte & Huyên Pham, 2021. "Optimal bidding strategies for digital advertising," Working Papers hal-03429785, HAL.
    2. Huang, Jian & Leng, Mingming & Liang, Liping, 2012. "Recent developments in dynamic advertising research," European Journal of Operational Research, Elsevier, vol. 220(3), pages 591-609.
    3. Veronica Marotta & Yue Wu & Kaifu Zhang & Alessandro Acquisti, 2022. "The Welfare Impact of Targeted Advertising Technologies," Information Systems Research, INFORMS, vol. 33(1), pages 131-151, March.
    4. Thomas W. Frick & Rodrigo Belo & Rahul Telang, 2023. "Incentive Misalignments in Programmatic Advertising: Evidence from a Randomized Field Experiment," Management Science, INFORMS, vol. 69(3), pages 1665-1686, March.
    5. Frank Kelly & Peter Key & Neil Walton, 2016. "Efficient Advert Assignment," Operations Research, INFORMS, vol. 64(4), pages 822-837, August.
    6. Prasad A. Naik & Murali K. Mantrala & Alan G. Sawyer, 1998. "Planning Media Schedules in the Presence of Dynamic Advertising Quality," Marketing Science, INFORMS, vol. 17(3), pages 214-235.
    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. Luca Lambertini, 2007. "Dynamic Spatial Monopoly with Product Development," Spatial Economic Analysis, Taylor & Francis Journals, vol. 2(2), pages 157-166.
    9. H. Dharma Kwon & Hongzhong Zhang, 2015. "Game of Singular Stochastic Control and Strategic Exit," Mathematics of Operations Research, INFORMS, vol. 40(4), pages 869-887, October.
    10. L. Colombo & L. Lambertini, 2003. "Dynamic Advertising Under Vertical Product Differentiation," Journal of Optimization Theory and Applications, Springer, vol. 119(2), pages 261-280, November.
    11. Abraham, Ittai & Athey, Susan & Babaioff, Moshe & Grubb, Michael D., 2020. "Peaches, lemons, and cookies: Designing auction markets with dispersed information," Games and Economic Behavior, Elsevier, vol. 124(C), pages 454-477.
    12. F. Gozzi & C. Marinelli & S. Savin, 2009. "On Controlled Linear Diffusions with Delay in a Model of Optimal Advertising under Uncertainty with Memory Effects," Journal of Optimization Theory and Applications, Springer, vol. 142(2), pages 291-321, August.
    13. Carl F. Mela & Jason M. T. Roos & Tulio Sousa, 2023. "Advertiser Learning in Direct Advertising Markets," Papers 2307.07015, arXiv.org.
    14. Fabbri Giorgio & Federico Salvatore, 2014. "On the Infinite-Dimensional Representation of Stochastic Controlled Systems with Delayed Control in the Diffusion Term," Mathematical Economics Letters, De Gruyter, vol. 2(3-4), pages 1-11, November.
    15. Frédéric Zumer & Jacques Le Cacheux & Marc Flandreau, 1998. "Stability without a pact? Lessons from the European Gold Standard, 1880-1913," Sciences Po publications n°98-01, Sciences Po.
    16. Fabbri, Giorgio, 2017. "International borrowing without commitment and informational lags: Choice under uncertainty," Journal of Mathematical Economics, Elsevier, vol. 68(C), pages 103-114.
    17. Luzon, Yossi & Pinchover, Rotem & Khmelnitsky, Eugene, 2022. "Dynamic budget allocation for social media advertising campaigns: optimization and learning," European Journal of Operational Research, Elsevier, vol. 299(1), pages 223-234.
    18. Bykadorov, Igor & Ellero, Andrea & Moretti, Elena & Vianello, Silvia, 2009. "The role of retailer's performance in optimal wholesale price discount policies," European Journal of Operational Research, Elsevier, vol. 194(2), pages 538-550, April.
    19. Farzaneh Farhadi & Hamidreza Tavafoghi & Demosthenis Teneketzis & S. Jamaloddin Golestani, 2019. "An Efficient Dynamic Allocation Mechanism for Security in Networks of Interdependent Strategic Agents," Dynamic Games and Applications, Springer, vol. 9(4), pages 914-941, December.
    20. 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.

    More about this item

    NEP fields

    This paper has been announced in the following NEP Reports:

    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:arx:papers:2111.08311. 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: arXiv administrators (email available below). General contact details of provider: http://arxiv.org/ .

    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.