English
Related papers

Related papers: Profit Maximization using Social Networks in Two-P…

200 papers

Now-a-days, Online Social Networks (OSNs) are extensively used by different commercial houses for viral marketing. The key problem that arises in this context is to choose a limited number of highly influential users as the initial adopters…

Social and Information Networks · Computer Science 2026-01-23 Poonam Sharma , Suman Banerjee

The problem of maximizing information diffusion, given a certain budget expressed in terms of the number of seed nodes, is an important topic in social networks research. Existing literature focuses on single phase diffusion where all seed…

Social and Information Networks · Computer Science 2017-06-26 Swapnil Dhamal , Prabuchandran K. J. , Y. Narahari

The problem of Profit Maximization asks to choose a limited number of influential users from a given social network such that the initial activation of these users maximizes the profit earned at the end of the diffusion process. This…

Social and Information Networks · Computer Science 2026-02-03 Poonam Sharma , Suman Banerjee

Profit Maximization is one of the key objectives for social media marketing, where the task is to choose a limited number of highly influential nodes such that their initial activation leads to maximum profit. In this paper, we introduce a…

Social and Information Networks · Computer Science 2025-12-23 Poonam Sharma , Suman Banerjee

Diffusion of information, innovation, and ideas is an important phenomenon in social networks. Information propagates through the network and reaches from one person to the next. In many settings, it is meaningful to restrict diffusion so…

Social and Information Networks · Computer Science 2026-02-03 Poonam Sharma , Suman Banerjee

For maximizing influence spread in a social network, given a certain budget on the number of seed nodes, we investigate the effects of selecting and activating the seed nodes in multiple phases. In particular, we formulate an appropriate…

Social and Information Networks · Computer Science 2015-02-24 Swapnil Dhamal , Prabuchandran K. J. , Y. Narahari

Given a social network represented as a graph where the nodes are the users and the edges represent the social relations, and a positive integer k, how to select k nodes to maximize the influence in the network remains an active area of…

Social and Information Networks · Computer Science 2026-05-29 Poonam Sharma , Sanchit Virdi , Suman Banerjee

Given a social network with nonuniform selection cost of the users, the problem of \textit{Budgeted Influence Maximization} (BIM in short) asks for selecting a subset of the nodes within an allocated budget for initial activation, such that…

Social and Information Networks · Computer Science 2020-04-09 Suman Banerjee , Mamata Jenamani , Dilip Kumar Pratihar

In this paper, we investigate the discount allocation problem in social networks. It has been reported that 40\% of consumers will share an email offer with their friend and 28\% of consumers will share deals via social media platforms.…

Social and Information Networks · Computer Science 2016-06-28 Shaojie Tang , Jing Yuan

We study the effectiveness of using multiple phases for maximizing the extent of information diffusion through a social network, and present insights while considering various aspects. In particular, we focus on the independent cascade…

Social and Information Networks · Computer Science 2018-02-27 Swapnil Dhamal

For the purpose of propagating information and ideas through a social network, a seeding strategy aims to find a small set of seed users that are able to maximize the spread of the influence, which is termed as influence maximization…

Social and Information Networks · Computer Science 2016-07-05 Guangmo Tong , Weili Wu , Shaojie Tang , Ding-Zhu Du

Influence maximization is the problem of finding a set of influential users in a social network such that the expected spread of influence under a certain propagation model is maximized. Much of the previous work has neglected the important…

Social and Information Networks · Computer Science 2016-11-18 Wei Lu , Laks V. S. Lakshmanan

We consider stochastic influence maximization problems arising in social networks. In contrast to existing studies that involve greedy approximation algorithms with a 63% performance guarantee, our work focuses on solving the problem…

Social and Information Networks · Computer Science 2020-06-02 Hao-Hsiang Wu , Simge Kucukyavuz

Online Social Networks (OSNs) attract billions of users to share information and communicate where viral marketing has emerged as a new way to promote the sales of products. An OSN provider is often hired by an advertiser to conduct viral…

Social and Information Networks · Computer Science 2017-12-27 Jing Tang , Xueyan Tang , Junsong Yuan

We consider the problem of maximizing the spread of influence in a social network by choosing a fixed number of initial seeds --- a central problem in the study of network cascades. The majority of existing work on this problem, formally…

Social and Information Networks · Computer Science 2016-09-22 Rico Angell , Grant Schoenebeck

Incentivized social advertising, an emerging marketing model, provides monetization opportunities not only to the owners of the social networking platforms but also to their influential users by offering a "cut" on the advertising revenue.…

Social and Information Networks · Computer Science 2021-06-23 Cigdem Aslay , Francesco Bonchi , Laks V. S. Lakshmanan , Wei Lu

In this paper we consider an extension of the well-known Influence Maximization Problem in a social network which deals with finding a set of k nodes to initiate a diffusion process so that the total number of influenced nodes at the end of…

Social and Information Networks · Computer Science 2019-04-19 Kübra Tanınmış , Necati Aras , İ. K. Altınel

Influence maximization is a problem of finding a small set of highly influential users, also known as seeds, in a social network such that the spread of influence under certain propagation models is maximized. In this paper, we consider…

Social and Information Networks · Computer Science 2015-07-14 Wei Chen , Wei Lu , Ning Zhang

We study the problem of optimally investing in nodes of a social network in a competitive setting, where two camps aim to maximize adoption of their opinions by the population. In particular, we consider the possibility of campaigning in…

Social and Information Networks · Computer Science 2018-04-18 Swapnil Dhamal , Walid Ben-Ameur , Tijani Chahed , Eitan Altman

Influence maximization serves as the main goal of a variety of social network activities such as viral marketing and campaign advertising. The independent cascade model for the influence spread assumes a one-time chance for each activated…

Social and Information Networks · Computer Science 2017-08-08 Ali Vardasbi , Heshaam Faili , Masoud Asadpour
‹ Prev 1 2 3 10 Next ›