EconPapers    
Economics at your fingertips  
 

Strategic voting and nomination

James Green-Armytage

MPRA Paper from University Library of Munich, Germany

Abstract: Using computer simulations based on three separate data generating processes, I estimate the fraction of elections in which sincere voting will be a core equilibrium given each of eight single-winner voting rules. Additionally, I determine how often each voting rule is vulnerable to simple voting strategies such as 'burying' and 'compromising', and how often each voting rule gives an incentive for non-winning candidates to enter or leave races. I find that Hare is least vulnerable to strategic voting in general, whereas Borda, Coombs, approval, and range are most vulnerable. I find that plurality is most vulnerable to compromising and strategic exit (which can both reinforce two-party systems), and that Borda is most vulnerable to strategic entry. I support my key results with analytical proofs.

Keywords: strategic voting; tactical voting; strategic nomination; Condorcet; alternative vote; Borda count; approval voting (search for similar items in EconPapers)
JEL-codes: D7 (search for similar items in EconPapers)
Date: 2011-04-14
New Economics Papers: this item is included in nep-cdm and nep-pol
References: View references in EconPapers View complete reference list from CitEc
Citations: Track citations by RSS feed

Downloads: (external link)
https://mpra.ub.uni-muenchen.de/32200/1/MPRA_paper_32200.pdf original version (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:pra:mprapa:32200

Access Statistics for this paper

More papers in MPRA Paper from University Library of Munich, Germany Ludwigstraße 33, D-80539 Munich, Germany. Contact information at EDIRC.
Bibliographic data for series maintained by Joachim Winter ().

 
Page updated 2023-11-11
Handle: RePEc:pra:mprapa:32200