IDEAS home Printed from https://ideas.repec.org/a/eee/phsmap/v450y2016icp670-681.html
   My bibliography  Save this article

Cost effective campaigning in social networks

Author

Listed:
  • Kotnis, Bhushan
  • Kuri, Joy

Abstract

Campaigners are increasingly using online social networking platforms for promoting products, ideas and information. A popular method of promoting a product or even an idea is incentivizing individuals to evangelize the idea vigorously by providing them with referral rewards in the form of discounts, cash backs, or social recognition. Due to budget constraints on scarce resources such as money and manpower, it may not be possible to provide incentives for the entire population, and hence incentives need to be allocated judiciously to appropriate individuals for ensuring the highest possible outreach size. We aim to do the same by formulating and solving an optimization problem using percolation theory. In particular, we compute the set of individuals that are provided incentives for minimizing the expected cost while ensuring a given outreach size. We also solve the problem of computing the set of individuals to be incentivized for maximizing the outreach size for given cost budget. The optimization problem turns out to be non trivial; it involves quantities that need to be computed by numerically solving a fixed point equation. Our primary contribution is, that for a fairly general cost structure, we show that the optimization problems can be solved by solving a simple linear program. We believe that our approach of using percolation theory to formulate an optimization problem is the first of its kind.

Suggested Citation

  • Kotnis, Bhushan & Kuri, Joy, 2016. "Cost effective campaigning in social networks," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 450(C), pages 670-681.
    • Handle: RePEc:eee:phsmap:v:450:y:2016:i:c:p:670-681
    DOI: 10.1016/j.physa.2015.12.127
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0378437115011644
    Download Restriction: Full text for ScienceDirect subscribers only. Journal offers the option of making the article available online on Science direct for a fee of $3,000
    File URL: https://libkey.io/10.1016/j.physa.2015.12.127?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 search for a different version of it.

    References listed on IDEAS

    as
    1. Wu, Xiaoyan & Liu, Zonghua, 2008. "How community structure influences epidemic spread in social networks," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 387(2), pages 623-630.
    2. Charlotte Bruun (ed.), 2006. "Advances in Artificial Economics," Lecture Notes in Economics and Mathematical Systems, Springer, number 978-3-540-37249-3, October.
    3. Sitabhra Sinha & Srinivas Raghavendra, 2006. "Market Polarization in Presence of Individual Choice Volatility," Lecture Notes in Economics and Mathematical Systems, in: Charlotte Bruun (ed.), Advances in Artificial Economics, chapter 13, pages 177-190, Springer.
    4. Marcel Salathé & James H Jones, 2010. "Dynamics and Control of Diseases in Networks with Community Structure," PLOS Computational Biology, Public Library of Science, vol. 6(4), pages 1-11, April.
    5. Nekovee, M. & Moreno, Y. & Bianconi, G. & Marsili, M., 2007. "Theory of rumour spreading in complex social networks," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 374(1), pages 457-470.
    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. Gong Kai & Kang Li, 2018. "A New K-Shell Decomposition Method for Identifying Influential Spreaders of Epidemics on Community Networks," Journal of Systems Science and Information, De Gruyter, vol. 6(4), pages 366-375, August.
    2. Zhang, Ruixia & Li, Deyu, 2017. "Rumor propagation on networks with community structure," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 483(C), pages 375-385.
    3. Shang, Jiaxing & Liu, Lianchen & Li, Xin & Xie, Feng & Wu, Cheng, 2015. "Epidemic spreading on complex networks with overlapping and non-overlapping community structure," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 419(C), pages 171-182.
    4. Huo, Liang’an & Chen, Sijing, 2020. "Rumor propagation model with consideration of scientific knowledge level and social reinforcement in heterogeneous network," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 559(C).
    5. Li, Dandan & Ma, Jing, 2017. "How the government’s punishment and individual’s sensitivity affect the rumor spreading in online social networks," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 469(C), pages 284-292.
    6. Gregory, Steve, 2012. "Ordered community structure in networks," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 391(8), pages 2752-2763.
    7. Wei Zhong, 2017. "Simulating influenza pandemic dynamics with public risk communication and individual responsive behavior," Computational and Mathematical Organization Theory, Springer, vol. 23(4), pages 475-495, December.
    8. Hosni, Adil Imad Eddine & Li, Kan & Ahmad, Sadique, 2020. "Analysis of the impact of online social networks addiction on the propagation of rumors," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 542(C).
    9. Chen, Dandan & Zheng, Muhua & Zhao, Ming & Zhang, Yu, 2018. "A dynamic vaccination strategy to suppress the recurrent epidemic outbreaks," Chaos, Solitons & Fractals, Elsevier, vol. 113(C), pages 108-114.
    10. Jia, Pingqi & Wang, Chao & Zhang, Gaoyu & Ma, Jianfeng, 2019. "A rumor spreading model based on two propagation channels in social networks," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 524(C), pages 342-353.
    11. Wang, Xiaojie & Zhang, Xue & Zhao, Chengli & Yi, Dongyun, 2018. "Effectively identifying multiple influential spreaders in term of the backward–forward propagation," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 512(C), pages 404-413.
    12. Shang, Jiaxing & Liu, Lianchen & Li, Xin & Xie, Feng & Wu, Cheng, 2016. "Targeted revision: A learning-based approach for incremental community detection in dynamic networks," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 443(C), pages 70-85.
    13. Liang’an Huo & Fan Ding & Chen Liu & Yingying Cheng, 2018. "Dynamical Analysis of Rumor Spreading Model considering Node Activity in Complex Networks," Complexity, Hindawi, vol. 2018, pages 1-10, November.
    14. Xuefeng Yue & Liangan Huo, 2022. "Analysis of the Stability and Optimal Control Strategy for an ISCR Rumor Propagation Model with Saturated Incidence and Time Delay on a Scale-Free Network," Mathematics, MDPI, vol. 10(20), pages 1-20, October.
    15. Zan, Yongli & Wu, Jianliang & Li, Ping & Yu, Qinglin, 2014. "SICR rumor spreading model in complex networks: Counterattack and self-resistance," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 405(C), pages 159-170.
    16. Zhang, Yaming & Su, Yanyuan & Weigang, Li & Liu, Haiou, 2019. "Interacting model of rumor propagation and behavior spreading in multiplex networks," Chaos, Solitons & Fractals, Elsevier, vol. 121(C), pages 168-177.
    17. Zhao, Laijun & Qiu, Xiaoyan & Wang, Xiaoli & Wang, Jiajia, 2013. "Rumor spreading model considering forgetting and remembering mechanisms in inhomogeneous networks," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 392(4), pages 987-994.
    18. Fink, Christian G. & Fullin, Kelly & Gutierrez, Guillermo & Omodt, Nathan & Zinnecker, Sydney & Sprint, Gina & McCulloch, Sean, 2023. "A centrality measure for quantifying spread on weighted, directed networks," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 626(C).
    19. Jianhong Chen & Hongcai Ma & Shan Yang, 2023. "SEIOR Rumor Propagation Model Considering Hesitating Mechanism and Different Rumor-Refuting Ways in Complex Networks," Mathematics, MDPI, vol. 11(2), pages 1-22, January.
    20. Marco Bardoscia & Fabio Caccioli & Juan Ignacio Perotti & Gianna Vivaldo & Guido Caldarelli, 2016. "Distress Propagation in Complex Networks: The Case of Non-Linear DebtRank," PLOS ONE, Public Library of Science, vol. 11(10), pages 1-12, October.

    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:phsmap:v:450:y:2016:i:c:p:670-681. 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: http://www.journals.elsevier.com/physica-a-statistical-mechpplications/ .

    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.