Past-discounting Is Key For Learning Markovian Fairness With Long Horizons

Abstract

Fairness is an important consideration for dynamic resource allocation in multi-agent systems. Many existing methods treat fairness as a one-shot problem without considering temporal dynamics, which misses the nuances of accumulating inequalities over time. Recent approaches overcome this limitation by tracking allocations over time, assuming perfect recall of all past utilities. While the former neglects long-term equity, the latter introduces a critical challenge: the augmented state space required to track cumulative utilities grows unboundedly with time, hindering the scalability and convergence of learning algorithms. Motivated by behavioral insights that human fairness judgments discount distant events, we introduce a framework for temporal fairness that incorporates past-discounting into the learning problem. This approach offers a principled interpolation between instantaneous and perfect-recall fairness. Our central contribution is a past-discounted framework for memory tracki

Stats

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

Related papers

• Striking A Balance In Fairness For Dynamic Systems Through Reinforcement Learning (2024)2.26
• 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
• Learning Fair Policies In Multiobjective (deep) Reinforcement Learning With Average And Discounted Rewards (2020)0.00
• Fairness In Reinforcement Learning (2016)0.00
• Socially Fair Reinforcement Learning (2022)0.00
• Agent-temporal Credit Assignment For Optimal Policy Preservation In Sparse Multi-agent Reinforcement Learning (2024)0.00
• Delayed Geometric Discounts: An Alternative Criterion For Reinforcement Learning (2022)0.00