The theory of learning in games explores how, which, and what kind of equilibria might arise as a consequence of a long-run nonequilibrium process of learning, adaptation, and/or imitation. If agents’ strategies are completely observed at the end of each round (and agents are randomly matched...

In this paper, we examine the optimal mechanism design of selling an indivisible object to one regular buyer and one publicly known buyer, where inter-buyer resale cannot be prohibited. The resale market is modeled as a stochastic ultimatum bargaining game between the two buyers. We fully...

This paper examines the optimal mechanism design problem when buyers have uncertain valuations. This uncertainty can only be resolved after the actual transactions take place and upon incurring significant post-purchase cost. We focus on two different settings regarding how the seller values a...

In the paper, the concept of Walrasian sequential equilibrium is developed to formalize the notions of fundamental social and endogenous uncertainties and decentralized social learning. It predicts that social sequential experiments with efficient as well as inefficient network patterns of...

This paper studies a model of memory. The model takes into account that memory capacity is limited and imperfect. We study how agents with such memory limitations, who have very little information about their choice environment, play games. We introduce the notion of a Limited Memory Equilibrium...

If the agent’s preference relation satisfies a strict monotonicity condition in common agency under the asymmetric information, the set of all equilibrium allocations in the menu game where menus of contracts are allowed coincides with the set of all equilibrium allocations in the single...

We study a mechanism design problem in which players can take part in a mechanism to coordinate their actions in a default game. By refusing to participate in the mechanism, a player can revert to playing the default game non-cooperatively. We show with an example that some allocation rules are...

We derive several implications of incentive compatibility in general (i.e., not necessarily quasilinear) environments. Building on Kos and Messner (2013), we provide a (partial) characterization of incentive compatible mechanisms.

Every agent reports his willingness to pay for one unit of a good. A mechanism allocates goods and cost shares to some agents. We characterize the group strategyproof (GSP) mechanisms under two alternative continuity conditions interpreted as tie-breaking rules. With the maximalist rule (MAX) an...

We uncover a new necessary condition for implementation in iteratively undominated strategies by mechanisms that satisfy the “best element property” where for each agent, there exists a strategy profile that gives him the highest payoff in the mechanism. This class includes finite and...