Optimal incentive timing strategies for product marketing on social networks


Autoria(s): Dayama, Pankaj; Karnik, Aditya; Narahari, Y
Data(s)

2012

Resumo

We consider the problem of devising incentive strategies for viral marketing of a product. In particular, we assume that the seller can influence penetration of the product by offering two incentive programs: a) direct incentives to potential buyers (influence) and b) referral rewards for customers who influence potential buyers to make the purchase (exploit connections). The problem is to determine the optimal timing of these programs over a finite time horizon. In contrast to algorithmic perspective popular in the literature, we take a mean-field approach and formulate the problem as a continuous-time deterministic optimal control problem. We show that the optimal strategy for the seller has a simple structure and can take both forms, namely, influence-and-exploit and exploit-and-influence. We also show that in some cases it may optimal for the seller to deploy incentive programs mostly for low degree nodes. We support our theoretical results through numerical studies and provide practical insights by analyzing various scenarios.

Formato

application/pdf

Identificador

http://eprints.iisc.ernet.in/47715/1/Auto_Agen_Multi_Sys_703_2012.pdf

Dayama, Pankaj and Karnik, Aditya and Narahari, Y (2012) Optimal incentive timing strategies for product marketing on social networks. In: Proceedings of the 11th International Conference on Autonomous Agents and Multiagent Systems, June 4-8, 2012, Valencia, Spain.

Publicador

Association for Computing Machinery

Relação

http://dl.acm.org/citation.cfm?id=2343797

http://eprints.iisc.ernet.in/47715/

Palavras-Chave #Computer Science & Automation (Formerly, School of Automation)
Tipo

Conference Paper

PeerReviewed