Choice behavior is rational if it is based on the maximization of some context-independent preference relation. This study re-examines the questions of implementation theory in a setting where players’ choice behavior need not be rational and coalition formation must be taken into account. Our...

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

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.

We model a boundedly rational agent who suffers from limited attention. The agent considers each feasible alternative with a given (unobservable) probability, the attention parameter, and then chooses the alternative that maximises a preference relation within the set of considered alternatives....