• DocumentCode
    3669139
  • Title

    Optimal scheduling of campaigns on on-line forums

  • Author

    Aditya Karnik;Pankaj Dayama

  • Author_Institution
    General Electric Global Research, Bangalore, India
  • fYear
    2015
  • Firstpage
    775
  • Lastpage
    780
  • Abstract
    We consider the problem of devising optimal timing of on-line campaigns for diffusion of product or information in a population. In particular, we assume that the firm can influence the diffusion process by rolling out campaigns on online forums (we will refer to these as social media campaigns). The problem is to maximize the penetration of the product or given message in the population within the stipulated time. Taking the competitive Bass model as the model of diffusion dynamics, we pose the problem as continuous-time deterministic optimal control problem. We characterize optimal controls, present some numerical results and provide practical insights. We show that the optimal strategy has a simple and elegant structure. We also obtain strategy map which specify the maximum cost at which the firm must stop investing in social media campaigns. In contrast to earlier papers, we also model competition. This is not only close to reality but interestingly it allows to address some problems in completely different contexts. For example, in limiting the spread of misinformation about an entity or an Internet virus, the objective is to maximize nodes with correct information or security patches by immunizing them and/or incentivizing them to spread the information they have to their neighbors. Our work is, thus, applicable to these problems as well.
  • Keywords
    "Media","Silicon","Timing","Sociology","Statistics","Optimal control","Numerical models"
  • Publisher
    ieee
  • Conference_Titel
    Automation Science and Engineering (CASE), 2015 IEEE International Conference on
  • ISSN
    2161-8070
  • Electronic_ISBN
    2161-8089
  • Type

    conf

  • DOI
    10.1109/CoASE.2015.7294175
  • Filename
    7294175