Choice by lexicographic semiorders
将Tversky的词典式半序偏好模型推广为有限理性选择的一般模型，用可观测的选择数据给出公理刻画，并探讨与序贯理性化选择的关系。
In Tversky's (1969) model of a lexicographic semiorder, preference is generated by the sequential application of numerical criteria, by declaring an alternative x better than an alternative y if the first criterion that distinguishes between x and y ranks x higher than y by an amount exceeding a fixed threshold. We generalize this idea to a fully-fledged model of boundedly rational choice. We explore the connection with sequential rationalizability of choice (Apesteguia and Ballester 2009, Manzini and Mariotti 2007), and we provide axiomatic characterizations of both models in terms of observable choice data.