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

We study environments in which agents are randomly matched to play a Prisoner's Dilemma, and each player observes a few of the partner's past actions against previous opponents. We depart from the existing related literature by allowing a small fraction of the population to be commitment types....

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

We report experiments designed to test between Nash equilibria that are stable and unstable under learning. The 'TASP' (Time Average of the Shapley Polygon) gives a precise prediction about what happens when there is divergence from equilibrium under fictitious play like learning processes. We...

We report laboratory experiments that use new, visually oriented software to explore the dynamics of 3 x 3 games with intransitive best responses. Each moment, each player is matched against the entire population, here 8 human subjects. A heat map offers instantaneous feedback on current profit...

We consider a dynamic auction environment with a long-lived seller and short-lived buyers mediated by a third party. A mediator has incomplete information about traders' values and selects an auction mechanism to maximize her expected revenue. We characterize mediator-optimal mechanisms and show...

The theoretical literature on collusion in auctions suggests that the first-price mechanism can deter the formation of bidding rings. In equilibrium, collusive negotiations are either successful or are avoided altogether, hence such analysis neglects the effects of failed collusion attempts. In...

This paper constructs a novel equilibrium in the chopstick auction of Szentes and Rosenthal (Games and Economic Behavior, 2003a, 2003b). In contrast to the existing solution, the identified equilibrium strategy allows a simple and intuitive characterization. Moreover, its best-response set has...

Fees are omnipresent in markets but, with few exceptions, are omitted in economic models-such as Double Auctions-of these markets. Allowing for general fee structures, we show that their impact on incentives and efficiency in large Double Auctions hinges on whether the fees are homogeneous (as,...