A REPRESENTATION THEOREM FOR VOTING WITH LOGICAL CONSEQUENCES
By Peter Gärdenfors. Economics and Philosophy, 2006
79 citations recorded by the source corpus.
Subfields: Artificial Intelligence, Computational Theory and Mathematics, Economics and Econometrics
View Paper: https://www.semanticscholar.org/paper/862bc7d611d7733b52509bf138ccfe7e0103a05a
How researchers see this paper
The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.
In Artificial Intelligence
In Computational Theory and Mathematics
In Economics and Econometrics
Citations in the corpus
- The doctrinal paradox, the discursive dilemma, and logical aggregation theory (2012, background): “Dokow and Holzman, for their part, use a formalism called abstract aggregation, which goes back to Fishburn and Rubinstein (1986), Wilson (1975) and Guilbaud 24The early oligarchic result of Gärdenfors (2006) imposes unnecessarily strong conditions on the agenda for impossibility.”
- Handbook of Computational Social Choice (2016, background): “G¨ardenfors (2006) showed that giving up the requirement of completeness amounts to moving from dictatorships to oligarchic aggregators, i.e., aggregators where the outcome is the set of those propositions a fixed set of individuals completely agrees on (dictatorships and the intersection rule are…”