Voting by eliminating quantifiers

DOI10.1007/S11225-009-9200-7MaRDI QIDQ1037605zbMATH OpenOpenAlexFDO

Authors Dov Gabbay, Andrzej Szałas

Publication date 16 November 2009

Published in Studia Logica (Search for Journal in Brave)

Full work available at URL http://orbilu.uni.lu/handle/10993/15947

zbMATH Keywords

votingsocial choicequantifier elimination

Mathematics Subject Classification ID

Social choice (91B14) Voting theory (91B12) Quantifier elimination, model completeness, and related topics (03C10)

Recommendations

• Voting procedures, complexity of
• Analysing vote counting algorithms via logic. And its application to the CADE election scheme
• Introduction to the theory of voting
• An algorithmic view of voting
• Social choice rules driven by propositional logic

Cites work

• scientific article; zbMATH DE number 1302020 (Why is no real title available?)
• scientific article; zbMATH DE number 1303431 (Why is no real title available?)
• scientific article; zbMATH DE number 803291 (Why is no real title available?)
• Computing circumscription revisited: A reduction algorithm
• Handbook of social choice and welfare. Vol. 1.
• On the Fixpoint Theory of Equality and Its Applications
• Report of the third QBF solvers evaluation
• Second-order quantifier elimination. Foundations, computational aspects and applications
• Social choice and individual values
• The paradox of multiple elections
• The state of SAT
• Tournament solutions and majority voting
• Untersuchungen über das Eliminationsproblem der mathematischen Logik

Cited in

(1)

• Analysing vote counting algorithms via logic. And its application to the CADE election scheme

This page was built for publication: Voting by eliminating quantifiers

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1037605)