Setting the Right Expectations: Algorithmic Recourse Over Time
Not on the map. Why?
Abstract (arXiv)
Algorithmic systems are often called upon to assist in high-stakes decision making. In light of this, algorithmic recourse, the principle wherein individuals should be able to take action against an undesirable outcome made by an algorithmic system, is receiving growing attention. The bulk of the literature on algorithmic recourse to-date focuses primarily on how to provide recourse to a single individual, overlooking a critical element: the effects of a continuously changing context. Disregarding these effects on recourse is a significant oversight, since, in almost all cases, recourse consists of an individual making a first, unfavorable attempt, and then being given an opportunity to make one or several attempts at a later date - when the context might have changed. This can create false expectations, as initial recourse recommendations may become less reliable over time due to model drift and competition for access to the favorable outcome between individuals. In this work we propose an agent-based simulation framework for studying the effects of a continuously changing environment on algorithmic recourse. In particular, we identify two main effects that can alter the reliability of recourse for individuals represented by the agents: (1) competition with other agents acting upon recourse, and (2) competition with new agents entering the environment. Our findings highlight that only a small set of specific parameterizations result in algorithmic recourse that is reliable for agents over time. Consequently, we argue that substantial additional work is needed to understand recourse reliability over time, and to develop recourse methods that reward agents' effort.
Key facts. Cited by 13 papers in the map (data through 7 Oct 2026). Builds on 20 of its 38 references that are in the map. First posted on arXiv 13 Sep 2023.
Builds on
20 of 38 references.
References · 20
- 2018Actionable Recourse in Linear Classificationcited by 327
- 2020Algorithmic Recourse: from Counterfactual Explanations to Interventionscited by 250
- 2020Problems with Shapley-value-based explanations as feature importance measurescited by 198
- 2019Mitigating Bias in Algorithmic Hiring: Evaluating Claims and Practicescited by 170
- 2020Algorithmic recourse under imperfect causal knowledge: a probabilistic approachcited by 139
- 2020A survey of algorithmic recourse: definitions, formulations, solutions, and prospectscited by 118
- 2019The Hidden Assumptions Behind Counterfactual Explanations and Principal Reasonscited by 115
- 2021Towards Robust and Reliable Algorithmic Recoursecited by 101
- 2020On Counterfactual Explanations under Predictive Multiplicitycited by 73
- 2020On the Fairness of Causal Algorithmic Recoursecited by 69
- 2022Probabilistically Robust Recourse: Navigating the Trade-offs between Costs and Robustness in Algorithmic Recoursecited by 40
- 2021A Survey on the Robustness of Feature Importance and Counterfactual Explanationscited by 38
8 more
- 2020Algorithmic Recourse in the Wild: Understanding the Impact of Data and Model Shiftscited by 34
- 2022On the Robustness of Sparse Counterfactual Explanations to Adverse Perturbationscited by 32
- 2023Generating robust counterfactual explanationscited by 13
- 2023Robustness Implies Fairness in Causal Algorithmic Recoursecited by 12
- 2023Endogenous Macrodynamics in Algorithmic Recoursecited by 9
- 2022Think About the Stakeholders First! Towards an Algorithmic Transparency Playbook for Regulatory Compliancecited by 7
- 2022From Explanation to Recommendation: Ethical Standards for Algorithmic Recoursecited by 6
- 2021Multi-Agent Algorithmic Recoursecited by 2
Built on by
Citing papers per year: 2024: 4; 2025: 5; 2026: 4.
13 papers.
Sort:
- 2024Robust Counterfactual Explanations in Machine Learning: A Surveycited by 29
- 2024Fairness in Algorithmic Recourse Through the Lens of Substantive Equality of Opportunitycited by 9
- 2024Time Can Invalidate Algorithmic Recoursecited by 8
- 2025Performative Validity of Recourse Explanationscited by 8
- 2026Explanation Multiplicity in SHAP: Characterization and Assessmentcited by 5
- 2024Learning-Augmented Robust Algorithmic Recoursecited by 4
- 2025Optimal Robust Recourse with Lp-Bounded Model Changecited by 3
- 2025Reinforcement Learning for Durable Algorithmic Recoursecited by 3
- 2025Understanding Endogenous Data Drift in Adaptive Models with Recourse-Seeking Userscited by 1
- 2025Your Recourse, My Loss? Algorithmic Recourse under Shared Constraintscited by 1
- 2026From Universal to Individualized Actionability: Revisiting Personalization in Algorithmic Recoursecited by 1
- 2026Update Opacity: Epistemic Accessibility and Governance Under AI System Changecited by 1
1 more
- 2026Algorithmic Recourse Under Competitioncited by 0
- 2026Algorithmic Recourse Under Competition30 Sep 2026
- 2026Update Opacity: Epistemic Accessibility and Governance Under AI System Change27 Apr 2026
- 2026From Universal to Individualized Actionability: Revisiting Personalization in Algorithmic Recourse9 Apr 2026
- 2026Explanation Multiplicity in SHAP: Characterization and Assessment19 Jan 2026
- 2025Reinforcement Learning for Durable Algorithmic Recourse26 Sep 2025
- 2025Optimal Robust Recourse with Lp-Bounded Model Change25 Sep 2025
- 2025Your Recourse, My Loss? Algorithmic Recourse under Shared Constraints14 Aug 2025
- 2025Performative Validity of Recourse Explanations18 Jun 2025
- 2025Understanding Endogenous Data Drift in Adaptive Models with Recourse-Seeking Users12 Mar 2025
- 2024Time Can Invalidate Algorithmic Recourse10 Oct 2024
- 2024Learning-Augmented Robust Algorithmic Recourse2 Oct 2024
- 2024Robust Counterfactual Explanations in Machine Learning: A Survey2 Feb 2024
- 2024Robust Counterfactual Explanations in Machine Learning: A Surveycited by 29
- 2024Fairness in Algorithmic Recourse Through the Lens of Substantive Equality of Opportunitycited by 9
- 2024Time Can Invalidate Algorithmic Recoursecited by 8
- 2025Performative Validity of Recourse Explanationscited by 8
- 2026Explanation Multiplicity in SHAP: Characterization and Assessmentcited by 5
- 2024Learning-Augmented Robust Algorithmic Recoursecited by 4
- 2025Optimal Robust Recourse with Lp-Bounded Model Changecited by 3
- 2025Reinforcement Learning for Durable Algorithmic Recoursecited by 3
- 2025Understanding Endogenous Data Drift in Adaptive Models with Recourse-Seeking Userscited by 1
- 2025Your Recourse, My Loss? Algorithmic Recourse under Shared Constraintscited by 1
- 2026From Universal to Individualized Actionability: Revisiting Personalization in Algorithmic Recoursecited by 1
- 2026Update Opacity: Epistemic Accessibility and Governance Under AI System Changecited by 1
12 most cited of 13 All 13 (JSON)
- 2026Algorithmic Recourse Under Competition30 Sep 2026
- 2026Update Opacity: Epistemic Accessibility and Governance Under AI System Change27 Apr 2026
- 2026From Universal to Individualized Actionability: Revisiting Personalization in Algorithmic Recourse9 Apr 2026
- 2026Explanation Multiplicity in SHAP: Characterization and Assessment19 Jan 2026
- 2025Reinforcement Learning for Durable Algorithmic Recourse26 Sep 2025
- 2025Optimal Robust Recourse with Lp-Bounded Model Change25 Sep 2025
- 2025Your Recourse, My Loss? Algorithmic Recourse under Shared Constraints14 Aug 2025
- 2025Performative Validity of Recourse Explanations18 Jun 2025
- 2025Understanding Endogenous Data Drift in Adaptive Models with Recourse-Seeking Users12 Mar 2025
- 2024Time Can Invalidate Algorithmic Recourse10 Oct 2024
- 2024Learning-Augmented Robust Algorithmic Recourse2 Oct 2024
- 2024Robust Counterfactual Explanations in Machine Learning: A Survey2 Feb 2024
12 newest of 13 All 13 (JSON)