IDEAS home Printed from https://ideas.repec.org/a/eee/joinma/v48y2019icp120-133.html

Modeling Advertisers' Willingness to Pay in TV Commercial Slot Auctions

Author

Listed:
  • Shi, Yang
  • Zhao, Ying

Abstract

Auctions are receiving increasing attention from both practitioners and researchers in the TV advertising market. This paper studies advertisers' willingness to pay (WTP) in Hong Kong television commercial slot auctions, defined as overlapped, multiple-winner auctions with discrete, ascending, semi-sealed bids. We specify advertisers' WTP as a parametric function of their valuations of slot-specific attributes and the valuations that depend on the context of the focal auction and on the competition from other auctions of similar commercial slots. We extend the two “no-regret” bidding principles (first proposed by Haile and Tamer 2003) to obtain informative boundary conditions for asymptotical identification. The estimation results suggest that advertisers' WTP increases with the TV rating of the program in which the advertisement is embedded and decreases with the bidder's bidding experience and the number of similar slot options available. The WTP also depends on the number of bidders classified into the same product category, as two directly competing advertisers are not allowed to advertise in the same commercial break. In the current practice, advertisers submit discrete bids using price levels set by the TV station. Based on the recovered bidder's WTP, we investigate how the TV station can set adjacent price levels and examine the resulting revenue implications.

