Computer Science – Computer Science and Game Theory
Scientific paper
2010-01-27
Computer Science
Computer Science and Game Theory
Submitted to ACM EC'10
Scientific paper
In the traditional voting manipulation literature, it is assumed that a group of manipulators jointly misrepresent their preferences to get a certain candidate elected, while the remaining voters are truthful. In this paper, we depart from this assumption, and consider the setting where all voters are strategic. In this case, the election can be viewed as a game, and the election outcomes correspond to Nash equilibria of this game. We use this framework to analyze two variants of Plurality voting, namely, simultaneous voting, where all voters submit their ballots at the same time, and sequential voting, where the voters express their preferences one by one. For simultaneous voting, we characterize the preference profiles that admit a pure Nash equilibrium, but show that it is computationally hard to check if a given profile fits our criterion. For sequential voting, we provide a complete analysis of the setting with two candidates, and show that for three or more candidates the equilibria of sequential voting may behave in a counterintuitive manner.
Desmedt Yvo
Elkind Edith
No associations
LandOfFree
Equilibria of Plurality Voting with Abstentions does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Equilibria of Plurality Voting with Abstentions, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Equilibria of Plurality Voting with Abstentions will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-239694