Rules for Choosing Societal Tradeoffs
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...
| Main Authors: | , , , |
|---|---|
| Format: | Conference item |
| Published: |
Association for the Advancement of Artificial Intelligence
2016
|
| _version_ | 1826259407394045952 |
|---|---|
| author | Brill, M Freeman, R Conitzer, V Li, Y |
| author_facet | Brill, M Freeman, R Conitzer, V Li, Y |
| author_sort | Brill, M |
| collection | OXFORD |
| description | 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. |
| first_indexed | 2024-03-06T18:49:23Z |
| format | Conference item |
| id | oxford-uuid:0faa896d-a498-43c9-9d08-99a280345a18 |
| institution | University of Oxford |
| last_indexed | 2024-03-06T18:49:23Z |
| publishDate | 2016 |
| publisher | Association for the Advancement of Artificial Intelligence |
| record_format | dspace |
| spelling | oxford-uuid:0faa896d-a498-43c9-9d08-99a280345a182022-03-26T09:52:25ZRules for Choosing Societal TradeoffsConference itemhttp://purl.org/coar/resource_type/c_5794uuid:0faa896d-a498-43c9-9d08-99a280345a18Symplectic Elements at OxfordAssociation for the Advancement of Artificial Intelligence2016Brill, MFreeman, RConitzer, VLi, YWe 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. |
| spellingShingle | Brill, M Freeman, R Conitzer, V Li, Y Rules for Choosing Societal Tradeoffs |
| title | Rules for Choosing Societal Tradeoffs |
| title_full | Rules for Choosing Societal Tradeoffs |
| title_fullStr | Rules for Choosing Societal Tradeoffs |
| title_full_unstemmed | Rules for Choosing Societal Tradeoffs |
| title_short | Rules for Choosing Societal Tradeoffs |
| title_sort | rules for choosing societal tradeoffs |
| work_keys_str_mv | AT brillm rulesforchoosingsocietaltradeoffs AT freemanr rulesforchoosingsocietaltradeoffs AT conitzerv rulesforchoosingsocietaltradeoffs AT liy rulesforchoosingsocietaltradeoffs |