Consistent Rationalizability
Walter Bossert, Yves Sprumont, Kotaro Suzumura · Economica · 2005
Consistency of a binary relation requires any preference cycle to involve indifference only. It has been shown that consistency is necessary and sufficient for the existence of an ordering extension of a binary relation. It is therefore of interest to examine the rationalizability of choice functions by means of consistent relations. We describe the logical relationships between the different notions of rationalizability obtained if reflexivity or completeness are added to consistency. All but one such notion are characterized for general domains, and all are characterized for domains that contain all two‐element subsets of the universal set.