Voting by eliminating quantifiers
Studia Logica 92 (3):365 - 379 (2009)
| Abstract | Mathematical theory of voting and social choice has attracted much attention. In the general setting one can view social choice as a method of aggregating individual, often conflicting preferences and making a choice that is the best compromise. How preferences are expressed and what is the “best compromise” varies and heavily depends on a particular situation. The method we propose in this paper depends on expressing individual preferences of voters and specifying properties of the resulting ranking by means of first-order formulas. Then, as a technical tool, we use methods of second-order quantifier elimination to analyze and compute results of voting. We show how to specify voting, how to compute resulting rankings and how to verify voting protocols. | |||||||||
| Keywords | No keywords specified (fix it) | |||||||||
| Categories | ||||||||||
| Options |
|
|||||||||
Download options| PhilPapers Archive |
Upload a copy of this paper Check publisher's policy on self-archival Papers currently archived: 5,865 |
| External links |
 |
| Through your library | Configure |
Similar books and articlesYann Allard-Tremblay (forthcoming). The Epistemic Edge of Majority Voting Over Lottery Voting. Res Publica.
Clara Fischer (2011). Compulsory Voting and Inclusion: A Response to Saunders. POLITICS 31 (1):2011.
Gilbert Laffond (2000). Majority Voting on Orders. Theory and Decision 49 (3):249-287.
Jean-Luc Koning & Didier Dubois (2006). Suitable Properties for Any Electronic Voting System. Artificial Intelligence and Law 14 (4):251-260.
Steven Pressman (2006). Clap Happy: Applause and the Voting Paradox. Journal of Economic Methodology 13 (2):241-256.
Analytics
Monthly downloads |
Added to index2009-08-19Total downloads17 ( #72,013 of 556,772 )Recent downloads (6 months)1 ( #64,754 of 556,772 )How can I increase my downloads? |
My notes
Discussion
