Scribd
Upload
16 views2 pages

NetOpt2020 2020 01 22 Mario Exercises

This document outlines 7 exercises related to optimization problems in social networks. The exercises involve formulating integer programs for influence maximization problems under different propagation models like independent cascade model and linear threshold model. The problems include competitive influence maximization, rumor blocking, budgeted influence maximization, and heuristics for influence maximization under the linear threshold model. Integer programming formulations are to be developed using concepts like time-indexed variables, cycle elimination, and minimal influencing sets.

Uploaded by

el.lucho.letelier
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
16 views2 pages

NetOpt2020 2020 01 22 Mario Exercises

This document outlines 7 exercises related to optimization problems in social networks. The exercises involve formulating integer programs for influence maximization problems under different propagation models like independent cascade model and linear threshold model. The problems include competitive influence maximization, rumor blocking, budgeted influence maximization, and heuristics for influence maximization under the linear threshold model. Integer programming formulations are to be developed using concepts like time-indexed variables, cycle elimination, and minimal influencing sets.

Uploaded by

el.lucho.letelier
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 2

Optimization in Social Networks: Exercises

9th Winter School on Network Optimization, January 20-24, 2020

Exercise 1 Influence Maximization Problem (ICM)


Consider the influence maximization problem based on the independent cascade model and the
scenario modeling approach (slide 14/15). We stated a covering formulation for this problem (slide
21). Try to find alternative (mixed) integer linear programming formulations based on
(a) time-indexed variables (see slide 43),
(b) cycle-elimination (see slide 44).

Exercise 2 Competitive Influence Maximization (ICM)


Consider the competitive influence maximization problem (CIMP, slide 32/33). The covering formu-
lation for the non-competitive IMP can be easily adapted to the CIMP by re-defining the reachability
sets (slide 34). Try to adapt the formulations from Exercise 1 to the CIMP.

Exercise 3 Rumor Blocking (ICM)


Assume a similar setting as for the competitive influence maximization problem (slide 32), but here
the leader (let’s call him “Tromp”) is spreading “fake news” from his seed set L starting in time step
1. You realize this only in time step 5 and now want to block this spreading by selecting at most K
nodes which are convinced not to forward Tromp’s fake news. Your goal is to minimize the number
of nodes which are reached by Tromp’s fake news. Formulate an MILP (based on any modeling
concept) for this problem.

Exercise 4 Budgeted Influence Maximization Problem (LTM)


We define a budgeted variant of the influence maximization problem (slide 14), but based on the
linear threshold model (slide 38): Each node i ∈ V has a cost ci ≥ 0 for including it in the seed set,
and a profit pi ≥ 0 which is obtained when the node gets active. We want to find a seed set with
costs not exceeding the budget B which maximizes the total profit obtained from activated nodes.
Formulate this problem as an MILP
(a) based on time-indexed variables (slide 43),
(b) based on cycle-elimination (slide 44),
(c) based on minimal influencing sets (slides 52/53).

Exercise 5 Non-Progressive Linear Threshold Model


Consider the following non-progressive variant of the linear threshold model (slide 38): Each node
i ∈ V has a hurdle hit ≥ 0 potentially different for each time step t = 1, . . . , T , within some time
horizon T . Node i is active in time step t if
X
dji ≥ hit ,
j∈Ui,t−1

where Ui,t−1 is the set of neighbors which are active in time step t − 1. Therefore, a node’s state
might go from active to inactive again if the hurdle increases or the set of active neighbors decreases
in a later time step.
We now state the influence maximization problem (slide 14) based on such a non-progressive LTM.
The given objective function of maximizing the number of active nodes does not make sense anymore
in the non-progressive context. Instead we want to maximize the sum of active time steps over all
nodes within time horizon T . Formulate this problem as an MILP with time-indexed variables (slide
43).

Exercise 6 Competitive Influence Maximization (LTM)


Try to think of a reasonable propagation model with two players based on the linear threshold model
(slide 38) in the flavor of the competitive independent cascade model (slide 32/33). Based on this
propagation model formulate the competitive influence maximization problem as an MILP (based
on any modeling concept).

Exercise 7 Heuristics for Influence Maximization (LTM)


For the influence maximization problem based on the independent cascade model, there is an efficient
greedy heuristic by Kempe et al. (2003) on slide 17. The greedy criterium is based on a node’s
marginal gain. For the linear threshold model (slide 38) there is no such marginal gain concept for a
node since usually only multiple nodes together can activate another node. Think of efficient greedy
heuristics for the influence maximization problem based on the LTM.

You might also like