Proportional Aggregation of Preferences for Sequential Decision Making
Fuente:
arXiv
Salvato in:
| Autori principali: | , , |
|---|---|
| Natura: | Preprint |
| Pubblicazione: |
2023
|
| Soggetti: | |
| Accesso online: | |
| Tags: |
Aggiungi Tag
Nessun Tag, puoi essere il primo ad aggiungerne!!
|
| _version_ | 1866910878292508672 |
|---|---|
| author | Chandak, Nikhil Goel, Shashwat Peters, Dominik |
| author_facet | Chandak, Nikhil Goel, Shashwat Peters, Dominik |
| contents | We study the problem of fair sequential decision making given voter preferences. In each round, a decision rule must choose a decision from a set of alternatives where each voter reports which of these alternatives they approve. Instead of going with the most popular choice in each round, we aim for proportional representation across rounds, using axioms inspired by the multi-winner voting literature. The axioms require that every group of $α\%$ of the voters that agrees in every round (i.e., approves a common alternative), must approve at least $α\%$ of the decisions. A stronger version of the axioms requires that every group of $α\%$ of the voters that agrees in a $β$ fraction of rounds must approve $β\cdotα\%$ of the decisions. We show that three attractive voting rules satisfy axioms of this style. One of them (Sequential Phragmén) makes its decisions online, and the other two satisfy strengthened versions of the axioms but make decisions semi-online (Method of Equal Shares) or fully offline (Proportional Approval Voting). We present empirical results for these rules based on synthetic data and U.S. political elections. We also run experiments using the moral machine dataset about ethical dilemmas: We train preference models on user responses from different countries and let the models cast votes. We find that aggregating these votes using our rules leads to a more equal utility distribution across demographics than making decisions using a single global preference model. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2306_14858 |
| institution | arXiv |
| publishDate | 2023 |
| record_format | arxiv |
| spellingShingle | Proportional Aggregation of Preferences for Sequential Decision Making Chandak, Nikhil Goel, Shashwat Peters, Dominik Computer Science and Game Theory Machine Learning We study the problem of fair sequential decision making given voter preferences. In each round, a decision rule must choose a decision from a set of alternatives where each voter reports which of these alternatives they approve. Instead of going with the most popular choice in each round, we aim for proportional representation across rounds, using axioms inspired by the multi-winner voting literature. The axioms require that every group of $α\%$ of the voters that agrees in every round (i.e., approves a common alternative), must approve at least $α\%$ of the decisions. A stronger version of the axioms requires that every group of $α\%$ of the voters that agrees in a $β$ fraction of rounds must approve $β\cdotα\%$ of the decisions. We show that three attractive voting rules satisfy axioms of this style. One of them (Sequential Phragmén) makes its decisions online, and the other two satisfy strengthened versions of the axioms but make decisions semi-online (Method of Equal Shares) or fully offline (Proportional Approval Voting). We present empirical results for these rules based on synthetic data and U.S. political elections. We also run experiments using the moral machine dataset about ethical dilemmas: We train preference models on user responses from different countries and let the models cast votes. We find that aggregating these votes using our rules leads to a more equal utility distribution across demographics than making decisions using a single global preference model. |
| title | Proportional Aggregation of Preferences for Sequential Decision Making |
| topic | Computer Science and Game Theory Machine Learning |
| url | https://arxiv.org/abs/2306.14858 |