Consistent Approval-Based Multi-Winner Rules

نویسندگان

  • Martin Lackner
  • Piotr Skowron
چکیده

This paper is an axiomatic study of consistent approval-based multi-winner rules, i.e., voting rules that select a fixed-size group of candidates based on approval ballots. We introduce the class of counting rules, provide an axiomatic characterization of this class and, in particular, show that counting rules are consistent. Building upon this result, we axiomatically characterize three important consistent multiwinner rules: Proportional Approval Voting, Multi-Winner Approval Voting and the Approval Chamberlin–Courant rule. Our results demonstrate the variety of multi-winner rules and illustrate three different, orthogonal principles that multiwinner voting rules may represent: excellence, diversity, and proportionality.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Quantitative Analysis of Multi-Winner Rules

To choose a multi-winner rule, i.e., a voting rule that selects a subset of k alternatives based on preferences of a certain population, is a hard and ambiguous task. Depending on the context, it varies widely what constitutes an “optimal” committee. In this paper, we offer a new perspective to measure the quality of committees and—consequently—multi-winner rules. We provide a quantitative anal...

متن کامل

Monotonicity axioms in approval-based multi-winner voting rules

In this paper we study several monotonicity axioms in approval-based multi-winner voting rules. We consider monotonicity with respect to the support received by the winners and also monotonicity in the size of the committee. Monotonicity with respect to the support is studied when the set of voters does not change and when new voters enter the election. For each of these two cases we consider a...

متن کامل

Computational Aspects of Multi-Winner Approval Voting

We study computational aspects of three prominent voting rules that use approval ballots to elect multiple winners. These rules are satisfaction approval voting, proportional approval voting, and reweighted approval voting. We first show that computing the winner for proportional approval voting is NP-hard, closing a long standing open problem. As none of the rules are strategyproof, even for d...

متن کامل

Committees providing EJR can be computed efficiently

We identify a whole family of approval-based multi-winner voting rules that satisfy PJR. Moreover, we identify a subfamily of voting rules within this family that satisfy EJR. All these voting rules can be computed in polynomial time as long as the subalgorithms that characterize each rule within the family are polynomial.

متن کامل

Fully Open Extensions to the D'Hondt Method

In this study, we propose two voting rules that extend the D’Hondt method for approval-based multi-winner elections. Our theoretical results prove that one of such rules preserves the main properties of the original D’Hondt method: house monotonicity, lower quota satisfaction, and population monotonicity, and that it can be executed in polynomial time.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • CoRR

دوره abs/1704.02453  شماره 

صفحات  -

تاریخ انتشار 2017