Two subjects have to repeatedly choose between two alternatives, A and B, where payoffs of an A or B-choice depend on the choices made by both players in a number of previous choices. Locally, alternative A gives always more payoff than alternative B. However, in terms of overall payoffs...

Two subjects have to repeatedly choose between two alternatives, A and B, where payoffs of an A or B-choice depend on the choices made by both players in a number of previous choices. Locally, alternative A gives always more payoff than alternative B. However, in terms of overall payoffs...

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

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