Finding the majority-rule equilibrium under lexicographic comparison of candidates

نویسندگان

  • Joyendu Bhadury
  • Paul M. Griffin
  • Susan O. Griffin
  • Lakshmi S. Narasimhan
  • J. Bhadury
  • P. Griffin
  • S. Griffin
چکیده

This paper considers the well studied problem of the existence of an undominated point, under the assumption of lexicographic preferences of voters, as espoused by Taylor in [24]. We extend Taylor's model to situations were we allow for (i) voters to have different ranings of the issues in ndimensional issue space and (ii) a candidate to be disregarded by a voter if his stand on any one or more of the issues involved in the election is perceived to be too extreme by the voter and (iii) combinations of (i) and (ii). We extend the results of Taylor by demonstrating the non-existence of an equilibrium point in these models in general and then showing that under special circumstances, specialized variants of the “median” point(s) represent equilibrium or undominated points in these models too. Thus a model of voting behavior results that is closer approximation of reality in that historically incumbents tend to win. The primary conclusion of the paper is to suggest that incumbents tend to have an advantage when the election process is characterized by a large presence of special interests or as information becomes more expensive to acquire.

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

ثبت نام

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

منابع مشابه

Sincere Voting in Large Elections

We consider a large two-candidate election with privately informed voters who would all agree on a candidate if their information is aggregated. Due to the presence of uninformed voters who randomly split their votes between the two candidates, there is no equilibrium that is information-efficient under any plurality rule. We introduce an election rule that requires a super majority to elect an...

متن کامل

On the Complexity of Voting Manipulation under Randomized Tie-Breaking

Computational complexity of voting manipulation is one of the most actively studied topics in the area of computational social choice, starting with the groundbreaking work of [Bartholdi et al., 1989]. Most of the existing work in this area, including that of [Bartholdi et al., 1989], implicitly assumes that whenever several candidates receive the top score with respect to the given voting rule...

متن کامل

Political competition between differentiated candidates

We introduce a framework of electoral competition in which voters have general preferences over candidates’ characteristics and policies. Candidates’ immutable characteristics (such as gender, race or previously committed policy positions) are exogenously differentiated, while candidates can choose any policy for the remaining issues to maximize their winning probability. Voters have general pr...

متن کامل

On manipulation in multi-winner elections based on scoring rules

Multi-winner elections model scenarios where voters must select a fixed-size group of candidates based on their individual preferences. In such scenarios, it is often the case that voters are incentivized to manipulate, i.e. misreport their preferences in order to obtain a better outcome. In this paper, we study the complexity of manipulating multiwinner elections under scoring rules, with a pa...

متن کامل

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...

متن کامل

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


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

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

ثبت نام

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

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

دوره   شماره 

صفحات  -

تاریخ انتشار 2011