Preference relation

In binary relation a preference relation is a complete reflexive transitive binary relation.

1. A binary relation ≥ on a set A is complete if a ≥ b or b ≥ a for every a∈ A and b∈A;
2. A binary relation ≥ on a set A is reflexive if a ≥ a for every a∈ A ;
3. A binary relation ≥ on a set A is transitive if a ≥ c whenever a ≥ b and b ≥ c for every a∈ A,b∈A and c∈A ;