The Metric Distortion of Randomized Social Choice Functions: C1 Maximal Lottery Rules and Simulations
Fuente:
arXiv
Saved in:
| Main Authors: | , |
|---|---|
| Format: | Preprint |
| Published: |
2024
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866912230120882176 |
|---|---|
| author | Frank, Fabian Lederer, Patrick |
| author_facet | Frank, Fabian Lederer, Patrick |
| contents | The metric distortion of a randomized social choice function (RSCF) quantifies its worst-case approximation ratio to the optimal social cost when the voters' costs for alternatives are given by distances in a metric space. This notion has recently attracted significant attention as numerous RSCFs that aim to minimize the metric distortion have been suggested. Since such tailored voting rules have, however, little normative appeal other than their low metric distortion, we will study the metric distortion of well-established RSCFs. Specifically, we first show that C1 maximal lottery rules, a well-known class of RSCFs, have a metric distortion of $4$, which is optimal within the class of majoritarian RSCFs. Secondly, we conduct extensive computer experiments on the metric distortion of RSCFs to obtain insights into their average-case performance. These computer experiments are based on a new linear program for computing the metric distortion of a lottery and reveal that the average-case metric distortion of some classical RSCFs is often only slightly worse than that of RSCFs tailored to minimize the metric distortion. Finally, we also analytically study the expected metric distortion of RSCFs for the impartial culture distribution. Specifically, we show that, under this distribution, every reasonable RSCF has an expected metric distortion close to $2$ when the number of voters is large. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2403_18340 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | The Metric Distortion of Randomized Social Choice Functions: C1 Maximal Lottery Rules and Simulations Frank, Fabian Lederer, Patrick Computer Science and Game Theory The metric distortion of a randomized social choice function (RSCF) quantifies its worst-case approximation ratio to the optimal social cost when the voters' costs for alternatives are given by distances in a metric space. This notion has recently attracted significant attention as numerous RSCFs that aim to minimize the metric distortion have been suggested. Since such tailored voting rules have, however, little normative appeal other than their low metric distortion, we will study the metric distortion of well-established RSCFs. Specifically, we first show that C1 maximal lottery rules, a well-known class of RSCFs, have a metric distortion of $4$, which is optimal within the class of majoritarian RSCFs. Secondly, we conduct extensive computer experiments on the metric distortion of RSCFs to obtain insights into their average-case performance. These computer experiments are based on a new linear program for computing the metric distortion of a lottery and reveal that the average-case metric distortion of some classical RSCFs is often only slightly worse than that of RSCFs tailored to minimize the metric distortion. Finally, we also analytically study the expected metric distortion of RSCFs for the impartial culture distribution. Specifically, we show that, under this distribution, every reasonable RSCF has an expected metric distortion close to $2$ when the number of voters is large. |
| title | The Metric Distortion of Randomized Social Choice Functions: C1 Maximal Lottery Rules and Simulations |
| topic | Computer Science and Game Theory |
| url | https://arxiv.org/abs/2403.18340 |