Committee scoring rules, banzhaf values, and approximation algorithms

Edith Elkind, Piotr Faliszewski, Martin Lackner, Dominik Peters, Nimrod Talmon

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review


We consider committee scoring rules (a family of multiwinner voting rules) and define a class of cooperative games based on elections held according to these rules. We show that there is a polynomial-time algorithm for computing the
Banzhaf value for a large subclass of these games and we show, using this Banzhaf value, an appealing heuristic algorithm for computing winning committees. We evaluate this algorithm experimentally for the case of the Chamberlin-Courant voting rule
Original languageEnglish GB
Title of host publication4th workshop on exploring beyond the worst case in computational social choice (EXPLORE’17)
StatePublished - 2017


Dive into the research topics of 'Committee scoring rules, banzhaf values, and approximation algorithms'. Together they form a unique fingerprint.

Cite this