Aggregation of binary evaluations for truth-functional agendas
From MaRDI portal
Publication:2272183
Consider a judgment aggregator on a standard truth-functional agenda. The paper gives an analogue of Arrow's theorem in this case, with universal domain, Pareto condition and independence of irrelevant alternatives implying the existence of a dictator. Various relaxations of universal domain allow (barely) for majority rule or oligarchy. Relaxation of the Pareto condition is also considered.
Recommendations
- Consistent judgement aggregation: the truth-functional case
- Aggregation of binary evaluations with abstentions
- Aggregation of binary evaluations
- Aggregation of binary evaluations: a Borda-like approach
- The Problem of Judgment Aggregation in the Framework of Boolean-Valued Models
- Aggregation in value-based argumentation frameworks
- Weighted Conjunctive and Disjunctive Aggregation of Possibilistic Truth Values
- Aggregation of non-binary evaluations
- Propositionwise judgment aggregation: the general case
- Aggregation of fuzzy truth values
Cites work
- A generalised model of judgment aggregation
- Aggregation of binary evaluations with abstentions
- Aggregation of equivalence relations
- Algebraic aggregation theory
- Arrow's theorem in judgment aggregation
- Consistent judgement aggregation: the truth-functional case
- Factoring out the impossibility of logical aggregation
- Logical constraints on judgement aggregation
- On the theory of aggregation
- Social choice and individual values
Cited in
(23)- The doctrinal paradox, the discursive dilemma, and logical aggregation theory
- Neutrality and relative acceptability in judgment aggregation
- Strategyproof judgment aggregation under partial information
- A paradox of expert rights in abstract argumentation
- Approximately classic judgement aggregation
- Propositionwise judgment aggregation: the general case
- Aggregation of binary evaluations: a Borda-like approach
- The problem of no hands: responsibility voids in collective decisions
- The Problem of Judgment Aggregation in the Framework of Boolean-Valued Models
- Algorithmically efficient syntactic characterization of possibility domains
- Algorithmically efficient syntactic characterization of possibility domains
- On the computational complexity of non-dictatorial aggregation
- Incoherent majorities: the McGarvey problem in judgement aggregation
- Group strategy-proof rules in multidimensional binary domains
- Aggregation of evaluations without unanimity
- Judgment aggregators and Boolean algebra homomorphisms
- Factoring out the impossibility of logical aggregation
- Introduction to judgment aggregation
- Abstract Arrowian aggregation
- Aggregation of binary evaluations
- Aggregation of binary evaluations with abstentions
- The premiss-based approach to judgment aggregation
- Justifiable group choice
This page was built for publication: Aggregation of binary evaluations for truth-functional agendas
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2272183)
