In this presentation, I will discuss a number of issues related to the problem of selecting a group of candidates (referred to as the committee). Committee elections have applications ranging from shortlisting, through the issue of finding items to present on a store's website, to parliamentary elections (or, on a smaller scale, the problem of choosing the electors at a university). I will show simulation results for a number of multiwinner rules and discuss these rules' computational complexity and axiomatic properties.
In this presentation, I will discuss a number of issues related to the problem of selecting a group of candidates (referred to as the committee). Committee elections have applications ranging from shortlisting, through the issue of finding items to present on a store's website, to parliamentary elections (or, on a smaller scale, the problem of choosing the electors at a university). I will show simulation results for a number of multiwinner rules and discuss these rules' computational complexity and axiomatic properties.
In this presentation, I will discuss a number of issues related to the problem of selecting a group of candidates (referred to as the committee). Committee elections have applications ranging from shortlisting, through the issue of finding items to present on a store's website, to parliamentary elections (or, on a smaller scale, the problem of choosing the electors at a university). I will show simulation results for a number of multiwinner rules and discuss these rules' computational complexity and axiomatic properties.
In this presentation, I will discuss a number of issues related to the problem of selecting a group of candidates (referred to as the committee). Committee elections have applications ranging from shortlisting, through the issue of finding items to present on a store's website, to parliamentary elections (or, on a smaller scale, the problem of choosing the electors at a university). I will show simulation results for a number of multiwinner rules and discuss these rules' computational complexity and axiomatic properties.
In this presentation, I will discuss a number of issues related to the problem of selecting a group of candidates (referred to as the committee). Committee elections have applications ranging from shortlisting, through the issue of finding items to present on a store's website, to parliamentary elections (or, on a smaller scale, the problem of choosing the electors at a university). I will show simulation results for a number of multiwinner rules and discuss these rules' computational complexity and axiomatic properties.
