סמינר מחלקתי

Multiwinner Elections: Applications, Axioms, and Algorithms

Dr. Nimrod Talmon – Weizmann Institute

Abstract:

Multiwinner elections are used for selecting few candidates out of a bigger group of available candidates. Examples where such elections are useful include a society which chooses a parliament, variants of facility location problems, and a hiring committee which shortlists candidates for further consideration. Naturally, different applications have different properties

and thus call for different multiwinner voting rules. In this talk I will concentrate on multiwinner voting rules aiming at achieving proportional representation; roughly speaking, the goal of such rules is to represent the views of the society as proportional as possible. I will formally define some of these rules, discuss their axiomatic properties, and describe several algorithms for computing them. As some of these rules are computationally intractable, I will particularly concentrate on parameterized algorithms and approximation algorithms for them, as well as on various heuristics

Nimrod is a postdoctoral associate at Weizmann institute.