Homework Help is Here – Start Your Trial Now!
Engineering
Data Structures and Algorithms
A preference relation on X is supposed to be rational. Show the following. (a) Reflexive: For any x € X, x ~ X. (b) Transitive: For any x; y; z € X, if x > y and y > z, then x > z. where and > are defined as follows: a ba≥b and ba a>b⇒ab and NOT ba

A preference relation on X is supposed to be rational. Show the following. (a) Reflexive: For any x € X, x ~ X. (b) Transitive: For any x; y; z € X, if x > y and y > z, then x > z. where and > are defined as follows: a ba≥b and ba a>b⇒ab and NOT ba

icon
Related questions
Question
QUESTION 1. A preference relation ≥ on X is supposed to be rational. Show the following. (a) Reflexive: For any x € X, x ~ X. (b) Transitive: For any x; y; z € X, if x > y and y > z, then x > z. where ~ and > are defined as follows: a~b⇒a≥b and b ≥ a a>b⇒a≥b and NOT b ≥ a
Transcribed Image Text:QUESTION 1. A preference relation ≥ on X is supposed to be rational. Show the following. (a) Reflexive: For any x € X, x ~ X. (b) Transitive: For any x; y; z € X, if x > y and y > z, then x > z. where ~ and > are defined as follows: a~b⇒a≥b and b ≥ a a>b⇒a≥b and NOT b ≥ a
Expert Solution
steps

Step by step

Solved in 3 steps

SEE SOLUTIONCheck out a sample Q&A here
Blurred answer