{"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/socially-fair-mitigation-of-misinformation-on","title":"Socially Fair Mitigation of Misinformation on Social Networks via Constraint Stochastic Optimization","arxiv_id":"2203.12537","date":"2022-03-23","proceeding":null,"authors":["Ahmed Abouzeid","Ole-Christoffer Granmo","Christian Webersik","Morten Goodwin"],"abstract":"Recent social networks' misinformation mitigation approaches tend to investigate how to reduce misinformation by considering a whole-network statistical scale. However, unbalanced misinformation exposures among individuals urge to study fair allocation of mitigation resources. Moreover, the network has random dynamics which change over time. Therefore, we introduce a stochastic and non-stationary knapsack problem, and we apply its resolution to mitigate misinformation in social network campaigns. We further propose a generic misinformation mitigation algorithm that is robust to different social networks' misinformation statistics, allowing a promising impact in real-world scenarios. A novel loss function ensures fair mitigation among users. We achieve fairness by intelligently allocating a mitigation incentivization budget to the knapsack, and optimizing the loss function. To this end, a team of Learning Automata (LA) drives the budget allocation. Each LA is associated with a user and learns to minimize its exposure to misinformation by performing a non-stationary and stochastic walk over its state space. Our results show how our LA-based method is robust and outperforms similar misinformation mitigation methods in how the mitigation is fairly influencing the network users.","url_abs":"https://arxiv.org/abs/2203.12537v1","url_pdf":"https://arxiv.org/pdf/2203.12537v1.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":"abstracts"},"code_links":[{"paper_slug":"socially-fair-mitigation-of-misinformation-on","repo_url":"https://github.com/ahmed-abouzeid/mmss","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":0,"framework":"none","reach":{"status":"ok","spdx":"MIT"}}],"tasks":[{"task_slug":"fairness","task_name":"Fairness"},{"task_slug":"misinformation","task_name":"Misinformation"},{"task_slug":"stochastic-optimization","task_name":"Stochastic Optimization"}],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"syntology_url":"https://syntology.ai/paper/2203.12537","atlas_url":"https://app.syntology.ai/?focus=2203.12537","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2203.12537"}},"developers":"https://syntology.ai/developers","read_at":"2026-09-25T09:33:49+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":"deterministic:regex_extraction","url":"https://github.com/Ahmed-Abouzeid/MMSS","reach":{"status":"ok","spdx":"MIT"}}],"summary":{"ran":5,"unverified":1},"by_repo_kind":{"official":{"samples":6,"ran":5,"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":0,"samples":[{"code_sha256_prefix":"b5e5a69bb15c1b59","entry":"calc_avg_abs_err","repo":"Ahmed-Abouzeid/MMSS","repo_kind":"official","path":"utils.py","file_url":"https://github.com/Ahmed-Abouzeid/MMSS/blob/HEAD/utils.py","link_basis":"harvester_set","language":"python","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"mcp_get_code":{"code_sha256":"b5e5a69bb15c1b59"}},{"code_sha256_prefix":"e35cad12997c7db0","entry":"calc_correlation","repo":"Ahmed-Abouzeid/MMSS","repo_kind":"official","path":"Comparable_Network_Measures.py","file_url":"https://github.com/Ahmed-Abouzeid/MMSS/blob/HEAD/Comparable_Network_Measures.py","link_basis":"harvester_set","language":"python","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"mcp_get_code":{"code_sha256":"e35cad12997c7db0"}},{"code_sha256_prefix":"23dc26db92702d83","entry":"calc_difference","repo":"Ahmed-Abouzeid/MMSS","repo_kind":"official","path":"Comparable_Network_Measures.py","file_url":"https://github.com/Ahmed-Abouzeid/MMSS/blob/HEAD/Comparable_Network_Measures.py","link_basis":"harvester_set","language":"python","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"mcp_get_code":{"code_sha256":"23dc26db92702d83"}},{"code_sha256_prefix":"0453cc4d59f4b1bd","entry":"get_counts","repo":"Ahmed-Abouzeid/MMSS","repo_kind":"official","path":"utils.py","file_url":"https://github.com/Ahmed-Abouzeid/MMSS/blob/HEAD/utils.py","link_basis":"harvester_set","language":"python","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"mcp_get_code":{"code_sha256":"0453cc4d59f4b1bd"}},{"code_sha256_prefix":"54d04c98589d7ac7","entry":"get_selected_users_per_stage","repo":"Ahmed-Abouzeid/MMSS","repo_kind":"official","path":"Comparable_Network_Measures.py","file_url":"https://github.com/Ahmed-Abouzeid/MMSS/blob/HEAD/Comparable_Network_Measures.py","link_basis":"harvester_set","language":"python","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"mcp_get_code":{"code_sha256":"54d04c98589d7ac7"}},{"code_sha256_prefix":"c3f9a17e8960e32d","entry":"get_network_metadata","repo":"Ahmed-Abouzeid/MMSS","repo_kind":"official","path":"utils.py","file_url":"https://github.com/Ahmed-Abouzeid/MMSS/blob/HEAD/utils.py","link_basis":"harvester_set","language":"python","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"mcp_get_code":{"code_sha256":"c3f9a17e8960e32d"}}]},"arxiv_metadata":null,"syntology_extracted_results":null}