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 introduce and study the problem of manipulation of choice behavior. In a class of two-stage models of decision making, with the agent's choices determined by three "psychological variables," we imagine that a subset of these variables can be selected by a "manipulator." To what extent does...

We study two-stage choice procedures in which the decision maker first preselects the alternatives whose values according to a criterion pass a menu-dependent threshold, and then maximizes a second criterion to narrow the selection further. This framework overlaps with several existing models...

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 two-stage choice procedures in which the decision maker first preselects the alternatives whose values according to a criterion pass a menu-dependent threshold, and then maximizes a second criterion to narrow the selection further. This framework overlaps with several existing models...

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 introduce and study the problem of manipulation of choice behavior. In a class of two-stage models of decision making, with the agent's choices determined by three psychological variables, we imagine that a subset of these variables can be selected by a manipulator. To what extent does this...

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 study two-stage choice procedures in which the decision maker first preselects the alternatives whose values according to a criterion pass a menu-dependent threshold, and then maximizes a second criterion to narrow the selection further. This framework overlaps with several existing models...

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