Premium
Multiattribute signed orders
Author(s) -
Fishburn Peter C.
Publication year - 1992
Publication title -
journal of multi‐criteria decision analysis
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.462
H-Index - 47
eISSN - 1099-1360
pISSN - 1057-9214
DOI - 10.1002/mcda.4020010103
Subject(s) - disjoint sets , axiom , order (exchange) , preference , preference relation , relation (database) , set (abstract data type) , combinatorics , mathematics , discrete mathematics , computer science , mathematical economics , statistics , data mining , geometry , finance , economics , programming language
A self‐reflecting signed order is a preference relation that compares relative likes and dislikes for items in a set X by jointly ordering X and a disjoint copy of X. If you would like Jones but not Smith appointed to a committee, and also think it more important to exclude Smith than include Jones, your self‐reflecting signed order records this information. We review basic representational theory for signed orders, then examine them when X is multiattributed. Axioms for additive measurement of multiattribute self‐reflecting signed orders are specified for several X ‐structures.