Ranking the vertices of an r-partite paired comparison digraph (Q1821792)

A digraph with a weight function c is called paired comparison digraph (PCD) if c satisfies the following conditions: (i) \(0<c(vw)\leq 1\) for every vw\(\in A(D)\), (ii) \(c(vw)+c(wv)=1\) if vw,wv\(\in A(D)\), (iii) \(c(vw)=1\) if vw\(\in A(D)\) and wv\(\not\in A(D)\). A ranking \(\alpha\) of D (a one-to-one mapping from V(D) onto \(\{\) 1,2,...,\(| V(D)| \}\) is called optimal if \(B(\alpha)=\Sigma c(vw)(\alpha (v)-\alpha (w))\), where the sum is taken over all arcs vw such that \(\alpha (w)<\alpha (v)\), is minimum among all rankings of D. The authors show how to obtain all the optimal rankings of a certain r-partite PCD.