A weak order approach to group ranking

DOI10.1016/0898-1221(96)00102-2zbMath0862.90011OpenAlexW1973249905MaRDI QIDQ1816679

Ryszard Janicki, Waldemar W. Koczkodaj

Publication date: 19 December 1996

Published in: Computers \& Mathematics with Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0898-1221(96)00102-2

zbMATH Keywords

Arrow's impossibility theoremgroup rankingArrow's axiomssocial function

Mathematics Subject Classification ID

Individual preferences (91B08)

Related Items (4)

Approximations of arbitrary relations by partial orders ⋮ Some Remarks on Approximations of Arbitrary Binary Relations by Partial Orders ⋮ Pairwise comparisons matrix decomposition into approximation and orthogonal component using Lie theory ⋮ A weak order solution to a group ranking and consistency-driven pairwise comparisons

Cites Work

• Unnamed Item
• Unnamed Item
• Structure of concurrency
• A scaling method for priorities in hierarchical structures
• A new definition of consistency of pairwise comparisons
• Generalization of a new definition of consistency for pairwise comparisons
• Combinatorial problems of commutation and rearrangements
• Betweenness, orders and interval graphs

This page was built for publication: A weak order approach to group ranking