Language:   Search:   Contact
Zentralblatt MATH has released its new interface!
For an improved author identification, see the new author database of ZBMATH.

Query:
Fill in the form and click »Search«...
Format:
Display: entries per page entries
Zbl 1026.06006
Leclerc, Bruno
The median procedure in the semilattice of orders.
(English)
[J] Discrete Appl. Math. 127, No.2, 285-302 (2003). ISSN 0166-218X

Summary: Let $X$ be a finite set; we are concerned with the problem of finding a consensus order $P$ that summarizes an $m$-tuple (profile) $P^*$ of (partial) orders on $X$. A classical approach is to consider a distance function $d$ on the set $O$ of all the orders of $X$ and to search to minimize the remoteness $\sum_{1\le i\le m} d(P,P_i)$. We study some properties of this median procedure, and compare it with some other consensus approaches. Besides the classical symmetric difference metric, other distances are considered, and we particularly address the consequences for the consensus problem of the existence of a semilattice structure on the set $O$.
MSC 2000:
*06A12 Semilattices
91B14 Social choice
06A06 Partial order

Keywords: consensus order; distance function; remoteness; median procedure; semilattice

Highlights
Master Server