Approval Voting on Large Poisson Games ∗

نویسندگان

  • Arnaud Dellis
  • Nicolas Houy
  • Marc Leandri
  • François Maniquet
  • Jordi Massó
  • Roger Myerson
  • Maurice Salles
  • Yves Sprumont
  • Jean-Marc Tallon
چکیده

Approval Voting is analyzed in a context of large elections with strategic voters, the Myerson’s Large Poisson Games. Three examples show that this voting rule does not always correctly aggregate preferences. The first one shows that a candidate ranked first by more than half of the voters need not be the Winner of the election under Approval voting. In the second one, we show that it can be the case that the Condorcet Winner is not the Winner of the election in any of the equilibria of the Large Poisson game under Approval Voting. Finally, in the third example, the Condorcet Winner gets no vote and sincere behavior is not a best response for strategic voters with such a voting rule.

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

ثبت نام

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

منابع مشابه

Condorcet Consistency of Approval Voting: a Counter Example in Large Poisson Games

Approval Voting is analyzed in a context of large elections with strategic voters: the Myerson’s Large Poisson Games. We first establish the Magnitude Equivalence Theorem which substantially reduces the complexity of computing the magnitudes of the pivot outcomes. Furthermore, we show that the Condorcet Winner need not be the Winner of the election in equilibrium under Approval Voting. Indeed, ...

متن کامل

On the informational efficiency of simple scoring rules

We study information aggregation in large elections. With two candidates, efficient information aggregation is possible in a large election (e.g., Feddersen and Pesendorfer [4, 5, 6], among others). We find that this result does not extend to large elections with more than two candidates. More precisely, we study a class of simple scoring rules in large voting games with Poisson population unce...

متن کامل

Criticality in games with multiple levels of approval

In this paper criticality within a voting game is rigorously defined and examined. Criticality forms the basis of the traditional voting power measures frequently employed to analyse voting games; therefore understanding criticality is a pre-requisite to understanding any such analysis. The concept of criticality is extended to encompass games in which players are allowed to express multiple le...

متن کامل

Comparison of Scoring Rules in Poisson Voting Games

Scoring rules are compared by the equilibria that they generate for simple elections with three candidates and voters drawn from large Poisson distributions. A calculus for comparing pivot probabilities in Poisson voting games is applied. For a symmetric Condorcet cycle, nonsymmetric discriminatory equilibria exist under best-rewarding scoring rules like plurality voting. A candidate who is uni...

متن کامل

Anonymous yes-no voting with abstention and multiple levels of approval

Symmetric (3, 2) simple games serve as models for anonymous voting systems in which each voter may vote “yes,” abstain, or vote “no,” the outcome is “yes” or “no,” and all voters play interchangeable roles. The extension to symmetric (j,2) simple games, in which each voter chooses from among j ordered levels of approval, also models some natural decision rules, such as pass–fail grading systems...

متن کامل

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


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

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

ثبت نام

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

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

دوره   شماره 

صفحات  -

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