Independence conditions for consensus \(n\)-trees revisited

DOI10.1016/0893-9659(91)90142-IzbMath0749.90005OpenAlexW2000325382MaRDI QIDQ1180319

Jean-Pierre Barthelemy, Robert C. Powers, Fred R. McMorris

Publication date: 27 June 1992

Published in: Applied Mathematics Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0893-9659(91)90142-i

zbMATH Keywords

correctionArrow's Theoremconsensus \(n\)-trees

Mathematics Subject Classification ID

Social choice (91B14)

Related Items

Dictatorial consensus functions on \(n\)-trees ⋮ Hierarchies and ternary separation ⋮ Some axiomatic limitations for consensus and supertree functions on hierarchies ⋮ Stability conditions for consensus functions defined on \(n\)-trees ⋮ Arrow's Theorem for closed weak hierarchies ⋮ Sen's theorem for hierarchies ⋮ Wilson's theorem for consensus functions on hierarchies ⋮ Consensus functions on trees that satisfy an independence axiom

Cites Work

• On an independence condition for consensus \(n\)-trees
• Unnamed Item