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

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

We study and test a class of boundedly rational models of decision making which rely on sequential eliminative heuristics. We formalize two sequential decision procedures, both inspired by plausible models popular among several psychologists and marketing scientists. However we follow a standard...

If choices depend on the decision maker's mood, is the attempt to derive any consistency in choice doomed? In this paper we argue that, even with full unpredictability of mood, the way choices from a menu relate to choices from another menu exhibits some structure. We present two alternative...