{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,9,24]],"date-time":"2026-09-24T01:58:54Z","timestamp":1790215134161,"version":"4.1.0"},"publisher-location":"California","reference-count":0,"publisher":"International Joint Conferences on Artificial Intelligence Organization","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2022,7]]},"abstract":"<jats:p>Electing a single committee of a small size is a classical and well-understood voting situation. Being interested in a sequence of committees, we introduce two time-dependent multistage models based on simple scoring-based voting. Therein, we are given a sequence of voting profiles (stages) over the same set of agents and candidates, and our task is to find a small committee for each stage of high score. In the conservative model we additionally require that any two consecutive committees have a small symmetric difference. Analogously, in the revolutionary model we require large symmetric differences. We prove both models to be NP-hard even for a constant number of agents, and, based on this, initiate a parameterized complexity analysis for the most natural parameters and combinations thereof. Among other results, we prove both models to be in XP yet W[1]-hard regarding the number of stages, and that being revolutionary seems to be \"easier\" than being conservative.<\/jats:p>","DOI":"10.24963\/ijcai.2022\/21","type":"proceedings-article","created":{"date-parts":[[2022,7,16]],"date-time":"2022-07-16T02:55:56Z","timestamp":1657940156000},"page":"144-150","source":"Crossref","is-referenced-by-count":2,"title":["When Votes Change and Committees Should (Not)"],"prefix":"10.24963","author":[{"given":"Robert","family":"Bredereck","sequence":"first","affiliation":[{"name":"TU Clausthal"},{"name":"Humboldt-Universit\u00e4t zu Berlin"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Till","family":"Fluschnik","sequence":"additional","affiliation":[{"name":"Technische Universit\u00e4t Berlin"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Andrzej","family":"Kaczmarczyk","sequence":"additional","affiliation":[{"name":"Technische Universit\u00e4t Berlin"},{"name":"AGH University"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"10584","event":{"name":"Thirty-First International Joint Conference on Artificial Intelligence {IJCAI-22}","theme":"Artificial Intelligence","location":"Vienna, Austria","acronym":"IJCAI-2022","number":"31","sponsor":["International Joint Conferences on Artificial Intelligence Organization (IJCAI)"],"start":{"date-parts":[[2022,7,23]]},"end":{"date-parts":[[2022,7,29]]}},"container-title":["Proceedings of the Thirty-First International Joint Conference on Artificial Intelligence"],"original-title":[],"deposited":{"date-parts":[[2022,7,18]],"date-time":"2022-07-18T11:07:16Z","timestamp":1658142436000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.ijcai.org\/proceedings\/2022\/21"}},"subtitle":[],"proceedings-subject":"Artificial Intelligence Research Articles","short-title":[],"issued":{"date-parts":[[2022,7]]},"references-count":0,"URL":"https:\/\/doi.org\/10.24963\/ijcai.2022\/21","relation":{},"subject":[],"published":{"date-parts":[[2022,7]]}}}