In this paper I examine single member, simple plurality elections with n > 2 probabilistic voters and show that the maximization of expected vote share and maximization of probability of victory are “generically different” in a specific sense. More specifically, I first describe finite shyness (Anderson and Zame (2000)), a notion of genericity for infinite dimensional spaces. Using this notion, I show that, for any policy x in the interior of the policy space and any candidate j, the set of n-dimensional profiles of twice continuously differentiable probabilistic voting functions for which x simultaneously satisfies the first and second order conditions for maximization of j’s probability of victory and j’s expected vote share at x is finitely shy with respect to the set of n-dimensional profiles of twice continuously differentiable probabilistic voting functions for which x satisfies the first and second order conditions for maximization of j’s expected vote share.
Download Info
To download:
If you experience problems downloading a file, check if you have the
proper application to
view it first. Information about this may be contained
in the File-Format links below. In case of further problems read
the IDEAS help
file. Note that these files are not on the IDEAS
site. Please be patient as the files may be large.
Publisher Info
Paper provided by EconWPA in its series Public Economics with number
0502006.
References listed on IDEAS Please report citation or reference errors to , or , if you are the registered author of the cited work, log in to your RePEc Author Service profile, click on "citations" and make appropriate adjustments.: