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

Michel Regenwetter, Elena Rykhlevskaia

Research output: Contribution to journalArticlepeer-review


We generalize the concept of a 'ranking associated with a linear order' from linear orders to arbitrary finite binary relations. Using the concept of differential of an object in a binary relation as theoretical primitive, we axiomatically introduce several measurement scales, some of which include the generalized ranking as a special case. We provide a computational formula for this generalized ranking, discuss its many elegant properties and offer some illustrating examples.

Original languageEnglish (US)
Pages (from-to)239-246
Number of pages8
JournalJournal of Mathematical Psychology
Issue number4
StatePublished - Aug 2004


  • Binary relation
  • Digraph
  • Order
  • Rank position
  • Ranking
  • Scale

ASJC Scopus subject areas

  • Psychology(all)
  • Applied Mathematics


Dive into the research topics of 'On the (numerical) ranking associated with any finite binary relation'. Together they form a unique fingerprint.

Cite this