### Abstract

Diffusion on complex networks is often modeled as a stochastic process. Yet, recent work on strategic diffusion emphasizes the decision power of agents [1] and treats diffusion as a strategic problem. Here we study the computational aspects of strategic diffusion, i.e., finding the optimal sequence of nodes to activate a network in the minimum time. We prove that finding an optimal solution to this problem is NP-complete in a general case. To overcome this computational difficulty, we present an algorithm to compute an optimal solution based on a dynamic programming technique. We also show that the problem is fixed parameter-tractable when parametrized by the product of the treewidth and maximum degree. We analyze the possibility of developing an efficient approximation algorithm and show that two heuristic algorithms proposed so far cannot have better than a logarithmic approximation guarantee. Finally, we prove that the problem does not admit better than a logarithmic approximation, unless P=NP.

Original language | English |
---|---|

Pages (from-to) | 153-168 |

Number of pages | 16 |

Journal | Theoretical Computer Science |

Volume | 814 |

Early online date | 30 Jan 2020 |

DOIs | |

Publication status | E-pub ahead of print - 30 Jan 2020 |

### Fingerprint

### Keywords

- Complex networks
- Influence maximization
- Network contagion
- Strategic diffusion

### Cite this

*Theoretical Computer Science*,

*814*, 153-168. https://doi.org/10.1016/j.tcs.2020.01.027