We apply stochastic stability to study the evolution of bidding behavior in private-values second-price, first-price and k-double auctions. The learning process has a strong component of inertia but with a small probability, the bids are modified in the direction of ex-post regrets. We identify...

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

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

In contexts in which players have no priors, we analyze a learning process based on ex-post regret as a guide to understand how to play games of incomplete information under private values. The conclusions depend on whether players interact within a fixed set (fixed matching) or they are...

We consider the regret matching process with finite memory. For general games in normal form, it is shown that any recurrent class of the dynamics must be such that the action profiles that appear in it constitute a closed set under the 'same or better reply' correspondence (CUSOBR set) that...

The paper reports on an experiment on two-player double-auction bargaining with private values. We consider a setting with discrete two-point overlapping distributions of traders' valuations, in which there exists a fully efficient equilibrium. We show that if there are traders that behave...

Samuelson's (1938) weak (generalized) axiom of revealed preference- WGARP-is a minimal and appealing consistency condition of choice. We offer a rationalization of WGARP in general settings. Our main result is an exact analog of the celebrated Afriat's theorem, but for WGARP. Its ordinal...

The Slutsky matrix function encodes all the information about local variations in demand with respect to small (Slutsky) compensated price changes. When the demand function is the result of utility maximization the Slutsky matrix is symmetric. However, symmetry does not imply rationality. Here,...

The Nash program is an important research agenda initiated in Nash (Econometrica 21:128-140, 1953) in order to bridge the gap between the noncooperative and cooperative counterparts of game theory. The program is thus turning sixty-seven years old, but I will argue it is not ready for...

Restricting attention to economic environments, we study implementation under perturbed better-response dynamics (BRD). A social choice function (SCF) is implementable in stochastically stable strategies of perturbed BRD whenever the only outcome supported by the stochastically stable strategies...