بازاریابی ویروسی بازی آنلاین
ترجمه نشده

بازاریابی ویروسی بازی آنلاین

عنوان فارسی مقاله: بازاریابی ویروسی بازی آنلاین توسط تجزیه DS در شبکه های اجتماعی
عنوان انگلیسی مقاله: Viral Marketing of Online Game by DS decomposition in Social Networks
مجله/کنفرانس: علوم نظری رایانه – Theoretical Computer Science
رشته های تحصیلی مرتبط: مهندسی کامپیوتر، مهندسی فناوری اطلاعات، مدیریت
گرایش های تحصیلی مرتبط: مهندسی الگوریتم و محاسبات، اینترنت و شبکه های گسترده، بازاریابی
کلمات کلیدی فارسی: شبکه های اجتماعی، مزیت بازی، گسترش نفوذ، غیر مدولار فرعی
کلمات کلیدی انگلیسی: social networks, game profit, influence spread, non-submodular
نوع نگارش مقاله: مقاله پژوهشی (Research Article)
شناسه دیجیتال (DOI): https://doi.org/10.1016/j.tcs.2019.03.006
دانشگاه: School of Computer Science and Technology, Shandong University, Jinan, China
صفحات مقاله انگلیسی: 27
ناشر: الزویر - Elsevier
نوع ارائه مقاله: ژورنال
نوع مقاله: ISI
سال انتشار مقاله: 2020
ایمپکت فاکتور: 1.220 در سال 2018
شاخص H_index: 105 در سال 2019
شاخص SJR: 0.494 در سال 2018
شناسه ISSN: 0304-3975
شاخص Quartile (چارک): Q2 در سال 2018
فرمت مقاله انگلیسی: PDF
وضعیت ترجمه: ترجمه نشده است
قیمت مقاله انگلیسی: رایگان
آیا این مقاله بیس است: خیر
آیا این مقاله مدل مفهومی دارد: ندارد
آیا این مقاله پرسشنامه دارد: ندارد
آیا این مقاله متغیر دارد: ندارد
کد محصول: E14115
رفرنس: دارای رفرنس در داخل متن و انتهای مقاله
فهرست مطالب (انگلیسی)

Abstract

۱٫ Introduction

۲٫ Related works

۳٫ Formulation

۴٫ Decomposing strategy

۵٫ Algorithms

۶٫ Performance evaluation

۷٫ Conclusion

Acknowledgements

References

بخشی از مقاله (انگلیسی)

Abstract

In social networks, the spread of influence has been studied extensively, but most efforts in existing literature are made on the product used by a single person. This paper attempts to address the product which is used by many persons such as the online game. When multiple people participate in one game, interaction between users is accompanied by browsing and clicking on advertisements, and operators can also earn certain advertising revenues. All these revenues are related to information interaction between people involved in one game. We use game profit to represent all of the revenues gained from players involved in one game and model the game profit maximization problem in social networks, which finds a seed set to maximize the game profit between players who are influenced to buy the game. We prove that the problem is NP-hard and the objective function is neither submodular nor supermodular. To solve it, we decompose it into the Difference between two Submodular functions (DS decomposition) and propose four heuristic algorithms. To address the complexity of computing objective function, we design a new sampling method based on reverse reachable set technology. Experiment results on real datasets show that our approaches perform well.

Introduction

As online social networks (OSN) grow rapidly[1, 2, 3], the information diffusion and social influence get into people’s daily life deeply. Therefore, the influence-driven information technology and influence-based research subjects have been studied extensively in literatures. One of subjects is the viral marketing. In fact, advertisements in online social networks have gained better results than traditional medias sometimes, such as newspapers and televisions. Among existing works in viral marketing, most of efforts in the literature are made on products used by a single person[4, 5, 6]. In this paper, we consider the product which is used by many persons, i.e., a online game with many players. When multiple players participate in an online game, interaction behaviors between game players are always accompanied by browsing on advertisements showed on the game scene, which will lead to advertising revenue. The more frequent the interaction between players, the more times an advertisement is presented and viewed which means more revenues[7]. All these benefits or revenues are related to information interaction between people involved in one game. We use game profit to represent the revenues gained from game players mentioned above.