Rules for Choosing Societal Tradeoffs
Abstract
We study the societal tradeoffs problem, where a set of voters each submit their ideal tradeoff value between each pair of activities (e.g., "using a gallon of gasoline is as bad as creating 2 bags of landfill trash"), and these are then aggregated into the societal tradeoff vector using a rule. We introduce the family of distance-based rules and show that these can be justified as maximum likelihood estimators of the truth. Within this family, we single out the logarithmic distance-based rule as especially appealing based on a social-choice-theoretic axiomatization. We give an efficient algorithm for executing this rule as well as an approximate hill climbing algorithm, and evaluate these experimentally.
Cite
Text
Conitzer et al. "Rules for Choosing Societal Tradeoffs." AAAI Conference on Artificial Intelligence, 2016. doi:10.1609/AAAI.V30I1.10055Markdown
[Conitzer et al. "Rules for Choosing Societal Tradeoffs." AAAI Conference on Artificial Intelligence, 2016.](https://mlanthology.org/aaai/2016/conitzer2016aaai-rules/) doi:10.1609/AAAI.V30I1.10055BibTeX
@inproceedings{conitzer2016aaai-rules,
title = {{Rules for Choosing Societal Tradeoffs}},
author = {Conitzer, Vincent and Freeman, Rupert and Brill, Markus and Li, Yuqian},
booktitle = {AAAI Conference on Artificial Intelligence},
year = {2016},
pages = {460-467},
doi = {10.1609/AAAI.V30I1.10055},
url = {https://mlanthology.org/aaai/2016/conitzer2016aaai-rules/}
}