Math Problem Statement

Start with a strict preference relation ≻ that is asymmetric and transitive, (but not negatively transitive). Define weak preference ⪰ by x ⪰ y ⇐⇒ ¬(y ≻ x), and indifference ∼ by x ∼ y ⇐⇒ ¬(x ≻ y) and ¬(y ≻ x). Give an example of such a strict preference where the derived ⪰ is not a rational preference relation.

Solution

To construct an example where the derived weak preference relation ⪰ is not rational, we need to focus on the failure of completeness in the derived relation ⪰. A rational preference relation is both transitive and complete. Since we are given that the strict preference ≻ is asymmetric and transitive but not negatively transitive, the derived weak preference ⪰ can fail to be rational due to the lack of completeness.

Key points:

  • Asymmetry of ≻ means that if xyx \succ y, then y⊁xy \not\succ x.
  • Transitivity of ≻ means that if xyx \succ y and yzy \succ z, then xzx \succ z.
  • Completeness of ⪰ requires that for any two elements xx and yy, either x\⪰yx \⪰ y or y\⪰xy \⪰ x.
  • Negative transitivity (which we assume does not hold) means that if x⊁yx \not\succ y and y⊁zy \not\succ z, then x⊁zx \not\succ z. This failure can lead to incompleteness in the weak preference.

Example:

Let the set of alternatives be A={a,b,c}A = \{ a, b, c \}, and define the strict preference relation ≻ as follows:

  • aba \succ b
  • bcb \succ c

Thus, the strict preference ≻ is asymmetric and transitive (since aca \succ c by transitivity of ≻).

Now let's look at the derived weak preference relation ⪰ defined by: x\⪰y    ¬(yx)x \⪰ y \iff \neg(y \succ x)

Derived Weak Preferences:

  • aba \succ b implies a\⪰ba \⪰ b and b̸\⪰ab \not\⪰ a.
  • bcb \succ c implies b\⪰cb \⪰ c and c̸\⪰bc \not\⪰ b.
  • However, neither aca \succ c nor cac \succ a holds directly because ≻ is only strict between aba \succ b and bcb \succ c. Therefore, we have a⊁ca \not\succ c and c⊁ac \not\succ a, which means neither a\⪰ca \⪰ c nor c\⪰ac \⪰ a.

Failure of Completeness:

In this example, there is no weak preference relationship between aa and cc. We cannot say a\⪰ca \⪰ c or c\⪰ac \⪰ a, which means the derived weak preference relation ⪰ is incomplete. Hence, it is not a rational preference relation.

Conclusion:

The derived weak preference relation ⪰ fails to be rational because it is incomplete. The key point is that, since ≻ is not negatively transitive, it leads to situations where two elements cannot be compared using the weak preference ⪰.

Would you like further details or have any questions about this concept?

Here are 5 related questions to explore further:

  1. How does the failure of negative transitivity in strict preferences affect rationality?
  2. Can you give an example where a weak preference relation is both transitive and complete?
  3. What are the differences between strict, weak, and indifference relations in preference theory?
  4. Can a weak preference relation ⪰ be complete but fail to be transitive? Why or why not?
  5. How does one formally define rationality in terms of preference relations?

Tip: A rational preference relation requires both completeness and transitivity, but a strict preference doesn't guarantee completeness when derived from a weak preference.

Ask a new question for Free

By Image

Drop file here or Click Here to upload

Math Problem Analysis

Mathematical Concepts

Preference Theory
Asymmetry
Transitivity
Completeness
Rationality of Preferences

Formulas

x ≻ y (strict preference)
x ⪰ y ⇐⇒ ¬(y ≻ x) (weak preference)
x ∼ y ⇐⇒ ¬(x ≻ y) and ¬(y ≻ x) (indifference)

Theorems

Asymmetry and Transitivity of strict preferences
Completeness and Transitivity for Rational Preferences
Negative Transitivity

Suitable Grade Level

Undergraduate (Economics, Mathematics, Philosophy)