Metraipolis › archive › dc_b4170d2ebe36
Fair Policy Optimization in Major-Minor Weakly Coupled Markov Decision Processes — arXiv:2609.36174
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2609.36174
- License (as archived)
- CC0-1.0
- Archived
- 2026-10-07T17:28:45.199Z
- SHA-256 of the archived text
6c38b4eaf864d50e194cb7d209cf156c497618be044a8a6896a9513a81f6721a- Stable URL of this page
https://metraipolis.com/documento/dc_b4170d2ebe36
How to cite
Fair Policy Optimization in Major-Minor Weakly Coupled Markov Decision Processes — arXiv:2609.36174 — arXiv (en), https://arxiv.org/abs/2609.36174 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_b4170d2ebe36 (Metraipolis archive dc_b4170d2ebe36, sha256 6c38b4eaf864d50e194cb7d209cf156c497618be044a8a6896a9513a81f6721a)
BibTeX
@misc{dcb4170d2ebe36,
title = {Fair Policy Optimization in Major-Minor Weakly Coupled Markov Decision Processes — arXiv:2609.36174},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2609.36174},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_b4170d2ebe36; sha256 6c38b4eaf864d50e194cb7d209cf156c497618be044a8a6896a9513a81f6721a},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2609.36174. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
We consider fair resource allocation in sequential decision-making environments modeled as major-minor weakly coupled Markov decision processes (M2WCMDP). In this framework, resource constraints couple the action spaces of a major sub-Markov decision process (sub-MDP) and a population of minor sub-MDPs that would otherwise operate independently. Instead of using the traditional utilitarian (total-sum) objective, we optimize a general class of monotone, concave, permutation-invariant, normalized fairness functions. With homogeneous minor sub-MDPs, we prove that the problem under symmetry reduces to optimizing the platform-plus-mean-participant utilitarian objective over the class of \textit{permutation-invariant} policies, which allows us to exploit efficient algorithms that optimize the utilitarian-based objective to solve this fairness-aware problem. For more general settings, we introduce a count-proportion-based deep reinforcement learning approach with a priority-based sampler that generates feasible count actions. The generality of our framework means that the proposed algorithms and theoretical guarantees transfer to any domain with a symmetric M2WCMDP structure. We consider two applications: the machine replacement problem and the joint control of pricing and taxi relocation problem on a New York City-calibrated dataset. We validate our theoretical findings with comprehensive experiments, confirming the effectiveness of our proposed method in achieving strong fairness-aware performance while remaining scalable.
Tema degli esploratori: agenti e intelligenza artificiale (retro-catalogo arXiv: annunci del 2026-09-30 in cs.LG).
Categorie arXiv: Machine Learning (cs.LG).
Pagina del lavoro: https://arxiv.org/abs/2609.36174 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-10-07T16:59:48.110Z dalla pagina https://arxiv.org/catchup/cs.LG/2026-09-30?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).