atlas

Research map / Learning theory and algorithms / Submodular and game algorithms

Balancing Spreads of Influence in a Social Network

AAAI 2020 · Learning theory and algorithms › Submodular and game algorithms · approach: Submodular influence maximization · 19 citations (OpenAlex)

Read the paperCheck your idea against 108,967 papers

AI-extracted summary. Written by AI from the paper's title only (no summary yet). Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.

Measured effects reported in the paper

What was changedWhereMeasuredEffect
Combine separate algorithms for zero and positive initial exposureHeterogeneous BAL(μ,ν) · Heterogeneous BAL(μ,ν)approximation ratio: (1-\frac{1}{e}-\eps)^{\frac{\nu}{2}}(\frac{1}{2|V|})^{\frac{\nu-2}{2}}\nu^{-\frac{2 u - 3}{2}}Helped
Use a fictitious campaign to select seeds and propagate them in the same ν campaignsCorrelated BAL(μ,ν) · Correlated BAL(μ,ν)approximation ratio: \frac{1-1/e-\eps}{2(\nu + 1)}Helped
Generalize the balancing objective to require exposure to at least three campaignsHeterogeneous BAL(μ,ν) · Heterogeneous BAL(μ,ν), ν≥3approximation hardness: no \(n^{-g(n)}\)-approximation algorithm with \(g(n)=o(1)\)Hurt
Raise the campaign threshold to at least fourHeterogeneous BAL(μ,ν) · Heterogeneous BAL(μ,ν), ν≥4approximation hardness: no \(n^{-\epsilon}\)-approximation algorithmHurt

Closest papers by meaning

Writing a paper in this area? scime draft is a free LaTeX editor with AI included, real-time co-authors and a check of your references and venue rules before you submit. It also imports OpenAI Prism projects.

Open scime draft

Get the next scime Dispatch and a monthly field update

Free. We send a confirmation link first; every email has a one-click unsubscribe. Privacy