Learning Fair Policies In Multiobjective (deep) Reinforcement Learning With Average And Discounted Rewards

Abstract

As the operations of autonomous systems generally affect simultaneously several users, it is crucial that their designs account for fairness considerations. In contrast to standard (deep) reinforcement learning (RL), we investigate the problem of learning a policy that treats its users equitably. In this paper, we formulate this novel RL problem, in which an objective function, which encodes a notion of fairness that we formally define, is optimized. For this problem, we provide a theoretical discussion where we examine the case of discounted rewards and that of average rewards. During this analysis, we notably derive a new result in the standard RL setting, which is of independent interest: it states a novel bound on the approximation error with respect to the optimal average reward of that of a policy optimal for the discounted reward. Since learning with discounted rewards is generally easier, this discussion further justifies finding a fair policy for the average reward by learning

Stats

• citations0
• S2 citations—
• github stars0
• HF likes0
• heat score0.00
• arxiv keysiddique2020learning

Related papers

• Examining Average And Discounted Reward Optimality Criteria In Reinforcement Learning (2021)0.00
• Achieving Fairness In Multi-agent Markov Decision Processes Using Reinforcement Learning (2023)0.00
• Analyzing And Bridging The Gap Between Maximizing Total Reward And Discounted Reward In Deep Reinforcement Learning (2024)0.00
• Socially Fair Reinforcement Learning (2022)0.00
• What Hides Behind Unfairness? Exploring Dynamics Fairness In Reinforcement Learning (2024)0.95
• Striking A Balance In Fairness For Dynamic Systems Through Reinforcement Learning (2024)2.26
• Performance Bounds For Policy-based Average Reward Reinforcement Learning Algorithms (2023)2.26
• Fairness In Reinforcement Learning (2016)0.00