Aggregation of non-binary evaluations

DOI10.1016/j.aam.2010.02.005zbMath1195.91033MaRDI QIDQ1958939

Elad Dokow, Ron Holzman

Publication date: 30 September 2010

Published in: Advances in Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.aam.2010.02.005

zbMATH Keywords

social choice; assignment problem; judgment aggregation; Arrow's theorem; impossibility domains

Mathematics Subject Classification ID

91B14: Social choice

Related Items

Representing voting rules in Łukasiewicz’s three-valued logic, On the Computational Complexity of Non-Dictatorial Aggregation, Aggregation of Votes with Multiple Positions on Each Issue, Aggregation of binary evaluations: a Borda-like approach, Between Arrow and Gibbard-Satterthwaite. A representation theoretic approach, On update monotone, continuous, and consistent collective evaluation rules, Aggregation theory and the relevance of some issues to others, \(N\)-soft sets and their decision making algorithms, Approximately classic judgement aggregation, A theorem on aggregating classifications

Cites Work

• Unnamed Item
• Logical constraints on judgement aggregation
• Judgment aggregation without full rationality
• Factoring out the impossibility of logical aggregation
• Aggregation of binary evaluations
• Aggregation of binary evaluations with abstentions
• The premiss-based approach to judgment aggregation
• Combining probability distributions: A critique and an annotated bibliography
• Algebraic aggregation theory
• On the theory of aggregation
• Probabilistic opinion pooling generalized. I: General agendas
• On the Arrow property
• Arrow's theorem in judgment aggregation
• The limits of epistemic democracy