We consider a general plurality voting game with multiple candidates, where voter preferences over candidates are exogenously given. In particular, we allow for arbitrary voter indierences, as may arise in voting subgames of citizen-candidate or locational models of elections. We prove that the voting game admits pure strategy equilibria in undominated strategies. The proof is constructive: we exhibit an algorithm, the “best winning deviation” algorithm, that produces such an equilibrium in finite time. A byproduct of the algorithm is a simple story for how voters might learn to coordinate on such an equilibrium.
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 University of Rochester - Wallis Institute of Political Economy in its series Wallis Working Papers with number
WP52.
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.:
James Bergin & Dan Bernhardt, 2004.
"Comparative Learning Dynamics,"
International Economic Review,
Department of Economics, University of Pennsylvania and Osaka University Institute of Social and Economic Research Association, vol. 45(2), pages 431-465, 05.
[Downloadable!] (restricted)