Multiwinner Temporal Voting with Aversion to Change

Valentin Zech, Niclas Boehmer, Edith Elkind, Nicholas Teh
{"title":"Multiwinner Temporal Voting with Aversion to Change","authors":"Valentin Zech, Niclas Boehmer, Edith Elkind, Nicholas Teh","doi":"arxiv-2408.11017","DOIUrl":null,"url":null,"abstract":"We study two-stage committee elections where voters have dynamic preferences\nover candidates; at each stage, a committee is chosen under a given voting\nrule. We are interested in identifying a winning committee for the second stage\nthat overlaps as much as possible with the first-stage committee. We show a\nfull complexity dichotomy for the class of Thiele rules: this problem is\ntractable for Approval Voting (AV) and hard for all other Thiele rules\n(including, in particular, Proportional Approval Voting and the\nChamberlin-Courant rule). We extend this dichotomy to the greedy variants of\nThiele rules. We also explore this problem from a parameterized complexity\nperspective for several natural parameters. We complement the theory with\nexperimental analysis: e.g., we investigate the average number of changes in\nthe committee as a function of changes in voters' preferences and the role of\nties.","PeriodicalId":501316,"journal":{"name":"arXiv - CS - Computer Science and Game Theory","volume":"204 1","pages":""},"PeriodicalIF":0.0000,"publicationDate":"2024-08-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"arXiv - CS - Computer Science and Game Theory","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/arxiv-2408.11017","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

We study two-stage committee elections where voters have dynamic preferences over candidates; at each stage, a committee is chosen under a given voting rule. We are interested in identifying a winning committee for the second stage that overlaps as much as possible with the first-stage committee. We show a full complexity dichotomy for the class of Thiele rules: this problem is tractable for Approval Voting (AV) and hard for all other Thiele rules (including, in particular, Proportional Approval Voting and the Chamberlin-Courant rule). We extend this dichotomy to the greedy variants of Thiele rules. We also explore this problem from a parameterized complexity perspective for several natural parameters. We complement the theory with experimental analysis: e.g., we investigate the average number of changes in the committee as a function of changes in voters' preferences and the role of ties.
厌恶变化的多赢家时空投票
我们研究的是选民对候选人有动态偏好的两阶段委员会选举;在每个阶段,根据给定的投票规则选出一个委员会。我们感兴趣的是为第二阶段确定一个获胜的委员会,该委员会要尽可能与第一阶段的委员会重叠。我们展示了蒂勒规则类的完全复杂性二分法:对于赞成票(AV)来说,这个问题很容易解决,而对于所有其他蒂勒规则(尤其包括比例赞成票和康伯林-库朗规则)来说,这个问题很难解决。我们将这种二分法扩展到蒂勒规则的贪婪变体。我们还从参数化复杂性的角度探讨了几个自然参数的问题。我们用实验分析对理论进行了补充:例如,我们研究了委员会中的平均变化次数与选民偏好变化和因素作用的函数关系。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信