The Price of Justified Representation
Fuente:
arXiv
Saved in:
| Main Authors: | , , , , , |
|---|---|
| Format: | Preprint |
| Published: |
2021
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866912017564041216 |
|---|---|
| author | Elkind, Edith Faliszewski, Piotr Igarashi, Ayumi Manurangsi, Pasin Schmidt-Kraepelin, Ulrike Suksompong, Warut |
| author_facet | Elkind, Edith Faliszewski, Piotr Igarashi, Ayumi Manurangsi, Pasin Schmidt-Kraepelin, Ulrike Suksompong, Warut |
| contents | In multiwinner approval voting, the goal is to select $k$-member committees based on voters' approval ballots. A well-studied concept of proportionality in this context is the justified representation (JR) axiom, which demands that no large cohesive group of voters remains unrepresented. However, the JR axiom may conflict with other desiderata, such as coverage (maximizing the number of voters who approve at least one committee member) or social welfare (maximizing the number of approvals obtained by committee members). In this work, we investigate the impact of imposing the JR axiom (as well as the more demanding EJR axiom) on social welfare and coverage. Our approach is threefold: we derive worst-case bounds on the loss of welfare/coverage that is caused by imposing JR, study the computational complexity of finding 'good' committees that provide JR (obtaining a hardness result, an approximation algorithm, and an exact algorithm for one-dimensional preferences), and examine this setting empirically on several synthetic datasets. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2112_05994 |
| institution | arXiv |
| publishDate | 2021 |
| record_format | arxiv |
| spellingShingle | The Price of Justified Representation Elkind, Edith Faliszewski, Piotr Igarashi, Ayumi Manurangsi, Pasin Schmidt-Kraepelin, Ulrike Suksompong, Warut Computer Science and Game Theory Computational Complexity Data Structures and Algorithms In multiwinner approval voting, the goal is to select $k$-member committees based on voters' approval ballots. A well-studied concept of proportionality in this context is the justified representation (JR) axiom, which demands that no large cohesive group of voters remains unrepresented. However, the JR axiom may conflict with other desiderata, such as coverage (maximizing the number of voters who approve at least one committee member) or social welfare (maximizing the number of approvals obtained by committee members). In this work, we investigate the impact of imposing the JR axiom (as well as the more demanding EJR axiom) on social welfare and coverage. Our approach is threefold: we derive worst-case bounds on the loss of welfare/coverage that is caused by imposing JR, study the computational complexity of finding 'good' committees that provide JR (obtaining a hardness result, an approximation algorithm, and an exact algorithm for one-dimensional preferences), and examine this setting empirically on several synthetic datasets. |
| title | The Price of Justified Representation |
| topic | Computer Science and Game Theory Computational Complexity Data Structures and Algorithms |
| url | https://arxiv.org/abs/2112.05994 |