Consensus system for solving conflicts in distributed systems
Information Sciences—Informatics and Computer Science: An International Journal
The median function on distributive semilattices
Discrete Applied Mathematics - Special issue: The 1998 conference on ordinal and symbolic data analysis (OSDA '98)
Medians and majorities in semimodular posets
Discrete Applied Mathematics - Special issue: The 1998 conference on ordinal and symbolic data analysis (OSDA '98)
Median problem in some plane triangulations and quadrangulations
Computational Geometry: Theory and Applications
Deriving consensus for conflict data in web-based systems
IEA/AIE'2003 Proceedings of the 16th international conference on Developments in applied artificial intelligence
Methods for achieving susceptibility to consensus for conflict profiles
Journal of Intelligent & Fuzzy Systems: Applications in Engineering and Technology
Using Distance Functions to Solve Representation Choice Problems
Fundamenta Informaticae
The t-median function on graphs
Discrete Applied Mathematics
Correction of misclassifications using a proximity-based estimation method
EURASIP Journal on Applied Signal Processing
An axiomatic study of Majority-rule (+ ) and associated consensus functions on hierarchies
Discrete Applied Mathematics
Using Distance Functions to Solve Representation Choice Problems
Fundamenta Informaticae
| Hi-index | 0.00 |
A consensus rule on a finite set $X$ is a function $c$ from the set of $k$-tuples for all $k 0$ into the set of nonempty subsets of $X$. Elements in the image of $c$ represent a consensus, or agreement, of the input. Axioms for consensus rules are presented, and when $X$ is partially ordered, some consequences of these axioms are determined. A generalization of the median consensus rule is given when $X$ is a distributive semilattice and is based on a weighting of the least move metric on the covering graph of $X$. It is characterized under the assumption that every join irreducible of $X$ is an atom.