Home
Scholarly Works
Some Remarks on Approximations of Arbitrary Binary...
Conference

Some Remarks on Approximations of Arbitrary Binary Relations by Partial Orders

Abstract

When a non-numerical ranking is created using Pairwise Comparisons paradigm, its first estimation is a binary relation which may not even be a partial order. In the paper four different partial order approximations of an arbirary binary relation are introduced and discussed.

Authors

Janicki R

Series

Lecture Notes in Computer Science

Volume

5306

Pagination

pp. 81-91

Publisher

Springer Nature

Publication Date

January 1, 2008

DOI

10.1007/978-3-540-88425-5_9

Conference proceedings

Lecture Notes in Computer Science

ISSN

0302-9743

Labels

View published work (Non-McMaster Users)

Contact the Experts team