Stability conditions for consensus functions defined on n-trees
From MaRDI portal
Publication:1900286
Recommendations
- Consensus functions on trees that satisfy an independence axiom
- Dictatorial consensus functions on \(n\)-trees
- Consensus functions on tree quasi-orders that satisfy an independence condition
- An axiomatic study of majority-rule \((+)\) and associated consensus functions on hierarchies
- On an independence condition for consensus \(n\)-trees
Cites work
- scientific article; zbMATH DE number 1484746 (Why is no real title available?)
- A Formal Theory of Consensus
- An Axiomatic Theory of Tournament Aggregation
- Consensus functions defined on trees
- Consensus functions on trees that satisfy an independence axiom
- Dictatorial consensus functions on \(n\)-trees
- Faithful consensus methods for n-trees
- Independence conditions for consensus \(n\)-trees revisited
- Neutral consensus functions
- On an independence condition for consensus \(n\)-trees
- Printer graphics for clustering
- Social choice and individual values
- Tree structures for proximity data
Cited in
(7)- Removal independent consensus methods for closed \(\beta \)-systems of sets
- On an independence condition for consensus \(n\)-trees
- Wilson's theorem for consensus functions on hierarchies
- Consensus functions on tree quasi-orders that satisfy an independence condition
- Some axiomatic limitations for consensus and supertree functions on hierarchies
- On the stability of hierarchical classification: qualitative approaches
- scientific article; zbMATH DE number 1484746 (Why is no real title available?)
This page was built for publication: Stability conditions for consensus functions defined on \(n\)-trees
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1900286)
