Axioms for consensus functions based on lower bounds in posets

  • Day W
  • McMorris F
  • Meronk D
  • 4


    Mendeley users who have this article in their library.
  • 0


    Citations of this article.


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.

Author-supplied keywords

  • Axiomatic characterization
  • consensus method
  • iterated maximal lower bound operator
  • partially ordered set

Get free article suggestions today

Mendeley saves you time finding and organizing research

Sign up here
Already have an account ?Sign in

Find this document


Cite this document

Choose a citation style from the tabs below

Save time finding and organizing research with Mendeley

Sign up for free