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

We analyze the use of discrete choice models for the estimation of risk aversion and show a fundamental flaw in the standard random utility model which is commonly used in the literature. Specifically, we find that given two gambles, the probability of selecting the riskier gamble may be larger...

Discrete choice methods are often used for the estimation of time preferences. We show that these methods have pervasive problems when based on random utility models, for which cases our results establish that the probability of selecting a later option over an earlier one may be greater for...

We offer complete characterizations of the equilibrium outcomes of two prominent agenda voting institutions that are widely used in the democratic world: the amendment, also known as the Anglo-American procedure, and the successive, or equivalently the Euro-Latin procedure. Our axiomatic...

Abdulkadiroglu et al. (2011) show that some naive participants may be better off under the Boston mechanism than under deferred acceptance. Here we show that under the veil of ignorance all naive students may prefer the Boston mechanism.

What are the best voting systems in terms of utilitarianism? Or in terms of maximin, or maximax? We study these questions for the case of three alternatives and a class of structurally equivalent voting rules. We show that plurality, arguably the most widely used voting system, performs very...

Extensive field and experimental evidence in a variety of environments show that behavior depends on a reference point. This paper provides an axiomatic characterization of this dependence. We proceed by imposing gradually more structure on both choice correspondences and preference relations,...

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 "weak axiom of revealed preference," finding the...

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 study the computational 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 "weak axiom of revealed...