DocumentCode
2053819
Title
A heuristic algorithm for profit maximization problem on customer social networking
Author
Xin Zhou
Author_Institution
Dept. of Econ. Eng., Kyushu Univ. Fukuoka, Fukuoka, Japan
fYear
2013
fDate
29-31 Aug. 2013
Firstpage
339
Lastpage
343
Abstract
The rapidly increasing development of online social networking sites such as Facebook, Epinions and Twitter has facilitated immense opportunities for viral marketing. In the presence of “word-of-mouth” referral, individuals´ decisions to purchase a product or adopt an innovation are strongly influenced by recommendations from their friends and acquaintances. With the tremendous popularity of social networking sites, enterprises have begun to explore the valuable information from customer social networking. Given huge numbers of customers and the pairwise influencing weights, how to choose appropriate customers as promotion group and target group and then obtain the maximum profit is one of the key issues in marketing´s decision-making. This paper introduces a novel profit maximization model and proposes a heuristic-based algorithm to solve this problem.
Keywords
customer relationship management; decision making; heuristic programming; profitability; promotion (marketing); social networking (online); Epinions; Facebook; Twitter; customer social networking; heuristic algorithm; heuristic-based algorithm; marketing decision-making; online social networking sites; pairwise influencing weights; profit maximization model; profit maximization problem; promotion group; viral marketing; word-of-mouth referral; Algorithm design and analysis; Approximation algorithms; Arrays; Computational modeling; Heuristic algorithms; Social network services; Technological innovation; “word-of-mouth”; Customer social networking; heuristic algorithm; maximum profit; promotion group; target group; viral marketing;
fLanguage
English
Publisher
ieee
Conference_Titel
Innovative Computing Technology (INTECH), 2013 Third International Conference on
Conference_Location
London
Print_ISBN
978-1-4799-0047-3
Type
conf
DOI
10.1109/INTECH.2013.6653652
Filename
6653652
Link To Document