Voting by Eliminating Quantifiers

Reference : Voting by Eliminating Quantifiers


	Document type :	Scientific journals : Article
	Discipline(s) :	Engineering, computing & technology : Computer science
	To cite this reference:	http://hdl.handle.net/10993/15947

Title :	Voting by Eliminating Quantifiers
Language :	English
Author, co-author :	Gabbay, Dov M. [King’s College London, Department of Computer Science, London, UK; Bar-Ilan University, Ramat-Gan, Israel]
	Szalas, Andrzej [> >]
Publication date :	2009
Journal title :	Studia Logica
Publisher :	Springer
Volume :	92
Issue/season :	3
Pages :	365–379
Peer reviewed :	Yes
ISSN :	0039-3215
e-ISSN :	1572-8730
City :	Berlin
Country :	Germany
Keywords :	[en] voting ; social choice ; quantifier elimination.
Abstract :	[en] Mathematical theory of voting and social choice has attracted much at- tention. 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.
Permalink :	http://hdl.handle.net/10993/15947
DOI :	10.1007/s11225-009-9200-7

File(s) associated to this reference

Fulltext file(s):

	File	Commentary	Version	Size	Access
Open access	art%3A10.1007%2Fs11225-009-9200-7(1).pdf		Publisher postprint	231.93 kB	View/Open

All documents in ORBi^lu are protected by a user license.