- Rating
- 1
- Confidence
- 3
- Informativeness
- 2
- Presentation
- 2
- Soundness
- 2
Read review
Paper summary
The paper addresses fairness in social influence maximization for convex fairness metrics by developing an algorithm for seed selection that scales close to the greedy baseline without fairness.
Critical strengths
the paper addresses the computational complexity of fair IM, for concave fair function. In this regard I can see the value of the algorithm especially when it comes to large scale networks
Critical weaknesses
the paper is really slow in its flow, at page 4 I am still reading the introduction,
The bounds need to be bounded and Lipschitz, but and the log function have as . The guarantees are thereforenot valid for two of the three tested functions
Questions for authors
SNAP ground-truth communities overlap, yet the framework assumes a partition. How were overlaps resolved? In what sense is “fairness” across 600–1,300 structural communities comparable to fairness across demographic groups?
As for the bound on Phi', we knew this issue and a workaround has been used in our code (see answer to Reviewer 1). We will report this workaround in the paper at the next revision.
As for SNAP community, we: 1) identified all structural (possibly overlapping) communities in the graph; 2) removed all community with less than 10 nodes, and the corresponding nodes; 3) assigned each node to exactly one of the community at which she belongs. We stress that this approach has been imported by previous works in which it was been adopted to prove the effectiveness of FIMM.