Wilson's theorem for consensus functions on hierarchies
From MaRDI portal
Publication:947073
DOI10.1016/j.dam.2007.05.034zbMath1151.91424OpenAlexW1990876833MaRDI QIDQ947073
Robert C. Powers, Jeremy M. White
Publication date: 29 September 2008
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2007.05.034
Related Items (2)
Universally beneficial manipulation: a characterization ⋮ An axiomatic study of majority-rule \((+)\) and associated consensus functions on hierarchies
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On an independence condition for consensus \(n\)-trees
- Consensus n-trees
- Independence conditions for consensus \(n\)-trees revisited
- Stability conditions for consensus functions defined on \(n\)-trees
- Arrow's Theorem for closed weak hierarchies
- On the Arrow and Wilson impossibility theorems
- Tree structures for proximity data
- t or 1 - t. That is the Trade-Off
- Axiomatic Consensus Theory in Group Choice and Biomathematics
This page was built for publication: Wilson's theorem for consensus functions on hierarchies