In many real-world applications of reinforcement learning (RL), deployed policies have varied impacts on different stakeholders, creating challenges in reaching consensus on how to effectively aggregate their preferences. Generalized -means form a widely used class of social welfare functions for this purpose, with broad applications in fair resource allocation, AI alignment, and decision-making. This class includes well-known welfare functions such as Egalitarian, Nash, and Utilitarian welfare. However, selecting the appropriate social welfare function is challenging for decision-makers, as the structure and outcomes of optimal policies can be highly sensitive to the choice of . To address this challenge, we study the concept of an -approximate portfolio in RL, a set of policies that are approximately optimal across the family of generalized -means for all . We propose algorithms to compute such portfolios and provide theoretical guarantees on the trade-offs among approximation factor, portfolio size, and computational efficiency. Experimental results on synthetic and real-world datasets demonstrate the effectiveness of our approach in summarizing the policy space induced by varying values, empowering decision-makers to navigate this landscape more effectively.
View on arXiv@article{kim2025_2502.09724, title={ Navigating the Social Welfare Frontier: Portfolios for Multi-objective Reinforcement Learning }, author={ Cheol Woo Kim and Jai Moondra and Shresth Verma and Madeleine Pollack and Lingkai Kong and Milind Tambe and Swati Gupta }, journal={arXiv preprint arXiv:2502.09724}, year={ 2025 } }