liu.seSearch for publications in DiVA
ReferencesLink to record
Permanent link

Direct link
Voting by Eliminating Quantifiers
2009 (English)In: Studia Logica: An International Journal for Symbolic Logic, ISSN 0039-3215, E-ISSN 1572-8730, Vol. 92, no 3, 365-379Artikel i tidskrift (Refereed) Published
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.

National Category
Engineering and Technology
Identifiers
urn:nbn:se:liu:diva-21991 (URN)10.1007/s11225-009-9200-7 (DOI)oai:DiVA.org:liu-21991 (OAI)
Available from2009-10-07 Created:2009-10-07 Last updated:2011-02-26

Open Access in DiVA

No fulltext

Other links

Publisher's fulltext

Search in DiVA

By author/editor
Szalas, AndrzejGabbay, Dov
By organisation
KPLAB - Knowledge Processing LabThe Institute of TechnologyKing's College
In the same journal
Studia Logica: An International Journal for Symbolic Logic
Engineering and Technology

Search outside of DiVA

GoogleGoogle Scholar
The number of downloads is the sum of all downloads of full texts. It may include eg previous versions that are now no longer available

Citations

Web of Science®:

Altmetric score

Totalt: 27 hits
ReferencesLink to record
Permanent link

Direct link