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 present a new notion of cardinal revealed preference that exploits the expenditure information in classical consumer theory environments with finite data. We propose a new behavioral axiom, Acyclic Enticement (AE), that requires the acyclicity of the cardinal revealed-preference relation. AE...

Models of choice where agents see others as less sophisticated than themselves have significantly different, sometimes more accurate, predictions in games than does Nash equilibrium. When it comes to mechanism design, however, they turn out to have surprisingly similar implications. This paper...

Given any observed demand behavior by means of a demand function, we quantify by how much it departs from rationality. Using a recent elaboration of the "almost implies near" principle, the measure of the gap is the smallest norm of the correcting matrix that would yield a Slutsky matrix with...

We consider mechanism design in contexts in which agents exhibit bounded depth of reasoning (level k ) instead of rational expectations. We use simple direct mechanisms, in which agents report only first-order beliefs. While level 0 agents are assumed to be truth tellers, level k agents...

Given any observed finite sequence of prices, wealth and demand choices, we characterize the relation between its underlying Slutsky matrix norm (SMN) and some popular discrete revealed preference (RP) measures of departures from rationality, such as the Afriat index. We show that testing...