Axioms for consensus functions based on lower bounds in posets

Citations of this article
Mendeley users who have this article in their library.
Get full text


Let (X, ≤) be a finite partially ordered set with a unique minimal element, and consider the problem of associating with each subset of X a corresponding set of consensus objects. When based on lower bound operators, such consensus functions are interesting because their consensus objects can be interpreted as conservative representations of structure inherent in the objects being studied. We extend early results of Pfaltz to obtain an axiomatic characterization of a consensus function based on an iterated maximal lower bound operator, and we relate this function to a recent consensus proposal of Bonacich. © 1986.




Day, W. H. E., McMorris, F. R., & Meronk, D. B. (1986). Axioms for consensus functions based on lower bounds in posets. Mathematical Social Sciences, 12(2), 185–190.

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free