Multi-Winner Reconfiguration

Jiehua Chen, Christian Hatschka, Sofia Simola
2/3/2026

No confident code implementation found for this paper.

Abstract

We introduce a multi-winner reconfiguration model to examine how to transition between two subsets of alternatives (aka. committees ) through a sequence of minor yet impactful modifications, called reconfiguration path . We analyze this model under four approval-based voting rules: Chamberlin-Courant (CC), Proportional Approval Voting (PAV), Approval Voting (AV), and Satisfaction Approval Voting (SAV). The problem exhibits computational intractability for CC and PAV, and polynomial solvability for AV and SAV. We provide a detailed multivariate complexity analysis for CC and PAV, demonstrating that although the problem remains challenging in many scenarios, there are specific cases that allow for efficient parameterized algorithms.

DOISemantic Scholar

Code Implementations

No confident code match yet

We couldn't find an author-owned or strongly-evidenced community implementation for this paper. Any repos shown below are weak matches — verify before relying on them.

No code implementations found yet.

Know of an implementation? Let us know in the comments below!

Cite this paper

@article{chen2026multiwinner,
  title  = {Multi-Winner Reconfiguration},
  author = {Jiehua Chen and Christian Hatschka and Sofia Simola},
  year   = {2026},
  doi    = {10.52202/079017-2728},
  url    = {https://doi.org/10.52202/079017-2728},
  journal = {NEURIPS 2024 2024}
}

Discussion