论文标题
公平影响最大化:一种福利优化方法
Fair Influence Maximization: A Welfare Optimization Approach
论文作者
论文摘要
几种行为,社会和公共卫生干预措施,例如预防自杀/艾滋病毒或针对自然灾害的社区准备,利用社交网络信息来最大程度地提高外展活动。已经提出了算法影响最大化技术,以帮助选择在这种干预措施中选择“同伴领导者”或“影响者”。然而,尚未考虑到这些干预措施的传统影响最大化算法。结果,他们可能会不成比例地将少数民族社区排除在干预措施之外。这激发了对公平影响最大化的研究。现有技术带有两个主要缺点。首先,他们需要采取单一的公平措施。其次,这些措施通常被施加为严格的约束,从而导致不良属性,例如浪费资源。 为了解决这些缺点,我们提供了对公平影响最大化算法应满足的属性的原则表征。特别是,我们提出了一个基于社会福利理论的框架,其中每个社区得出的基本公用事业是使用同弹性社会福利功能汇总的。在此框架下,公平与效率之间的权衡可以通过单个不平等厌恶设计参数来控制。然后,在什么情况下,我们可以通过福利职能来满足我们提出的原则。由此产生的优化问题是单调和下管,可以通过最佳保证有效地解决。我们的框架涵盖了特殊情况,词汇和比例公平。关于合成和现实世界数据集的广泛实验,包括一项有关滑坡风险管理的案例研究,证明了该框架的功效。
Several behavioral, social, and public health interventions, such as suicide/HIV prevention or community preparedness against natural disasters, leverage social network information to maximize outreach. Algorithmic influence maximization techniques have been proposed to aid with the choice of "peer leaders" or "influencers" in such interventions. Yet, traditional algorithms for influence maximization have not been designed with these interventions in mind. As a result, they may disproportionately exclude minority communities from the benefits of the intervention. This has motivated research on fair influence maximization. Existing techniques come with two major drawbacks. First, they require committing to a single fairness measure. Second, these measures are typically imposed as strict constraints leading to undesirable properties such as wastage of resources. To address these shortcomings, we provide a principled characterization of the properties that a fair influence maximization algorithm should satisfy. In particular, we propose a framework based on social welfare theory, wherein the cardinal utilities derived by each community are aggregated using the isoelastic social welfare functions. Under this framework, the trade-off between fairness and efficiency can be controlled by a single inequality aversion design parameter. We then show under what circumstances our proposed principles can be satisfied by a welfare function. The resulting optimization problem is monotone and submodular and can be solved efficiently with optimality guarantees. Our framework encompasses as special cases leximin and proportional fairness. Extensive experiments on synthetic and real world datasets including a case study on landslide risk management demonstrate the efficacy of the proposed framework.