Comparative Analysis of Algorithmic Complexity and Experimental Evaluation of Committee Selection Rules for Multi-winner Elections

Author(s)	Dr. Telesphore Nsumbu, Dr. Bruce Mbombi, Dr. Pascaline Kizodisa, Dr. Richard Kitondua
Country	Congo (Democratic)
Abstract	Abstract This study presents a comparative analysis of six committee selection rules in multi-winner elections, focusing on their algorithmic performance and experimental validation. A theoretical complexity analysis is complemented by simulations performed on instances of 100 to 18,000 voters to evaluate execution time, memory consumption, voter satisfaction, algorithmic efficiency, and scalability. Block voting rules are distinguished by their low computational cost and excellent scalability, while Monroe and Chamberlin-Courant rules offer better representation quality at the cost of increased complexity. This study thus highlights the trade-off between computational efficiency and representation quality, while experimentally confirming the predictions of algorithmic complexity theory.
Keywords	Keywords: Computational social choice; Multiple winner elections; Committee selection; Algorithmic complexity; Experimental evaluation; Scalability; Algorithmic efficiency.
Field	Computer Applications
Published In	Volume 8, Issue 4, July-August 2026
Published On	2026-08-05
DOI	https://doi.org/10.36948/ijfmr.2026.v08i04.84946

About IJFMR Fees & Payment Current Issue Publication Archive	Submit Research Paper Track Submission Status Publication Guidelines Publication Ethics Peer Review & Plagiarism	Join as a Reviewer Editors & Reviewers Reviewer Referral Program Get Reviewer Membership Certi.	Website/Journal Policies Usage Policy Content Policies Privacy Policy

Contact Us		+91-9687-828-838	editor@ijfmr.com

International Journal For Multidisciplinary Research