A quasi-order τ on S is a tree quasi-order if it satisfies the tree condition: (z,x)∈τ and (z,y)∈τ⇒(x,y)∈τ or (y,x)∈τ.

... A tree quasi-order is a binary relation ρ on a finite set S such that ρ is reflexive, transitive, and (z, x), (z, y) ∈ ρ implies that (x, y) ∈ ρ or (y, x) ∈ ...

These two conditions are very natural and not very restrictive. The profile condition f (pD) = D is called efficiency and was considered by Leclerc in his ...

"Consensus functions on tree quasi-orders that satisfy an independence condition," Mathematical Social Sciences, Elsevier, vol. 48(2), pages 183-192 ...

Description: McMorris and Neumann in 1983 proved a straightforward analog of Arrow's Theorem for tree quasi-orders. By dropping the Pareto condition and ...

To give the reader an idea as to why consensus functions on trees are worthy of study, consider the following situation. Suppose S is a given set of n species ...

"Consensus functions on tree quasi-orders that satisfy an independence condition," Mathematical Social Sciences, Elsevier, vol. 48(2), pages 183-192 ...

Consensus functions on tree quasi-orders that satisfy an independence condition. Article. Feb 2004; MATH SOC SCI. F.R. McMorris · Robert C ...

Area: ; 2004, McMorris FR, Powers RC. Consensus functions on tree quasi-orders that satisfy an independence condition Mathematical Social Sciences. 48: 183-192.

Aug 3, 2024 · Consensus functions on tree quasi-orders that satisfy an independence condition. Math. Soc. Sci. 48(2): 183-192 (2004); 2003. [j23]. view.