| Reference : Judgment Aggregation and the Problem of Truth-Tracking |
| Scientific congresses, symposiums and conference proceedings : Paper published in a book | |||
| Engineering, computing & technology : Computer science | |||
| http://hdl.handle.net/10993/16100 | |||
| Judgment Aggregation and the Problem of Truth-Tracking | |
| English | |
| Pigozzi, Gabriella [University of Luxembourg > Faculty of Science, Technology and Communication (FSTC) > Computer Science and Communications Research Unit (CSC) >] | |
| Hartmann, Stephan [] | |
| 2007 | |
| Proceedings of the 11th conference on Theoretical aspects of rationality and knowledge | |
| ACM | |
| 248–252 | |
| No | |
| New York | |
| NY | |
| 11th Conference on Theoretical Aspects of Rationality and Knowledge (TARK XI) | |
| 25–27 June 2007 | |
| Brussels | |
| Belgium | |
| [en] The problem of the aggregation of consistent individual judgments on logically interconnected propositions into a collective judgment on the same propositions has recently drawn much attention. The difficulty lies in the fact that a seemingly reasonable aggregation procedure, such as propositionwise majority voting, cannot ensure an equally consistent collective outcome. The literature on judgment aggregation refers to such dilemmas as the doctrinal paradox. Three procedures have been proposed in order to overcome the paradox: the premise-based and conclusion-based procedures on the one hand, and the fusion approach on the other hand. In this paper we assume that the decision which the group is trying to reach is factually right or wrong. Hence, the question is how good the fusion approach is in tracking the truth, and how it compares with the premise-based and conclusion-based procedures. We address these questions in a probabilistic framework and show that belief fusion does especially well for individuals with a middling competence of hitting the truth of a proposition. | |
| http://hdl.handle.net/10993/16100 | |
| 10.1145/1324249.1324282 |
There is no file associated with this reference.
All documents in ORBilu are protected by a user license.
