Sign inGet started
Paper · arXiv

Fair Policy Optimization in Major-Minor Weakly Coupled Markov Decision Processes

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 \texti...

AuthorsXiaohui Tu, Yossiri Adulyasak, Erick Delage
Primary categorycs.LG
Published28 September 2026
Last updated at source28 September 2026
cs.LG
Embed this entry
<iframe src="https://silytics.si/embed/item/7bb6c2d2-b659-4ac8-b461-7d9979b21ae4" width="420" height="190" style="border:0" loading="lazy" title="Silytics entry"></iframe>

Free, no tracking. More about feeds and embeds.

Silytics shows public metadata from arXiv and links to the original. Information may be incomplete or out of date. Last refreshed 17 October 2026. Licenses and terms of the original apply to the work itself. Not financial, legal or professional advice.