scientific article; zbMATH DE number 1484746
From MaRDI portal
Recommendations
- Consensus functions on trees that satisfy an independence axiom
- Dictatorial consensus functions on \(n\)-trees
- Pareto, anonymity, and independence: four alternatives
- Stability conditions for consensus functions defined on \(n\)-trees
- Efficient and binary consensus functions on transitively valued relations
Cited in
(9)- Removal independent consensus methods for closed \(\beta \)-systems of sets
- Consensus functions on tree quasi-orders that satisfy an independence condition
- Stability conditions for consensus functions defined on \(n\)-trees
- MUL-tree pruning for consistency and optimal reconciliation -- complexity and algorithms
- The majority vote process and other consensus processes on trees
- Dictatorial consensus functions on \(n\)-trees
- Hierarchies and ternary separation
- Wilson's theorem for consensus functions on hierarchies
- On the stability of hierarchical classification: qualitative approaches
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4493449)