In order theory, a branch of mathematics, a semiorder is a type of ordering for items with numerical scores, where items with widely differing scores are compared by their scores and where scores within a given margin of error are deemed incomparable. Semiorders were introduced and applied in mathematical psychology by Duncan Luce (1956) as a model of human preference. They generalize strict weak orderings, in which items with equal scores may be tied but there is no margin of error. They are a special case of partial orders and of interval orders, and can be characterized among the partial orders by additional axioms, or by two forbidden four-item suborders.
Utility theory The original motivation for introducing semiorders was to model human preferences without assuming that incomparability is a transitive relation. For instance, suppose that x {\displaystyle x} , y {\displaystyle y} , and z {\displaystyle z} represent three quantities of the same material, and that x {\displaystyle x} is larger than z {\displaystyle z} by the smallest amount that is perceptible as a difference, while y {\displaystyle y} is halfway between the two of them. Then, a person who desires more of the material would prefer x {\displaystyle x} to z {\displaystyle z} , but would not have a preference between the other two pairs. In this example, x {\displaystyle x} and y {\displaystyle y} are incomparable in the preference ordering, as are y {\displaystyle y} and z {\displaystyle z} , but x {\displaystyle x} and z {\displaystyle z} are comparable, so incomparability does not obey the transitive law. To model this mathematically, suppose that objects are given numerical utility values, by letting u {\displaystyle u} be any utility function that maps the objects to be compared (a set X {\displaystyle X} ) to real numbers. Set a numerical threshold (which may be normalized to 1) such that utilities within that threshold of each other are declared incomparable, and define a binary relation < {\displaystyle <} on the objects, by setting x < y {\displaystyle x<y} whenever u ( x ) ≤ u ( y ) − 1 {\displaystyle u(x)\leq u(y)-1} . Then ( X , < ) {\displaystyle (X,<)} forms a semiorder. If, instead, objects are declared comparable whenever their utilities differ, the result would be a strict weak ordering, for which incomparability of objects (based on equality of numbers) would be transitive.
Axiomatics
A semiorder, defined from a utility function as above, is a partially ordered set with the following two properties:
… excerpt ends here. Continue reading the full article.




