On the (numerical) ranking associated with any finite binary relation

DOI10.1016/j.jmp.2004.03.003zbMath1055.91067OpenAlexW2095099707MaRDI QIDQ1765564

Michel Regenwetter, Elena Rykhlevskaia

Publication date: 23 February 2005

Published in: Journal of Mathematical Psychology (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jmp.2004.03.003

zbMATH Keywords

digraphorderbinary relationmeasurement scalesgeneralized rankingrank position

Mathematics Subject Classification ID

Measurement theory in the social and behavioral sciences (91C05) Measurement and performance in psychology (91E45)

Related Items (1)

A general concept of scoring rules: general definitions, statistical inference, and empirical illustrations

Cites Work

• Unnamed Item
• How to select and how to rank projects: The PROMETHEE method
• The Copeland choice function. An axiomatic characterization
• Probability models on rankings
• Exploitation of a crisp relation in a ranking problem
• Ranking methods based on valued preference relations. A characterization of the net flow method
• Parallel concepts in graph theory
• Linear discrepancy and weak discrepancy of partially ordered sets
• Robust and neutral methods for aggregating preferences into an outranking relation
• Does the Borda rule provide more than a ranking?
• Semiorders and a Theory of Utility Discrimination
• Foundational aspects of theories of measurement
• Note—A Preference Ranking Organisation Method
• Ranking the Participants in a Tournament
• Ranking Alternatives on the Basis of Preference Relations: A Progress Report with Special Emphasis on Outranking Relations
• Almost connected orders

This page was built for publication: On the (numerical) ranking associated with any finite binary relation