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...

A well-known finding in behavioral economics is that people often avoid ambiguous gambles whose outcome probabilities are unknown in favor of risky gambles whose outcome probabilities are known, a phenomenon that is called ambiguity aversion. In a novel preregistered online experiment with 1195...

We study a psychologically based foundation for choice errors. The decision maker applies a preference ranking after forming a 'consideration set' prior to choosing an alternative. Membership of the consideration set is determined both by the alternative specific salience and by the rationality...

We study a psychologically based foundation for choice errors. The decision maker applies a preference ranking after forming a 'consideration set' prior to choosing an alternative. Membership of the consideration set is determined both by the alternative specific salience and by the rationality...

We propose an extension of Tversky's lexicographic semiorder to a model of boundedly rational choice. We explore the connection with sequential rationalisability of choice, and we provide axiomatic characterisations of both models in terms of observable choice data. -- Lexicographic semiorders ;...

We study a psychologically based foundation for choice errors. The decision maker applies a preference ranking after forming a 'consideration set' prior to choosing an alternative. Membership of the consideration set is determined both by the alternative specific salience and by the rationality...

We propose an extension of Tversky's lexicographic semiorder to a model of boundedly rational choice. We explore the connection with sequential rationalisability of choice, and we provide axiomatic characterisations of both models in terms of observable choice data

A sequentially rationalizable choice function is a choice function which can be obtained by applying sequentially a fixed set of asymmetric binary relations (rationales). A Rational ShortlistMethod (RSM) is a choice function which is sequentially rationalizable by two rationales. These concepts...

The following analysis is meant to contribute to a history of rational choice theory. More specifically, I provide a multi-layered account of rational choice theory in terms of its biography as a scientific object. I argue that its axiomatic version, choice theory traveled between different...