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.