Policy Aggregation

P. A. Alamdari, Soroush Ebadian, Ariel D. Procaccia
2/3/2026

No official code found. Best implementation: praal/policy-aggregation (0 stars, MIT, last commit 2024-10-28).

Abstract

We consider the challenge of AI value alignment with multiple individuals that have different reward functions and optimal policies in an underlying Markov decision process. We formalize this problem as one of policy aggregation, where the goal is to identify a desirable collective policy. We argue that an approach informed by social choice theory is especially suitable. Our key insight is that social choice methods can be reinterpreted by identifying ordinal preferences with volumes of subsets of the state-action occupancy polytope. Building on this insight, we demonstrate that a variety of methods--including approval voting, Borda count, the proportional veto core, and quantile fairness--can be practically applied to policy aggregation.

View on arXivView PDF

Code Implementations(1)

MIT
01PythonOct 28, 20241 years agoMIT

Similar Papers

Cite this paper

@article{alamdari2026policy,
  title  = {Policy Aggregation},
  author = {P. A. Alamdari and Soroush Ebadian and Ariel D. Procaccia},
  year   = {2026},
  eprint = {2411.03651},
  archivePrefix = {arXiv},
  doi    = {10.48550/arXiv.2411.03651},
  url    = {https://arxiv.org/abs/2411.03651},
  journal = {NEURIPS 2024 2024}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/2411.03651.svg)](https://codeofpaper.com/paper/2411.03651)

Discussion