Statistical comparison of aggregation rules for votes

نویسندگان

  • Michel Truchon
  • Stephen Gordon
چکیده

If individual voters observe the true ranking on a set of alternatives with error, then the social choice problem, that is, the problem of aggregating their observations, is one of statistical inference. This study develops a statistical methodology that can be used to evaluate the properties of a given voting or aggregation rule. These techniques are then applied to some well-know rules.

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

ثبت نام

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

منابع مشابه

Consistent Judgement Aggregation: The Truth-Functional Case1

Generalizing the celebrated “discursive dilemma,” we analyze judgement aggregation problems in which a group of agents independently votes on a set of complex propositions (the “conclusions”) and on a set of “premises” by which the conclusions are truth-functionally determined. We show that for conclusionand premise-based aggregation rules to be mutually consistent, the aggregation must always ...

متن کامل

Minimising the Rank Aggregation Error

Rank aggregation is the problem of generating an overall ranking from a set of individual votes. The aim in doing so is to produce a ranking which is as close as possible to the (unknown) correct ranking for a given distance measure such as the Kendall-tau distance. The challenge is that votes are often both noisy and incomplete. Existing work has largely focused on finding the most likely rank...

متن کامل

Aggregating Conditionally Lexicographic Preferences Using Answer Set Programming Solvers

We consider voting over combinatorial domains, where alternatives are binary tuples. We assume that votes are specified as conditionally lexicographic preferences, or LP trees. We study aggregation problems of LP tree votes for several positional scoring rules. Our main goal is to demonstrate that answer-set programming can be effective in solving the winner and the evaluation problems for inst...

متن کامل

Voting with Rank Dependent Scoring Rules

Positional scoring rules in voting compute the score of an alternative by summing the scores for the alternative induced by every vote. This summation principle ensures that all votes contribute equally to the score of an alternative. We relax this assumption and, instead, aggregate scores by taking into account the rank of a score in the ordered list of scores obtained from the votes. This def...

متن کامل

Common Voting Rules as Maximum Likelihood Estimators

Voting is a very general method of preference aggregation. A voting rule takes as input every voter’s vote (typically, a ranking of the alternatives), and produces as output either just the winning alternative or a ranking of the alternatives. One potential view of voting is the following. There exists a “correct” outcome (winner/ranking), and each voter’s vote corresponds to a noisy perception...

متن کامل

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


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

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

ثبت نام

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

عنوان ژورنال:
  • Mathematical Social Sciences

دوره 57  شماره 

صفحات  -

تاریخ انتشار 2009