Reference : Desirable Tie-breaking Rules in Collective Decision Making
Scientific congresses, symposiums and conference proceedings : Paper published in a journal
Engineering, computing & technology : Computer science
http://hdl.handle.net/10993/25054
Desirable Tie-breaking Rules in Collective Decision Making
English
Pigozzi, Gabriella [University of Luxembourg > Faculty of Science, Technology and Communication (FSTC) > Computer Science and Communications Research Unit (CSC) >]
Slavkovik, Marija [University of Luxembourg > Faculty of Science, Technology and Communication (FSTC) > Computer Science and Communications Research Unit (CSC) >]
van der Torre, Leon mailto [University of Luxembourg > Faculty of Science, Technology and Communication (FSTC) > Computer Science and Communications Research Unit (CSC) >]
2008
Annales du LAMSADE
171–174
Yes
International
Annales du Lamsade, Proceedings of the DIMACS-LAMSADE Workshop on Algorithmic Decision Theory
2008
[en] Judgment aggregation, ; group decision-making
[en] Judgment aggregation (JA) studies how to aggregate individual judgments to
form collective decisions. Examples are expert panels, legal courts, boards, and
councils. The problems investigated in this new field are relevant and common to
many situations. Nevertheless, the existing procedures are idealized and, likewise
the related problems of preference aggregation in social choice theory, the field is
plagued by impossibility theorems. In this paper, we extend standard JA in order to
offer a more realistic framework and to escape the impossibility results. We propose
to distinguish between abstainers and neutral judgment as well as to model the notion
of confidence a group member may have in the decision rule by assigning to each
criterion a normalized weight. We then show how this new framework may help us
to avoid indecision in most cases.
Researchers ; Professionals ; Students ; General public ; Others
http://hdl.handle.net/10993/25054
http://www.pigozzi.org/DIMACS_Benamara_Kaci_Pigozzi.pdf

There is no file associated with this reference.

Bookmark and Share SFX Query

All documents in ORBilu are protected by a user license.