Abstract. We propose a rule of decision-making, the sequential procedure guided by routes, and show that three influential boundedly rational choice models can be equiva-lently understood as special cases of this rule. In addition, the sequential procedure guided by routes is instrumental in showing that the three models are intimately related. We show that choice with a status-quo bias is a refinement of rationalizability by game trees, which, in turn, is also a refinement of sequential rationalizability. Thus, we provide a sharp taxonomy of these choice models, and show that they all can be understood as choice by sequential procedures
Decision-makers frequently struggle to base their choices on an exhaustive evaluation of all options...
In Tversky’s (1969) model of a lexicographic semiorder, a preference is generated via the sequential...
There are at least two plausible generalisations of subjective expected utility (SEU) theory: cumula...
Abstract. A choice function is sequentially rationalizable if there is an ordered collection of asym...
A sequentially rationalizable choice function is a choice function that can be retrieved by applying...
A sequentially rationalizable choice function is a choice function that can be retrieved by applying...
A choice function is sequentially rationalizable if there is an ordered collection of asymmetric bin...
Choice functions on gambles (uncertain rewards) provide a framework for studying diverse preference ...
This paper presents new insights and novel algorithms for strategy selection in sequential decision ...
We present four choice functions which characterize the stationary points of sequential search rules...
We present four choice functions which characterize the stationary points of sequential search rules...
We present four choice functions which characterize the stationary points of sequential search rules...
In this paper, we study the link between choices derived from monotonous set-dependent preferences a...
Decision-makers frequently struggle to base their choices on an exhaustive evaluation of all options...
Decision-makers frequently struggle to base their choices on an exhaustive evaluation of all options...
Decision-makers frequently struggle to base their choices on an exhaustive evaluation of all options...
In Tversky’s (1969) model of a lexicographic semiorder, a preference is generated via the sequential...
There are at least two plausible generalisations of subjective expected utility (SEU) theory: cumula...
Abstract. A choice function is sequentially rationalizable if there is an ordered collection of asym...
A sequentially rationalizable choice function is a choice function that can be retrieved by applying...
A sequentially rationalizable choice function is a choice function that can be retrieved by applying...
A choice function is sequentially rationalizable if there is an ordered collection of asymmetric bin...
Choice functions on gambles (uncertain rewards) provide a framework for studying diverse preference ...
This paper presents new insights and novel algorithms for strategy selection in sequential decision ...
We present four choice functions which characterize the stationary points of sequential search rules...
We present four choice functions which characterize the stationary points of sequential search rules...
We present four choice functions which characterize the stationary points of sequential search rules...
In this paper, we study the link between choices derived from monotonous set-dependent preferences a...
Decision-makers frequently struggle to base their choices on an exhaustive evaluation of all options...
Decision-makers frequently struggle to base their choices on an exhaustive evaluation of all options...
Decision-makers frequently struggle to base their choices on an exhaustive evaluation of all options...
In Tversky’s (1969) model of a lexicographic semiorder, a preference is generated via the sequential...
There are at least two plausible generalisations of subjective expected utility (SEU) theory: cumula...