Voting by Eliminating Quantifiers

Studia Logica 92 (3):365-379 (2009)
  Copy   BIBTEX

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.

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 90,593

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

Similar books and articles

Self-commuting quantifiers.Dag Westerståhl - 1996 - Journal of Symbolic Logic 61 (1):212-224.
A note on the monotonicity of reducible quantifiers.R. Zuber - 2010 - Journal of Logic, Language and Information 19 (1):123-128.

Analytics

Added to PP
2009-08-19

Downloads
38 (#365,484)

6 months
6 (#202,901)

Historical graph of downloads
How can I increase my downloads?

Author's Profile

Dov Gabbay
Hebrew University of Jerusalem

Citations of this work

No citations found.

Add more citations

References found in this work

Descriptive Complexity.Neil Immerman - 1998 - Springer Verlag.

Add more references