We study the complexity of rationalizing choice behavior. We do so by analyzing two polar cases, and a number of intermediate ones. In our most structured case, that is where choice behavior is defined in universal choice domains and satisfies the quot;weak axiom of revealed preference,quot;...

We propose a rule of decision-making, the sequential procedure guided by routes, and show that three influential boundedly rational choice models can be equivalently understood as special cases of this rule. In addition, the sequential procedure guided by routes is instrumental in showing that...

A choice function is sequentially rationalizable if there is an ordered collection of asymmetric binary relations that identifies the selected alternative in every choice problem. We propose a property, F-consistency, and show that it characterizes the notion of sequential rationalizability....

A choice function is sequentially rationalizable if there is an ordered collection of asymmetric binary relations that identifies the selected alternative in every choice problem. We propose a property, F-consistency, and show that it characterizes the notion of sequential rationalizability....

We propose a rule of decision-making, the sequential procedure guided by routes, and show that three influential boundedly rational choice models can be equivalently understood as special cases of this rule. In addition, the sequential procedure guided by routes is instrumental in showing that...