Optimal Product-Sampling Strategies in Social Networks: How Many and Whom to Target?

被引:21
|
作者
Schlereth, Christian [1 ]
Barrot, Christian [2 ,3 ]
Skiera, Bernd [1 ]
Takac, Carsten [1 ]
机构
[1] Goethe Univ Frankfurt, Fac Business & Econ, D-60054 Frankfurt, Germany
[2] Kuhne Logist Univ Hamburg, Hamburg, Germany
[3] Univ Kiel, Kiel, Germany
关键词
Agent-based models; product diffusion; product marketing; product sampling; sampling strategies; social networks; WORD-OF-MOUTH; INNOVATION; DIFFUSION; CONTAGION; STRENGTH; ADOPTION; SPREAD; SALES; MODEL;
D O I
10.2753/JEC1086-4415180102
中图分类号
F [经济];
学科分类号
02 ;
摘要
Using an agent-based model to study the success of product-sampling campaigns that rely on information about social networks, this paper investigates the essential decisions of which consumers and how many of them to target with free product samples. With an unweighted and a weighted real-world personal communication network, we show that the decision of which consumers to target is more important than that of how many consumers to target. Use of social network information increases profits by at least 32 percent. Companies should use a high-degree targeting heuristic to identify the most influential consumers. Use of social network information increases profit for single-purchase products mainly because it supports targeting more influential consumers and therefore speeds up diffusion throughout the network. For repeat-purchase products, social network information decreases the optimal number of samples and thus the cost of the campaign.
引用
收藏
页码:45 / 72
页数:28
相关论文
共 31 条
  • [1] Strategies for new product diffusion: Whom and how to target?
    Hu, Hai-hua
    Lin, Jun
    Qian, Yanjun
    Sun, Jian
    [J]. JOURNAL OF BUSINESS RESEARCH, 2018, 83 : 111 - 119
  • [2] Optimal Influence Strategies in Social Networks
    Christos Bilanakos
    Dionisios N. Sotiropoulos
    Ifigeneia Georgoula
    George M. Giaglis
    [J]. Computational Economics, 2017, 49 : 517 - 561
  • [3] Optimal Influence Strategies in Social Networks
    Bilanakos, Christos
    Sotiropoulos, Dionisios N.
    Georgoula, Ifigeneia
    Giaglis, George M.
    [J]. COMPUTATIONAL ECONOMICS, 2017, 49 (04) : 517 - 561
  • [4] Optimal Influence Strategies in Social Networks
    Bilanakos, Christos
    Sotiropoulos, Dionisios N.
    Georgoula, Ifigeneia
    Giaglis, George M.
    [J]. PROCEEDINGS OF THE 2015 IEEE/ACM INTERNATIONAL CONFERENCE ON ADVANCES IN SOCIAL NETWORKS ANALYSIS AND MINING (ASONAM 2015), 2015, : 856 - 863
  • [5] Assessing Strategies for Sampling Dynamic Social Networks
    Ceravolo, Paolo
    Ciclosi, Francesco
    Bellini, Emanuele
    Damiani, Ernesto
    [J]. RESEARCH & INNOVATION FORUM 2019: TECHNOLOGY, INNOVATION, EDUCATION, AND THEIR SOCIAL IMPACT, 2019, : 171 - 179
  • [6] How Many Runs? Analytical Method for Optimal Scenario Sampling to Estimate Travel Time Variance in Traffic Networks
    Kim, Jiwon
    Mahmassani, Hani S.
    [J]. TRANSPORTATION RESEARCH RECORD, 2014, (2467) : 49 - 61
  • [7] Optimal Duopolistic Competition Strategies in Social Networks
    Sotiropoulos, Dionisios N.
    Georgoula, Ifigeneia
    Bilanakos, Christos
    [J]. 2019 10TH INTERNATIONAL CONFERENCE ON INFORMATION, INTELLIGENCE, SYSTEMS AND APPLICATIONS (IISA), 2019, : 350 - 356
  • [8] Sampling Online Social Networks with Tailored Mining Strategies
    Arafeh, Mohamad
    Ceravolo, Paolo
    Mourad, Azzam
    Damiani, Ernesto
    [J]. 2019 SIXTH INTERNATIONAL CONFERENCE ON SOCIAL NETWORKS ANALYSIS, MANAGEMENT AND SECURITY (SNAMS), 2019, : 217 - 222
  • [9] Near Optimal Strategies for Targeted Marketing in Social Networks
    Pasumarthi, Rama Kumar
    Narayanam, Ramasuri
    Ravindran, Balaraman
    [J]. PROCEEDINGS OF THE 2015 INTERNATIONAL CONFERENCE ON AUTONOMOUS AGENTS & MULTIAGENT SYSTEMS (AAMAS'15), 2015, : 1679 - 1680
  • [10] Model Selection of the Target Audience in Social Networks in Order to Promote the Product
    Piatykop, Olena
    Onina, Olga Pr
    [J]. COMPUTATIONAL LINGUISTICS AND INTELLIGENT SYSTEMS (COLINS 2020), VOL I: MAIN CONFERENCE, 2020, 2604