{"about":{"site":"https://codewithpapers.app","non_affiliation":"Code with Papers and Syntology are not affiliated with, endorsed by, or sponsored by Papers with Code, Meta, or the pwc-archive mirror.","licence":"CC BY-SA 4.0","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","attribution":"https://codewithpapers.app/attribution","modified":"archive material modified by Syntology; see the attribution page"},"url":"/paper/group-fairness-in-influence-maximization","title":"Group-Fairness in Influence Maximization","arxiv_id":"1903.00967","date":"2019-03-03","proceeding":null,"authors":["Alan Tsang","Bryan Wilder","Eric Rice","Milind Tambe","Yair Zick"],"abstract":"Influence maximization is a widely used model for information dissemination in social networks. Recent work has employed such interventions across a wide range of social problems, spanning public health, substance abuse, and international development (to name a few examples). A critical but understudied question is whether the benefits of such interventions are fairly distributed across different groups in the population; e.g., avoiding discrimination with respect to sensitive attributes such as race or gender. Drawing on legal and game-theoretic concepts, we introduce formal definitions of fairness in influence maximization. We provide an algorithmic framework to find solutions which satisfy fairness constraints, and in the process improve the state of the art for general multi-objective submodular maximization problems. Experimental results on real data from an HIV prevention intervention for homeless youth show that standard influence maximization techniques oftentimes neglect smaller groups which contribute less to overall utility, resulting in a disparity which our proposed algorithms substantially reduce.","url_abs":"http://arxiv.org/abs/1903.00967v2","url_pdf":"http://arxiv.org/pdf/1903.00967v2.pdf","source":{"archive":"pwc-archive (Hugging Face), CC BY-SA 4.0","snapshot":"2025-07-28","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","row_kind":"links_only","authors_date_abstract":"arXiv metadata, CC0 1.0 (https://info.arxiv.org/help/license), from the Kaggle arXiv metadata snapshot of 2026-09-12"},"code_links":[{"paper_slug":"group-fairness-in-influence-maximization","repo_url":"https://github.com/bwilder0/fair_influmax_code_release","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"none","reach":null}],"tasks":[],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"syntology_url":null,"atlas_url":"https://app.syntology.ai/?focus=1903.00967","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1903.00967"}},"developers":"https://syntology.ai/developers","read_at":"2026-09-24T18:15:14+00:00","read_at_is":"when the build read Syntology's graph, not when any sample ran","claim":"Per-sample execution status on synthesized fixtures; not a correctness claim about the paper. Samples come from repositories linked to the paper, official or community; repo_kind says which.","repos":[{"provenance":"external:paperswithcode_snapshot_2025-07-28","url":"https://github.com/bwilder0/fair_influmax_code_release","reach":null}],"summary":{"ran_honours":1,"ran_draft_wrong":2,"unverified":1},"by_repo_kind":{"listed":{"samples":4,"ran":3,"repositories":1}},"repo_kind_vocabulary":{"official":"The archive marks this repository official for the paper","named_in_paper":"The archive records that the paper mentions this repository; it is not marked official","listed":"In the archive's code links for this paper, not marked official and not recorded as mentioned in the paper","found_in_text":"Syntology found this repository in the paper's own text; whether it is the authors' implementation is not asserted","community":"Not in the archive's code links for this paper; a community repository Syntology harvested"},"n_pointer_only_for_licence":4,"samples":[{"code_sha256_prefix":"8ef536d5c256abeb","entry":"indicator","repo":"bwilder0/fair_influmax_code_release","repo_kind":"listed","path":"algorithms.py","file_url":"https://github.com/bwilder0/fair_influmax_code_release/blob/HEAD/algorithms.py","link_basis":"first_harvest_node","language":"python","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"well_formed","behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"mcp_get_code":{"code_sha256":"8ef536d5c256abeb"}},{"code_sha256_prefix":"4734873e8c4c6302","entry":"multi_to_set","repo":"bwilder0/fair_influmax_code_release","repo_kind":"listed","path":"algorithms.py","file_url":"https://github.com/bwilder0/fair_influmax_code_release/blob/HEAD/algorithms.py","link_basis":"first_harvest_node","language":"python","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"mcp_get_code":{"code_sha256":"4734873e8c4c6302"}},{"code_sha256_prefix":"d9cf44040eb7dab8","entry":"valoracle_to_single","repo":"bwilder0/fair_influmax_code_release","repo_kind":"listed","path":"check_fairness.py","file_url":"https://github.com/bwilder0/fair_influmax_code_release/blob/HEAD/check_fairness.py","link_basis":"first_harvest_node","language":"python","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"mcp_get_code":{"code_sha256":"d9cf44040eb7dab8"}},{"code_sha256_prefix":"7e5c25ab6cea44a9","entry":"make_weighted","repo":"bwilder0/fair_influmax_code_release","repo_kind":"listed","path":"algorithms.py","file_url":"https://github.com/bwilder0/fair_influmax_code_release/blob/HEAD/algorithms.py","link_basis":"first_harvest_node","language":"python","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"mcp_get_code":{"code_sha256":"7e5c25ab6cea44a9"}}]},"arxiv_metadata":null,"syntology_extracted_results":null}