Sticky seeding in discrete-time reversible-threshold networks

MaRDI QIDQ2965972zbMATH OpenFDO

Authors Gwen Spencer

Publication date 3 March 2017

Full work available at URL https://arxiv.org/abs/1507.00691, https://dmtcs.episciences.org/1405/pdf

zbMATH Keywords

combinatorial optimizationconvergencenetwork seedingspreading phenomenon

Mathematics Subject Classification ID

Deterministic network models in operations research (90B10) Combinatorial optimization (90C27) Programming involving graphs or networks (90C35) Approximation methods and heuristics in mathematical programming (90C59)

Recommendations

• Hardness Results for Seeding Complex Contagion with Neighborhoods
• Seeding with costly network information
• Fast and frugal targeting with incentives
• Computational aspects of optimal strategic network diffusion
• Maximizing social influence in nearly optimal time

This page was built for publication: Sticky seeding in discrete-time reversible-threshold networks

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2965972)