Consistent Rationalizability
研究了一致性二元关系（即偏好循环中只允许无差异）对选择函数理性化的作用，分析了在一致性基础上添加自反性或完备性后不同理性化概念之间的逻辑关系，并给出了这些概念在一般论域和包含所有二元子集的论域上的刻画。
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.