Striking A Balance In Fairness For Dynamic Systems Through Reinforcement Learning

Abstract

While significant advancements have been made in the field of fair machine learning, the majority of studies focus on scenarios where the decision model operates on a static population. In this paper, we study fairness in dynamic systems where sequential decisions are made. Each decision may shift the underlying distribution of features or user behavior. We model the dynamic system through a Markov Decision Process (MDP). By acknowledging that traditional fairness notions and long-term fairness are distinct requirements that may not necessarily align with one another, we propose an algorithmic framework to integrate various fairness considerations with reinforcement learning using both pre-processing and in-processing approaches. Three case studies show that our method can strike a balance between traditional fairness notions, long-term fairness, and utility.

Stats

• citations1
• S2 citations—
• github stars0
• HF likes0
• heat score2.26
• arxiv keyhu2024striking

Related papers

• Achieving Fairness In Multi-agent Markov Decision Processes Using Reinforcement Learning (2023)0.00
• What Hides Behind Unfairness? Exploring Dynamics Fairness In Reinforcement Learning (2024)0.95
• Past-discounting Is Key For Learning Markovian Fairness With Long Horizons (2025)0.00
• The Fair Game: Auditing & Debiasing AI Algorithms Over Time (2025)2.26
• Learning Fair Policies In Multiobjective (deep) Reinforcement Learning With Average And Discounted Rewards (2020)0.00
• Fairness In Reinforcement Learning (2016)0.00
• Counterfactually Fair Reinforcement Learning Via Sequential Data Preprocessing (2025)0.00
• Socially Fair Reinforcement Learning (2022)0.00