Stochastic Dynamic Programming Heuristics for Influence Maximization-Revenue Optimization

02/28/2018
by   Trisha Lawrence, et al.
0

The well-known Influence Maximization (IM) problem has been actively studied by researchers over the past decade, with emphasis on marketing and social networks. Existing research have obtained solutions to the IM problem by obtaining the influence spread and utilizing the property of submodularity. This paper is based on a novel approach to the IM problem geared towards optimizing clicks and consequently revenue within anOnline Social Network (OSN). Our approach diverts from existing approaches by adopting a novel, decision-making perspective through implementing Stochastic Dynamic Programming (SDP). Thus, we define a new problem Influence Maximization-Revenue Optimization (IM-RO) and propose SDP as a method in which this problem can be solved. The SDP method has lucrative gains for an advertiser in terms of optimizing clicks and generating revenue however, one drawback to the method is its associated "curse of dimensionality" particularly for problems involving a large state space. Thus, we introduce the Lawrence Degree Heuristic (LDH), Adaptive Hill-Climbing (AHC) and Multistage Particle Swarm Optimization (MPSO) heuristics as methods which are orders of magnitude faster than the SDP method whilst achieving near-optimal results. Through a comparative analysis on various synthetic and real-world networks we present the AHC and LDH as heuristics well suited to to the IM-RO problem in terms of their accuracy, running times and scalability under ideal model parameters. In this paper we present a compelling survey on the SDP method as a practical and lucrative method for spreading information and optimizing revenue within the context of OSNs.

READ FULL TEXT
research
03/08/2018

A Bayesian and Machine Learning approach to estimating Influence Model parameters for IM-RO

The rise of Online Social Networks (OSNs) has caused an insurmountable a...
research
09/15/2018

Revenue Maximization in an Optical Router Node Using Multiple Wavelengths

In this paper, an optical router node with multiple wavelengths is consi...
research
07/11/2021

Efficient and Effective Algorithms for Revenue Maximization in Social Advertising

We consider the revenue maximization problem in social advertising, wher...
research
08/27/2023

Neural Influence Estimator: Towards Real-time Solutions to Influence Blocking Maximization

Real-time solutions to the influence blocking maximization (IBM) problem...
research
04/02/2020

A k-hop Collaborate Game Model: Extended to Community Budgets and Adaptive Non-Submodularity

Revenue maximization (RM) is one of the most important problems on onlin...
research
01/18/2020

RCELF: A Residual-based Approach for Influence Maximization Problem

Influence Maximization Problem (IMP) is selecting a seed set of nodes in...
research
12/03/2019

Influence Maximization for Social Good: Use of Social Networks in Low Resource Communities

This thesis proposal makes the following technical contributions: (i) we...

Please sign up or login with your details

Forgot password? Click here to reset