Consensus weak hierarchies (Q1176714)

The present study attempts at characterizing, axiomatically, the consensus functions (representing generalizations of the majority rule consensus), defined on weak hierarchies. Special stress is laid on consensus functions creating new clusters in the output (functions that put a cluster in the output by virtue of its frequent apparition among the input hierarchies); they are defined as ``counting rules''. A consensus rule for weak hierarchies has generalized the simple majority rule for strong hierarchies [see \textit{H.-J. Bandelt} and \textit{A. W. M. Dress}, ibid. 51, No. 1, 133-166 (1989; Zbl 0666.62058)]. In a subsequent step, this rule was characterized axiomatically. The present authors intended to characterize all counting rules defined on weak hierarchies. They mention, in this respect, contributions of the first author and \textit{D. Neumann} [Math. Soc. Sci. 4, 131-136 (1983; Zbl 0511.90010)], \textit{J. P. Barthélemy} and \textit{M. F. Janowitz} [SIAM J. Discrete Math. 4, No. 3, 305-322 (1991; Zbl 0734.90008)], and \textit{H.-J. Bandelt} and \textit{G. C. Meletiou} [see Order 7, No. 2, 169-178 (1990; Zbl 0734.06008)], who gave axiomatic characterizations of certain counting rules, in very general settings.