IDEAS home Printed from https://ideas.repec.org/a/inm/ormksc/v32y2013i6p892-912.html
   My bibliography  Save this article

Correcting Audience Externalities in Television Advertising

Author

Listed:
  • Kenneth C. Wilbur

    (Rady School of Management, University of California, San Diego, California 92093)

  • Linli Xu

    (Carlson School of Management, University of Minnesota, Minneapolis, Minnesota 55455)

  • David Kempe

    (Department of Computer Science, University of Southern California, Los Angeles, California 90033)

Abstract

When a television advertisement causes viewers to switch channels, it reduces the audience available to subsequent advertisers. This audience loss is not reflected in the advertisement price, resulting in an audience externality. The present article analyzes the television network's problem of how to select, order, and price advertisements in a break of endogenous length in order to correct audience externalities. It proposes the Audience Value Maximization Algorithm (AVMA), which considers many possible advertisement orderings within a dynamic programming framework with a strategy-proof pricing mechanism. Two data sets are used to estimate heterogeneity in viewer-switching probabilities and advertiser willingness-to-pay parameters in order to evaluate the algorithm's performance. A series of simulations shows that AVMA typically maximizes audience value to advertisers, increases network revenue relative to several alternatives, and runs quickly enough to implement.

Suggested Citation

  • Kenneth C. Wilbur & Linli Xu & David Kempe, 2013. "Correcting Audience Externalities in Television Advertising," Marketing Science, INFORMS, vol. 32(6), pages 892-912, November.
  • Handle: RePEc:inm:ormksc:v:32:y:2013:i:6:p:892-912
    DOI: 10.1287/mksc.2013.0807
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/mksc.2013.0807
    Download Restriction: no

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

    References listed on IDEAS

    as
    1. Susan Athey & Glenn Ellison, 2011. "Position Auctions with Consumer Search," The Quarterly Journal of Economics, President and Fellows of Harvard College, vol. 126(3), pages 1213-1270.
    2. Jehiel, Philippe & Moldovanu, Benny & Stacchetti, Ennio, 1996. "How (Not) to Sell Nuclear Weapons," American Economic Review, American Economic Association, vol. 86(4), pages 814-829, September.
    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. Goettler, Ronald L & Shachar, Ron, 2001. "Spatial Competition in the Network Television Industry," RAND Journal of Economics, The RAND Corporation, vol. 32(4), pages 624-656, Winter.
    5. Thales S. Teixeira & Michel Wedel & Rik Pieters, 2010. "Moment-to-Moment Optimal Branding in TV Commercials: Preventing Avoidance by Pulsing," Marketing Science, INFORMS, vol. 29(5), pages 783-804, 09-10.
    6. William Vickrey, 1961. "Counterspeculation, Auctions, And Competitive Sealed Tenders," Journal of Finance, American Finance Association, vol. 16(1), pages 8-37, March.
    7. Kenneth C. Wilbur, 2008. "A Two-Sided, Empirical Model of Television Advertising and Viewing Markets," Marketing Science, INFORMS, vol. 27(3), pages 356-378, 05-06.
    8. Burke, Raymond R & Srull, Thomas K, 1988. "Competitive Interference and Consumer Memory for Advertising," Journal of Consumer Research, Journal of Consumer Research Inc., vol. 15(1), pages 55-68, June.
    9. Roland T. Rust & Mark I. Alpert, 1984. "An Audience Flow Model of Television Viewing Choice," Marketing Science, INFORMS, vol. 3(2), pages 113-124.
    10. Brown, Tom J & Rothschild, Michael L, 1993. "Reassessing the Impact of Television Advertising Clutter," Journal of Consumer Research, Journal of Consumer Research Inc., vol. 20(1), pages 138-146, June.
    11. Roger B. Myerson, 1981. "Optimal Auction Design," Mathematics of Operations Research, INFORMS, vol. 6(1), pages 58-73, February.
    12. S.J. Rassenti & V.L. Smith & R.L. Bulfin, 1982. "A Combinatorial Auction Mechanism for Airport Time Slot Allocation," Bell Journal of Economics, The RAND Corporation, vol. 13(2), pages 402-417, Autumn.
    13. Edward Clarke, 1971. "Multipart pricing of public goods," Public Choice, Springer, vol. 11(1), pages 17-33, September.
    14. Groves, Theodore, 1973. "Incentives in Teams," Econometrica, Econometric Society, vol. 41(4), pages 617-631, July.
    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. 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.
    2. Committee, Nobel Prize, 2020. "Improvements to auction theory and inventions of new auction formats," Nobel Prize in Economics documents 2020-2, Nobel Prize Committee.
    3. Ronald M. Harstad & Aleksandar Saša Pekeč, 2008. "Relevance to Practice and Auction Theory: A Memorial Essay for Michael Rothkopf," Interfaces, INFORMS, vol. 38(5), pages 367-380, October.
    4. Yan Chen & Peter Cramton & John A. List & Axel Ockenfels, 2021. "Market Design, Human Behavior, and Management," Management Science, INFORMS, vol. 67(9), pages 5317-5348, September.
    5. Scott Duke Kominers & Alexander Teytelboym & Vincent P Crawford, 2017. "An invitation to market design," Oxford Review of Economic Policy, Oxford University Press and Oxford Review of Economic Policy Limited, vol. 33(4), pages 541-571.
    6. Song, Yangwei, 2018. "Efficient Implementation with Interdependent Valuations and Maxmin Agents," Rationality and Competition Discussion Paper Series 92, CRC TRR 190 Rationality and Competition.
    7. Philippe Jehiel & Laurent Lamy, 2018. "A Mechanism Design Approach to the Tiebout Hypothesis," Journal of Political Economy, University of Chicago Press, vol. 126(2), pages 735-760.
    8. Bierbrauer, Felix & Netzer, Nick, 2016. "Mechanism design and intentions," Journal of Economic Theory, Elsevier, vol. 163(C), pages 557-603.
    9. Jeong, Seungwon (Eugene) & Lee, Joosung, 2024. "The groupwise-pivotal referral auction: Core-selecting referral strategy-proof mechanism," Games and Economic Behavior, Elsevier, vol. 143(C), pages 191-203.
    10. 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.
    11. Carbajal, Juan Carlos & Ely, Jeffrey C., 2013. "Mechanism design without revenue equivalence," Journal of Economic Theory, Elsevier, vol. 148(1), pages 104-133.
    12. Seiji Takanashi & Takehiro Kawasaki & Taiki Todo & Makoto Yokoo, 2019. "Efficiency in Truthful Auctions via a Social Network," Papers 1904.12422, arXiv.org.
    13. Yukun Cheng & Xiaotie Deng & Dominik Scheder, 2022. "Recent studies of agent incentives in internet resource allocation and pricing," Annals of Operations Research, Springer, vol. 314(1), pages 49-76, July.
    14. Devanur, Nikhil R. & Hartline, Jason D. & Yan, Qiqi, 2015. "Envy freedom and prior-free mechanism design," Journal of Economic Theory, Elsevier, vol. 156(C), pages 103-143.
    15. Kaplan, Todd R. & Zamir, Shmuel, 2015. "Advances in Auctions," Handbook of Game Theory with Economic Applications,, Elsevier.
    16. Hemant K. Bhargava & Gergely Csapó & Rudolf Müller, 2020. "On Optimal Auctions for Mixing Exclusive and Shared Matching in Platforms," Management Science, INFORMS, vol. 66(6), pages 2653-2676, June.
    17. Yan, Haomin, 2021. "Position auctions with multi-unit demands," Games and Economic Behavior, Elsevier, vol. 127(C), pages 179-193.
    18. Jawad Abrache & Teodor Crainic & Michel Gendreau & Monia Rekik, 2007. "Combinatorial auctions," Annals of Operations Research, Springer, vol. 153(1), pages 131-164, September.
    19. Yi Zhu & Kenneth C. Wilbur, 2011. "Hybrid Advertising Auctions," Marketing Science, INFORMS, vol. 30(2), pages 249-273, 03-04.
    20. Amin Sayedi & Kinshuk Jerath & Marjan Baghaie, 2018. "Exclusive Placement in Online Advertising," Marketing Science, INFORMS, vol. 37(6), pages 970-986, November.

    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:ormksc:v:32:y:2013:i:6:p:892-912. 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: 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.