Can I read A Greedy Algorithm for Budgeted Multiple-Product Profit Maximization in Social Network on EtoBox?

A Greedy Algorithm for Budgeted Multiple-Product Profit Maximization in Social Network by Chun-Cheng Fang; Chia-Chun Ho; Bi-Ru Dai is a scholarly article available to read on EtoBox.

What is A Greedy Algorithm for Budgeted Multiple-Product Profit Maximization in Social Network about?

Due to the development of technology in recent years, the propagation of information has become very convenient. People can easily disseminate information, such as product advertisements on the Internet, and this way of attracting users on social networks is called viral marketing. Because companies usually launch a variety of similar products for consumers to choose from, finding the most potential influencer for products with different prices and a limited seed budget is a very hot topic. However, the purchasing ability of a consumer is generally assumed to be unrestricted in some related studies. This assumption does not conform to the business model in reality since the demand for a product is usually limited for a customer. Considering the above situation, we study a novel problem, called the Budgeted Multiple-Product Profit Maximization (BMPM) problem. We will find suitable seeds for multiple products to maximize the overall profit when the overall budget is limited. Therefore, we propose a greedy algorithm named BG and a new graph structure PWDAG to effectively solve the BMPM problem. Our experiments on real world datasets show that BG can maximize the overall profit with hi

Author

Chun-Cheng Fang; Chia-Chun Ho; Bi-Ru Dai

Publisher

IEEE

Published

2022