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

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
Title of host publication	4th Workshop on Exploring Beyond the Worst Case in Computational Social Choice (EXPLORE 2017).
Subtitle of host publication	Held as part of the 16th International Conference on Autonomous Agents and Multiagent Systems (AAMAS 2017)
Editors	Haris Aziz, John P. Dickerson, Omer Lev, Nicholas Mattei
Pages	24-31
Number of pages	8
State	Published - May 2017

Cite this

Elkind, E., Faliszewski, P., Lackner, M., Peters, D., & Talmon, N. (2017). Committee Scoring Rules, Banzhaf Values, and Approximation Algorithms. In H. Aziz, J. P. Dickerson, O. Lev, & N. Mattei (Eds.), 4th Workshop on Exploring Beyond the Worst Case in Computational Social Choice (EXPLORE 2017).: Held as part of the 16th International Conference on Autonomous Agents and Multiagent Systems (AAMAS 2017) (pp. 24-31)

Elkind, Edith ; Faliszewski, Piotr ; Lackner, Martin et al. / Committee Scoring Rules, Banzhaf Values, and Approximation Algorithms. 4th Workshop on Exploring Beyond the Worst Case in Computational Social Choice (EXPLORE 2017).: Held as part of the 16th International Conference on Autonomous Agents and Multiagent Systems (AAMAS 2017) . editor / Haris Aziz ; John P. Dickerson ; Omer Lev ; Nicholas Mattei. 2017. pp. 24-31

@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",

month = may,

language = "English",

pages = "24--31",

editor = "Haris Aziz and {P. Dickerson}, John and Omer Lev and Nicholas Mattei",

booktitle = "4th Workshop on Exploring Beyond the Worst Case in Computational Social Choice (EXPLORE 2017).",

}

Elkind, E, Faliszewski, P, Lackner, M, Peters, D & Talmon, N 2017, Committee Scoring Rules, Banzhaf Values, and Approximation Algorithms. in H Aziz, J P. Dickerson, O Lev & N Mattei (eds), 4th Workshop on Exploring Beyond the Worst Case in Computational Social Choice (EXPLORE 2017).: Held as part of the 16th International Conference on Autonomous Agents and Multiagent Systems (AAMAS 2017) . pp. 24-31.

Committee Scoring Rules, Banzhaf Values, and Approximation Algorithms. / Elkind, Edith; Faliszewski, Piotr; Lackner, Martin et al.
4th Workshop on Exploring Beyond the Worst Case in Computational Social Choice (EXPLORE 2017).: Held as part of the 16th International Conference on Autonomous Agents and Multiagent Systems (AAMAS 2017) . ed. / Haris Aziz; John P. Dickerson; Omer Lev; Nicholas Mattei. 2017. p. 24-31.

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

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/5

Y1 - 2017/5

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 - Conference contribution

SP - 24

EP - 31

BT - 4th Workshop on Exploring Beyond the Worst Case in Computational Social Choice (EXPLORE 2017).

A2 - Aziz, Haris

A2 - P. Dickerson, John

A2 - Lev, Omer

A2 - Mattei, Nicholas

ER -

Elkind E, Faliszewski P, Lackner M, Peters D, Talmon N. Committee Scoring Rules, Banzhaf Values, and Approximation Algorithms. In Aziz H, P. Dickerson J, Lev O, Mattei N, editors, 4th Workshop on Exploring Beyond the Worst Case in Computational Social Choice (EXPLORE 2017).: Held as part of the 16th International Conference on Autonomous Agents and Multiagent Systems (AAMAS 2017) . 2017. p. 24-31

Committee Scoring Rules, Banzhaf Values, and Approximation Algorithms

Abstract

Fingerprint

Cite this