IDEAS home Printed from https://ideas.repec.org/a/inm/ormsom/v25y2023i2p489-507.html
   My bibliography  Save this article

A Markov Decision Model for Managing Display-Advertising Campaigns

Author

Listed:
  • Narendra Agrawal

    (Information Systems & Analytics Department, Leavey School of Business, Santa Clara University, Santa Clara, California 95053)

  • Sami Najafi-Asadolahi

    (Information Systems & Analytics Department, Leavey School of Business, Santa Clara University, Santa Clara, California 95053)

  • Stephen A. Smith

    (Information Systems & Analytics Department, Leavey School of Business, Santa Clara University, Santa Clara, California 95053)

Abstract

Problem definition : Managers in ad agencies are responsible for delivering digital ads to viewers on behalf of advertisers, subject to the terms specified in the ad campaigns. They need to develop bidding policies to obtain viewers on an ad exchange and allocate them to the campaigns to maximize the agency’s profits, subject to the goals of the ad campaigns. Academic/practical relevance : Determining a rigorous solution methodology is complicated by uncertainties in the arrival rates of viewers and campaigns, as well as uncertainty in the outcomes of bids on the ad exchange. In practice, ad hoc strategies are often deployed. Our methodology jointly determines optimal bidding and viewer-allocation strategies and obtains insights about the characteristics of the optimal policies. Methodology : New ad campaigns and viewers are treated as Poisson arrivals, and the resulting model is a Markov decision process, where the state of the system is the number of undelivered impressions in queue for each campaign type in each period. We develop solution methods for bid optimization and viewer allocation and perform a sensitivity analysis with respect to the key problem parameters. Results : We solve for the optimal dynamic, state-dependent bidding and allocation policies as a function of the number of ad impressions in queue, for both the finite horizon and steady-state cases. We show that the resulting optimization problems are strictly concave in the decision variables and develop and evaluate a heuristic method that can be applied to large problems. Managerial implications : Numerical analysis of our heuristic solution shows that its errors are generally small and that the optimal dynamic, state-dependent bidding policies obtained by our model are significantly better than optimal static policies. Our proposed approach is managerially attractive because it is easy to implement in practice. We identify the capacity of the impression queue as an important managerial control lever and show that it can be more effective than using higher bids to reduce delay penalties. We quantify potential operational benefits from the consolidation of ad campaigns, as well as merging ad exchanges.

Suggested Citation

  • Narendra Agrawal & Sami Najafi-Asadolahi & Stephen A. Smith, 2023. "A Markov Decision Model for Managing Display-Advertising Campaigns," Manufacturing & Service Operations Management, INFORMS, vol. 25(2), pages 489-507, March.
  • Handle: RePEc:inm:ormsom:v:25:y:2023:i:2:p:489-507
    DOI: 10.1287/msom.2022.1142
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/msom.2022.1142
    Download Restriction: no

    File URL: https://libkey.io/10.1287/msom.2022.1142?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
    ---><---

    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:inm:ormsom:v:25:y:2023:i:2:p:489-507. 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.

    We have no bibliographic references for this item. You can help adding them by using 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: Chris Asher (email available below). General contact details of provider: https://edirc.repec.org/data/inforea.html .

    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.