Fractional Budget Allocation for Influence Maximization under General Marketing Strategies
Fuente:
arXiv
Gespeichert in:
| Hauptverfasser: | , , , |
|---|---|
| Format: | Preprint |
| Veröffentlicht: |
2024
|
| Schlagworte: | |
| Online-Zugang: | |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| _version_ | 1866910517634793472 |
|---|---|
| author | Bhimaraju, Akhil Robson, Eliot W. Varshney, Lav R. Umrawal, Abhishek K. |
| author_facet | Bhimaraju, Akhil Robson, Eliot W. Varshney, Lav R. Umrawal, Abhishek K. |
| contents | We consider the fractional influence maximization problem, i.e., identifying users on a social network to be incentivized with potentially partial discounts to maximize the influence on the network. The larger the discount given to a user, the higher the likelihood of its activation (adopting a new product or innovation), who then attempts to activate its neighboring users, causing a cascade effect of influence through the network. Our goal is to devise efficient algorithms that assign initial discounts to the network's users to maximize the total number of activated users at the end of the cascade, subject to a constraint on the total sum of discounts given. In general, the activation likelihood could be any non-decreasing function of the discount, whereas, our focus lies on the case when the activation likelihood is an affine function of the discount, potentially varying across different users. As this problem is shown to be NP-hard, we propose and analyze an efficient (1-1/e)-approximation algorithm. Furthermore, we run experiments on real-world social networks to show the performance and scalability of our method. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2407_05669 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | Fractional Budget Allocation for Influence Maximization under General Marketing Strategies Bhimaraju, Akhil Robson, Eliot W. Varshney, Lav R. Umrawal, Abhishek K. Social and Information Networks Artificial Intelligence Data Structures and Algorithms Machine Learning 05C85, 60J60, 68R05, 68R10, 68T01, 90C27, 90C35 F.2.2; G.1.2; G.1.6; G.2.1; G.2.2; G.3; I.2.0; J.4 We consider the fractional influence maximization problem, i.e., identifying users on a social network to be incentivized with potentially partial discounts to maximize the influence on the network. The larger the discount given to a user, the higher the likelihood of its activation (adopting a new product or innovation), who then attempts to activate its neighboring users, causing a cascade effect of influence through the network. Our goal is to devise efficient algorithms that assign initial discounts to the network's users to maximize the total number of activated users at the end of the cascade, subject to a constraint on the total sum of discounts given. In general, the activation likelihood could be any non-decreasing function of the discount, whereas, our focus lies on the case when the activation likelihood is an affine function of the discount, potentially varying across different users. As this problem is shown to be NP-hard, we propose and analyze an efficient (1-1/e)-approximation algorithm. Furthermore, we run experiments on real-world social networks to show the performance and scalability of our method. |
| title | Fractional Budget Allocation for Influence Maximization under General Marketing Strategies |
| topic | Social and Information Networks Artificial Intelligence Data Structures and Algorithms Machine Learning 05C85, 60J60, 68R05, 68R10, 68T01, 90C27, 90C35 F.2.2; G.1.2; G.1.6; G.2.1; G.2.2; G.3; I.2.0; J.4 |
| url | https://arxiv.org/abs/2407.05669 |