Committee scoring rules, banzhaf values, and approximation algorithms

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

Committee scoring rules, banzhaf values, and approximation algorithms

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

Department of Industrial Engineering and Management

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

Abstract

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 language	English GB
Title of host publication	4th workshop on exploring beyond the worst case in computational social choice (EXPLORE’17)
State	Published - 2017

Cite this

@inproceedings{2dca45cb568c4867aa87e015e5e03dbd,

title = "Committee scoring rules, banzhaf values, and approximation algorithms",

abstract = "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 theBanzhaf 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",

author = "Edith Elkind and Piotr Faliszewski and Martin Lackner and Dominik Peters and Nimrod Talmon",

year = "2017",

language = "אנגלית",

booktitle = "4th workshop on exploring beyond the worst case in computational social choice (EXPLORE{\textquoteright}17)",

}

TY - GEN

T1 - Committee scoring rules, banzhaf values, and approximation algorithms

AU - Elkind, Edith

AU - Faliszewski, Piotr

AU - Lackner, Martin

AU - Peters, Dominik

AU - Talmon, Nimrod

PY - 2017

Y1 - 2017

N2 - 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 theBanzhaf 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

AB - 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 theBanzhaf 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

M3 - פרסום בספר כנס

BT - 4th workshop on exploring beyond the worst case in computational social choice (EXPLORE’17)

ER -

Committee scoring rules, banzhaf values, and approximation algorithms

Abstract

Fingerprint

Cite this