Search arXivSearch

arXiv · 2408.00454

Analysis of natural cardinal ranking vectors for pairwise comparisons and the universal efficiency of the Perron geometric mean

Abstract

In models using pair-wise (ratio) comparisons among alternatives, a cardinal ranking vector should be deduced from a reciprocal matrix. The right Perron eigenvector (RP) was traditionally used, though several other options have emerged. We consider some alternatives, mostly new, namely the entry-wise reciprocal of the left Perron vector (LP), the left singular vector (LS), the entry-wise reciprocal of the right singular vector (RS), the arithmetic and geometric means of RP and LP (AP and GP), and of LS and RS (AS and GS). (The ranking vector AS was proposed by Gass and Rapcsák (2004)). All 8 of these vectors produce the natural vector in the consistent case. We compare them empirically, in terms of efficiency, for random matrices, as a function of the number of alternatives. It turns out that the vector GP is universily efficient, and this fact is proven. The vector GS performs better that the remaining 6 vectors. We show that, for reciprocal matrices obtained from consistent matrices by modifying one column and the corresponding row, all 8 vectors are efficient. Moreover, the cone generated by the columns is efficient.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

S. Furtado, C. R. Johnson. 2024-09-02. Analysis of natural cardinal ranking vectors for pairwise comparisons and the universal efficiency of the Perron geometric mean. https://arxiv.org/abs/2408.00454

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Adjunctions, Box Products, and Forcing Families

Sidorenko's conjecture states that the number of copies of any given bipartite graph in another graph of given density is asymptotically minimized by a random graph. For bipartite graphs containing a cycle, the forcing conjecture further asserts that asymptotic equality characterizes quasi-random graphs. We establish an adjoint identity for a general class of graph-substitution operators and use it to obtain Sidorenko and forcing results for balanced blow-ups, subdivisions, Cartesian products, and strong products.

math.CO

On the Cost Number of Graphs with Determining Number Two

A distinguishing vertex coloring of a graph $G$ is a vertex coloring such that only the identity automorphism of $G$ preserves the coloring. A graph is $2$-distinguishable if it admits a distinguishing vertex coloring with two colors, and its cost $ρ(G)$ is the minimum size of a color class in such a coloring. The determining number of a graph $G$, denoted by $Det(G)$, is the minimum size of a subset $S\subseteq V(G)$ such that only the trivial automorphism fixes every element of $S$ pointwise. Boutin (J. Combin. Math. Combin. Comput. 85: 161-171, 2013) asked if $ρ(G)$ and $Det(G)$ can be arbitrarily far apart. While the case for $Det(G) = 1$ is trivial, the answer remained unknown for $Det(G) \ge 2$. In this manuscript, we show that if $Det(G)=2$ then not only is $ρ(G)$ bounded, but in fact $ρ(G) \leq 4$. This is the first resolution of Boutin's question for any nontrivial fixed determining number. Moreover, for every fixed $Det(G)= n$, we construct examples giving a lower bound on any possible upper bound for $ρ(G)$ in terms of $n$.

math.CO