Sticky Seeding in Discrete-Time Reversible-Threshold Networks
When nodes can repeatedly update their behavior (as in agent-based models from computational social science or repeated-game play settings) the problem of optimal network seeding becomes very complex. For a popular spreading-phenomena model of binary-behavior updating based on thresholds of adoption...
Saved in:
| Published in | Discrete mathematics and theoretical computer science Vol. 18 no. 3; no. Distributed Computing and... |
|---|---|
| Main Author | |
| Format | Journal Article |
| Language | English |
| Published |
Discrete Mathematics & Theoretical Computer Science
17.03.2016
|
| Subjects | |
| Online Access | Get full text |
Cover
Loading…
Be the first to leave a comment!