Vincke et Bouyssou ont montré que, si une procédure d'agrégation de préordres totaux peut retourner plusieurs solutions, alors elle peut satisfaire tous les axiomes du théorème d'Arrow sans être pour autant dictatoriale. Nous étendons cette approche aux hiérarchies utilisées en classification. Dans ce contexte, on obtient des résultats qui peuvent différer de ceux de Vincke et de Bouyssou.
Work of Vincke and Bouyssou showed that if aggregation procedures on weak orders are allowed to return more than one result, then it might be possible for a procedure to satisfy all the axioms of Arrow's Theorem yet not be dictatorial. This approach is extended from ordered sets to n-trees, which are set-systems used in classifications theory. Results in this context can differ from those of Vincke and Bouyssou.
Mots-clés : théorie de la décision, consensus, multi-fonctions de consensus, hiérarchies, théorème d'Arrow
@article{MSH_1999__148__31_0, author = {Dwyer, Mark and McMorris, Fred R. and Powers, Robert C.}, title = {Removal independence and multi-consensus functions}, journal = {Math\'ematiques informatique et sciences humaines}, pages = {31--40}, publisher = {Ecole des hautes-\'etudes en sciences sociales}, volume = {148}, year = {1999}, mrnumber = {1740578}, language = {en}, url = {http://www.numdam.org/item/MSH_1999__148__31_0/} }
TY - JOUR AU - Dwyer, Mark AU - McMorris, Fred R. AU - Powers, Robert C. TI - Removal independence and multi-consensus functions JO - Mathématiques informatique et sciences humaines PY - 1999 SP - 31 EP - 40 VL - 148 PB - Ecole des hautes-études en sciences sociales UR - http://www.numdam.org/item/MSH_1999__148__31_0/ LA - en ID - MSH_1999__148__31_0 ER -
%0 Journal Article %A Dwyer, Mark %A McMorris, Fred R. %A Powers, Robert C. %T Removal independence and multi-consensus functions %J Mathématiques informatique et sciences humaines %D 1999 %P 31-40 %V 148 %I Ecole des hautes-études en sciences sociales %U http://www.numdam.org/item/MSH_1999__148__31_0/ %G en %F MSH_1999__148__31_0
Dwyer, Mark; McMorris, Fred R.; Powers, Robert C. Removal independence and multi-consensus functions. Mathématiques informatique et sciences humaines, Tome 148 (1999), pp. 31-40. http://www.numdam.org/item/MSH_1999__148__31_0/
Consensus techniques and the comparison of taxonomic trees", Systematic Zoology, 21 (1972), 390-397.
, "Social Choice and lndividual Values. 2nd edn., New York, John Wiley (1963).
,On the use of ordered sets in problems of comparison and consensus of classifications", Journal of Classification, 3 (1986), 187-224. | MR | Zbl
, and , "On an independence condition for consensus n-trees", Applied Mathematics Letters, 2 (1989), 75-78. | MR | Zbl
and , "Independence conditions for consensus n-trees revisited", Applied Mathematics Letters, 2 (1991), 43-46. | MR | Zbl
, and , "Stability conditions for consensus functions defined on n-trees", Mathematical and Computer Modelling, 22 (1995), 79-87. | MR | Zbl
, and , "Democracy and efficiency: A note on 'Arrow's theorem is not a surprising result'", European Journal of Operational Research, 58 (1992), 427-430. | Zbl
, "Tree structures for proximity data", The British Journal of Mathematical and Statistical Psychology, 34 (1981), 167-180. | MR | Zbl
and , "The average consensus procedure: combination of weighted trees containing identical or overlapping sets of objects", Systematic Zoology, 46 (1997), 306-312.
and , "Consensus en classification: une revue bibliographique", Mathématiques Informatique et Sciences Humaines, 100 (1987),109-128. | Numdam | MR | Zbl
and , "Consensus of classifications: the case of trees", in Advances in Data Science and Classification, A. Rizzi, M. Vicki and H.-H. Bock, Eds., Springer-Verlag, Berlin (1998), 81-90. | Zbl
, "Arrow's Theorem is not a surprising result", European Journal of Operational Research., 10 (1982), 22-25. | MR | Zbl
, "