mlsanityData to 7 Oct 2026

Revealing Positive and Negative Role Models to Help People Make Good Decisions

arXiv 2603.02495 ↗First posted 3 Mar 2026cs.AIcited by 0

Not on the map. Why?

Abstract (arXiv)

We consider a setting where agents take action by following their role models in a social network, and study strategies for a social planner to help agents by revealing whether the role models are positive or negative. Specifically, agents observe a local neighborhood of possible role models they can emulate, but do not know their true labels. Revealing a positive label encourages emulation, while revealing a negative one redirects agents toward alternative options. The social planner observes all labels, but operates under a limited disclosure budget that it selectively allocates to maximize social welfare (the expected number of agents who emulate adjacent positive role models). We consider both algorithms and hardness results for welfare maximization, and provide a sample-complexity guarantee when the planner observes a sampled subset of agents. We also consider fairness guarantees when agents belong to different groups. It is a technical challenge that the ability to reveal negative role models breaks submodularity. We thus introduce a proxy welfare function that remains submodular even when revealed targets include negative ones. When each agent has at most a constant number of negative target neighbors, we use this proxy to achieve a constant-factor approximation to the true optimal welfare gain. When agents belong to different groups, we also show that each group's welfare gain is within a constant factor of the optimum achievable if the full budget were allocated to that group. Beyond this basic model, we also propose an intervention model that directly connects high-risk agents to positive role models, and a coverage radius model that expands the visibility of selected positive role models. Lastly, we conduct extensive experiments on four real-world datasets to support our theoretical results and assess the effectiveness of the proposed algorithms.

Key facts. No citing papers in the map yet (data through 7 Oct 2026). Builds on 22 of its 39 references that are in the map. First posted on arXiv 3 Mar 2026.

Builds on

22 of 39 references.

References · 22

  1. 2020Counterfactual Explanations and Algorithmic Recourses for Machine Learning: A Reviewcited by 174
  2. 2021Strategic Classification in the Darkcited by 66
  3. 2019On the Long-term Impact of Algorithmic Decision Policies: Effort Unfairness and Feature Segregation through Social Learningcited by 48
  4. 2021Information Discrepancy in Strategic Learningcited by 48
  5. 2020Decisions, Counterfactual Explanations and Strategic Behaviorcited by 44
  6. 2022On classification of strategic agents who can both game and improvecited by 27
  7. 2023GLOBE-CE: A Translation-Based Approach for Global Counterfactual Explanationscited by 27
  8. 2022Learning Losses for Strategic Classificationcited by 22
  9. 2019Influence maximization in unknown social networks: Learning Policies for Effective Graph Samplingcited by 20
  10. 2021Unintended Selection: Persistent Qualification Rate Disparities and Interventionscited by 18
  11. 2024Learnability Gaps of Strategic Classificationcited by 16
  12. 2022A Survey on Influence Maximization: From an ML-Based Combinatorial Optimizationcited by 15
10 more
  1. 2024Bayesian Strategic Classificationcited by 12
  2. 2023Generating collective counterfactual explanations in score-based classification via mathematical optimizationcited by 9
  3. 2024Learning under Imitative Strategic Behavior with Unforeseeable Outcomescited by 8
  4. 2024Strategic Littlestone Dimension: Improved Bounds on Online Strategic Classificationcited by 8
  5. 2024GLANCE: Global Actions in a Nutshell for Counterfactual Explainabilitycited by 6
  6. 2025PAC Learning with Improvementscited by 6
  7. 2025How Strategic Agents Respond: Comparing Analytical Models with LLM-Generated Responses in Strategic Classificationcited by 4
  8. 2016Scalable Influence Maximization for Multiple Products in Continuous-Time Diffusion Networkscited by 1
  9. 2024Learning Actionable Counterfactual Explanations in Large State Spacescited by 1
  10. 2025The Active and Noise-Tolerant Strategic Perceptroncited by 1

Built on by

Not cited yet.