Advanced Search
MyIDEAS: Login

Optimal Internet Media Selection

Contents:

Author Info

  • Peter J. Danaher

    ()
    (Melbourne Business School, Carlton, Victoria 3053, Australia)

  • Janghyuk Lee

    ()
    (Korea University Business School, An-am, Seong-buk, Seoul, South Korea)

  • Laoucine Kerbache

    ()
    (Department of OMIT and the Research Center GREGHEC, HEC School of Management, 78351 Paris, France)

Registered author(s):

    Abstract

    In this study we develop a method that optimally selects online media vehicles and determines the number of advertising impressions that should be purchased and then served from each chosen website. As a starting point, we apply Danaher's [Danaher, P. J. 2007. Modeling page views across multiple websites with an application to Internet reach and frequency prediction. (3) 422–437] multivariate negative binomial distribution (MNBD) for predicting online media exposure distributions. The MNBD is used as a component in the broader task of media selection. Rather than simply adapting previous selection methods used in traditional media, we show that the Internet poses some unique challenges. Specifically, online banner ads and other forms of online advertising are sold by methods that differ substantially from the way other media advertising is sold. We use a nonlinear optimization algorithm to solve the optimization problem and derive the optimum online media schedule. Data from an online audience measurement firm and an advertising agency are used to illustrate the speed and accuracy of our method, which is substantially quicker than using complete enumeration.

    Download Info

    If you experience problems downloading a file, check if you have the proper application to view it first. In case of further problems read the IDEAS help page. Note that these files are not on the IDEAS site. Please be patient as the files may be large.
    File URL: http://dx.doi.org/10.1287/mksc.1090.0507
    Download Restriction: no

    Bibliographic Info

    Article provided by INFORMS in its journal Marketing Science.

    Volume (Year): 29 (2010)
    Issue (Month): 2 (03-04)
    Pages: 336-347

    as in new window
    Handle: RePEc:inm:ormksc:v:29:y:2010:i:2:p:336-347

    Contact details of provider:
    Postal: 7240 Parkway Drive, Suite 300, Hanover, MD 21076 USA
    Phone: +1-443-757-3500
    Fax: 443-757-3515
    Email:
    Web page: http://www.informs.org/
    More information through EDIRC

    Related research

    Keywords: advertising; Internet marketing; media; optimization; probability models;

    References

    No references listed on IDEAS
    You can help add them by filling out this form.

    Citations

    Lists

    This item is not listed on Wikipedia, on a reading list or among the top items on IDEAS.

    Statistics

    Access and download statistics

    Corrections

    When requesting a correction, please mention this item's handle: RePEc:inm:ormksc:v:29:y:2010:i:2:p:336-347. See general information about how to correct material in RePEc.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Mirko Janc).

    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 references are entirely missing, you can add them using this form.

    If the full references list an item that is present in RePEc, but the system did not link 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 profile, as there may be some citations waiting for confirmation.

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.