Suggested Citation

  • Shi, Yang & Zhao, Ying, 2019. "Modeling Advertisers' Willingness to Pay in TV Commercial Slot Auctions," Journal of Interactive Marketing, Elsevier, vol. 48(C), pages 120-133.
  • Handle: RePEc:eee:joinma:v:48:y:2019:i:c:p:120-133
    DOI: 10.1016/j.intmar.2019.05.005
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S1094996819300751
    Download Restriction: Full text for ScienceDirect subscribers only

    File URL: https://libkey.io/10.1016/j.intmar.2019.05.005?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

    for a different version of it.

    References listed on IDEAS

    as
    1. Edward Clarke, 1971. "Multipart pricing of public goods," Public Choice, Springer, vol. 11(1), pages 17-33, September.
    2. Kenneth C. Wilbur & Linli Xu & David Kempe, 2013. "Correcting Audience Externalities in Television Advertising," Marketing Science, INFORMS, vol. 32(6), pages 892-912, November.
    3. Kannan Srinivasan & Xin Wang, 2010. "Commentary--Bidders' Experience and Learning in Online Auctions: Issues and Implications," Marketing Science, INFORMS, vol. 29(6), pages 988-993, 11-12.
    4. Tanjim Hossain, 2008. "Learning by bidding," RAND Journal of Economics, RAND Corporation, vol. 39(2), pages 509-529, June.
    5. Srinivas Bollapragada & Michael R. Bussieck & Suman Mallik, 2004. "Scheduling Commercial Videotapes in Broadcast Television," Operations Research, INFORMS, vol. 52(5), pages 679-689, October.
    6. Philip A. Haile & Elie Tamer, 2003. "Inference with an Incomplete Model of English Auctions," Journal of Political Economy, University of Chicago Press, vol. 111(1), pages 1-51, February.
    7. J. Scott Long & Jeremy Freese, 2006. "Regression Models for Categorical Dependent Variables using Stata, 2nd Edition," Stata Press books, StataCorp LLC, edition 2, number long2, March.
    8. Bajari, Patrick & Hortacsu, Ali, 2003. "The Winner's Curse, Reserve Prices, and Endogenous Entry: Empirical Insights from eBay Auctions," RAND Journal of Economics, The RAND Corporation, vol. 34(2), pages 329-355, Summer.
    9. Paulo B. Goes & Gilbert G. Karuga & Arvind K. Tripathi, 2010. "Understanding Willingness-to-Pay Formation of Repeat Bidders in Sequential Online Auctions," Information Systems Research, INFORMS, vol. 21(4), pages 907-924, December.
    10. Bharat N. Anand & Ron Shachar, 2011. "Advertising, the matchmaker," RAND Journal of Economics, RAND Corporation, vol. 42(2), pages 205-245, June.
    11. Srinivas Bollapragada & Hong Cheng & Mary Phillips & Marc Garbiras & Michael Scholes & Tim Gibbs & Mark Humphreville, 2002. "NBC's Optimization Systems Increase Revenues and Productivity," Interfaces, INFORMS, vol. 32(1), pages 47-60, February.
    12. Milgrom, Paul R & Weber, Robert J, 1982. "A Theory of Auctions and Competitive Bidding," Econometrica, Econometric Society, vol. 50(5), pages 1089-1122, September.
    13. Srinivas Bollapragada & Marc Garbiras, 2004. "Scheduling Commercials on Broadcast Television," Operations Research, INFORMS, vol. 52(3), pages 337-345, June.
    14. Ali Hortaçsu & David McAdams, 2018. "Empirical Work on Auctions of Multiple Objects," Journal of Economic Literature, American Economic Association, vol. 56(1), pages 157-184, March.
    15. Song Yao & Carl F. Mela, 2008. "Online Auction Demand," Marketing Science, INFORMS, vol. 27(5), pages 861-885, 09-10.
    16. Joni L. Jones & Gary J. Koehler, 2005. "A Heuristic for Winner Determination in Rule-Based Combinatorial Auctions," INFORMS Journal on Computing, INFORMS, vol. 17(4), pages 475-489, November.
    17. 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. Sylvia Hristakeva & Julie Holland Mortimer, 2023. "Price Dispersion and Legacy Discounts in the National Television Advertising Market," Marketing Science, INFORMS, vol. 42(6), pages 1162-1183, November.
    2. Robert Zeithammer & Christopher Adams, 2010. "The Sealed-Bid Abstraction in Online Auctions," Marketing Science, INFORMS, vol. 29(6), pages 964-987, 11-12.
    3. Kline, Brendan, 2026. "Identification of incomplete information allocation-transfer games in monotone equilibrium," Journal of Econometrics, Elsevier, vol. 253(C).
    4. Lorentziadis, Panos L., 2016. "Optimal bidding in auctions from a game theory perspective," European Journal of Operational Research, Elsevier, vol. 248(2), pages 347-371.
    5. Nobel Prize Committee, 2020. "Improvements to auction theory and inventions of new auction formats," Nobel Prize in Economics documents 2020-2, Nobel Prize Committee.
    6. Robert Kleinberg & Bo Waggoner & E. Glen Weyl, 2016. "Descending Price Optimally Coordinates Search," Papers 1603.07682, arXiv.org, revised Dec 2016.
    7. Barkley, Aaron & Groeger, Joachim R. & Miller, Robert A., 2021. "Bidding frictions in ascending auctions," Journal of Econometrics, Elsevier, vol. 223(2), pages 376-400.
    8. Giovanni Giallombardo & Houyuan Jiang & Giovanna Miglionico, 2016. "New Formulations for the Conflict Resolution Problem in the Scheduling of Television Commercials," Operations Research, INFORMS, vol. 64(4), pages 838-848, August.
    9. Yixin Lu & Alok Gupta & Wolfgang Ketter & Eric van Heck, 2019. "Dynamic Decision Making in Sequential Business-to-Business Auctions: A Structural Econometric Approach," Management Science, INFORMS, vol. 65(8), pages 3853-3876, August.
    10. Han, Jidong & Popkowski Leszczyc, Peter T.L. & Zhang, Zelin, 2021. "Empirical Analyses of Nonlinear Effects of Reserve Prices on Ending Prices in Online Auctions," Journal of Interactive Marketing, Elsevier, vol. 54(C), pages 86-102.
    11. 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.
    12. 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.
    13. Holzman, Ron & Monderer, Dov, 2004. "Characterization of ex post equilibrium in the VCG combinatorial auctions," Games and Economic Behavior, Elsevier, vol. 47(1), pages 87-103, April.
    14. , & ,, 2015. "Implementation with interdependent valuations," Theoretical Economics, Econometric Society, vol. 10(3), September.
    15. Michael H. Rothkopf, 2007. "Thirteen Reasons Why the Vickrey-Clarke-Groves Process Is Not Practical," Operations Research, INFORMS, vol. 55(2), pages 191-197, April.
    16. Ausubel Lawrence M & Milgrom Paul R, 2002. "Ascending Auctions with Package Bidding," The B.E. Journal of Theoretical Economics, De Gruyter, vol. 1(1), pages 1-44, August.
    17. Kazumori, Eiichiro & Belch, Yaakov, 2019. "t-Tree: The Tokyo toolbox for large-scale combinatorial auction experiments," Journal of Behavioral and Experimental Finance, Elsevier, vol. 24(C).
    18. Wen Cao & Qinyang Sha & Zhiyong Yao & Dingwei Gu & Xiang Shao, 2019. "Sniping in soft-close online auctions: empirical evidence from overstock," Marketing Letters, Springer, vol. 30(2), pages 179-191, June.
    19. 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.
    20. Dirk Bergemann & Marek Bojko & Paul Dutting & Renato Paes Leme & Haifeng Xu & Song Zuo, 2024. "Data-Driven Mechanism Design: Jointly Eliciting Preferences and Information," Papers 2412.16132, arXiv.org, revised Dec 2025.

    More about this item

    Keywords

    ;
    ;
    ;
    ;
    ;

    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:eee:joinma:v:48:y:2019:i:c:p:120-133. 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: Catherine Liu (email available below). General contact details of provider: https://www.journals.elsevier.com/journal-of-interactive-marketing/ .

    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.