Abstract
AbstractOne of the fundamental normative principles in social choice theory is that of neutrality. In the context of judgment aggregation, neutrality is encoded in the form of an axiom expressing that, when two possible judgments enjoy the same support amongst the individuals, then either both or neither of them should be accepted. This is a reasonable requirement in many scenarios. However, we argue that for scenarios in which individuals are asked to pass judgment on very diverse kinds of propositions, a notion of relative acceptability is better suited. We capture this notion by a new axiom that hinges on a binary “acceptability” relation A between propositions: if a given coalition accepting a proposition p entails the collective acceptance of p, then the same should be true for every other proposition q related to p via A. Intuitively, pAq means that p is at least as acceptable as q. Classical neutrality is then a special case where all propositions are equally acceptable. We show that our new axiom allows us to circumvent a classical impossibility theorem in judgment aggregation for certain scenarios of practical interest. Also, we offer a precise characterisation of all scenarios that are safe, in the sense that any aggregation rule respecting the relative acceptability between propositions will always return logically consistent outcomes.
Publisher
Springer Science and Business Media LLC
Subject
Economics and Econometrics,Social Sciences (miscellaneous)
Reference45 articles.
1. Baumeister D, Erdélyi G, Rothe J (2016) Judgment aggregation. In: Rothe J (ed) Economics and computation. Springer, New York
2. Brams SJ, Fishburn PC (2002) Voting procedures. In: Arrow KJ, Sen A, Suzumura K (eds) Handbook of social choice and welfare. Elsevier, Amsterdam
3. Chapman B (1998) More easily done than said: Rules, reasons and rational social choice. Oxf. J. Legal Stud. 18(2):293–329
4. Chapman B (2002) Rational aggregation. Polit. Philos. Econ. 1(3):337–354
5. Costantini M, Groenland C, Endriss U (2016) Judgment aggregation under issue dependencies. In: Proceedings of the 30th AAAI Conference on Artificial Intelligence (AAAI), pp 468–474