A Learning-based Framework to Handle Multi-round Competitive Influence Maximization on Social Networks
Date Issued
2016
Date
2016
Author(s)
Lin, Su-Chen
Abstract
Considering nowadays companies providing similar products or services compete with each other for resources and customers, this work proposes a learning-based framework to tackle the multi-round competitive influence maximization problem on a social network. We propose a data-driven model leveraging the concept of meta-learning to maximize the expected influence in the long run. Our model considers not only the network information but also the opponent''s strategy while making a decision. It maximizes the total influence in the end of the process instead of myopically pursuing short term gain. We propose solutions for scenarios when the opponent''s strategy is known or unknown and available or unavailable for training. We also show how an effective framework can be trained without manually labeled data, and conduct several experiments to verify the effectiveness of the whole process.
Subjects
Competitive Influence Maximization
Reinforcement Learning
Social Network
Game Theory
Data-driven
Meta-learning
Multi-agents
Type
thesis
File(s)![Thumbnail Image]()
Loading...
Name
ntu-105-F95921025-1.pdf
Size
23.32 KB
Format
Adobe PDF
Checksum
(MD5):bfe34c1c195a8bd398ed641c5840245d