ResearchTrend.AI
  • Papers
  • Communities
  • Events
  • Blog
  • Pricing
Papers
Communities
Social Events
Terms and Conditions
Pricing
Parameter LabParameter LabTwitterGitHubLinkedInBlueskyYoutube

© 2025 ResearchTrend.AI, All rights reserved.

  1. Home
  2. Papers
  3. 2202.12006
44
3

Parameterized Intractability for Multi-Winner Election under the Chamberlin-Courant Rule and the Monroe Rule

24 February 2022
Jiehua Chen
Sanjukta Roy
ArXiv (abs)PDFHTML
Abstract

Answering an open question by Betzler et al. [Betzler et al., JAIR'13], we resolve the parameterized complexity of the multi-winner determination problem under two famous representation voting rules: the Chamberlin-Courant (in short CC) rule [Chamberlin and Courant, APSR'83] and the Monroe rule [Monroe, APSR'95]. We show that under both rules, the problem is W[1]-hard with respect to the sum β\betaβ of misrepresentations, thereby precluding the existence of any f(β)⋅∣I∣O(1)f(\beta) \cdot |I|^{O(1)}f(β)⋅∣I∣O(1) -time algorithm, where ∣I∣|I|∣I∣ denotes the size of the input instance.

View on arXiv
Comments on this paper