LiU Electronic Press
Full-text not available in DiVA
Author:
Szalas, Andrzej (Linköping University, Department of Computer and Information Science, KPLAB - Knowledge Processing Lab) (Linköping University, The Institute of Technology)
Gabbay, Dov (King's College)
Title:
Voting by Eliminating Quantifiers
Department:
Linköping University, Department of Computer and Information Science, KPLAB - Knowledge Processing Lab
Linköping University, The Institute of Technology
Publication type:
Article in journal (Refereed)
Language:
English
Publisher: Springer
Status:
Published
In:
Studia Logica: An International Journal for Symbolic Logic(ISSN 0039-3215)(EISSN 1572-8730)
Volume:
92
Issue:
3
Pages:
365-379
Year of publ.:
2009
URI:
urn:nbn:se:liu:diva-21991
Permanent link:
http://urn.kb.se/resolve?urn=urn:nbn:se:liu:diva-21991
Subject category:
Engineering and Technology
SVEP category:
TECHNOLOGY
Abstract(en) :

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.

Available from:
2009-10-07
Created:
2009-10-07
Last updated:
2011-02-26
Statistics:
0 hits