Ranking the Vertices of a Paired Comparison Digraph

DOI10.1137/0606009zbMath0572.05030OpenAlexW1985323485MaRDI QIDQ3689208

A. Sakamoto, Mikio Kano

Publication date: 1985

Published in: SIAM Journal on Algebraic Discrete Methods (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/0606009

zbMATH Keywords

scoringweight functiontournamentpaired comparison digraphoptimal rankings

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Extremal problems in graph theory (05C35) Management decision making, including multiple objectives (90B50) Directed graphs (digraphs), tournaments (05C20)

Related Items (8)

A survey on the linear ordering problem for weighted or unweighted tournaments ⋮ Ranking the vertices of a complete multipartite paired comparison digraph ⋮ Sum of lengths of inversions in permutations ⋮ An updated survey on the linear ordering problem for weighted or unweighted tournaments ⋮ Characterizations of the 3-cycle count and backward length of a tournament ⋮ Scoring of web pages and tournaments-axiomatizations ⋮ Ranking the vertices of an r-partite paired comparison digraph ⋮ Ranking the vertices of a weighted digraph using the length of forward arcs

Cites Work

• Unnamed Item
• Unnamed Item
• Ranking the Participants in a Tournament
• Ranking the vertices of a weighted digraph using the length of forward arcs
• On Generalized Tournament Matrices

This page was built for publication: Ranking the Vertices of a Paired Comparison Digraph