On the (numerical) ranking associated with any finite binary relation
From MaRDI portal
Publication:1765564
DOI10.1016/j.jmp.2004.03.003zbMath1055.91067MaRDI 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
91C05: Measurement theory in the social and behavioral sciences
91E45: Measurement and performance in psychology
Related Items
Cites Work
- Unnamed Item
- 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
- Almost connected orders