We consider an economy with symmetric buyers and symmetric sellers. The sellers are in locations and post prices simultaneously. The buyers observe the prices, and each buyer visits one location. The buyers act independently and employ symmetric mixed strategies. We show that when there are...

We apply the von Neumann-Morgenstern stable set to the n-player cake division problem. Only time-preferences á la Rubinstein (1982) are assumed. The stable set is defined with respect to the following dominance relation: x dominates y if there is a player who prefers x over y even with one...

This paper studies how comparing can be used to provide information in financial markets in the presence of a hidden characteristics problem.Although an investor cannot precisely estimate the future returns of an entrepreneur's projects, the investor can mitigate the asymmetric information...

We study the ability of competitive coordination service platforms (such as auction sites and real estate agents) to facilitate trade in a directed search model where buyers have unit demands and each seller only has one good to sell. The sellers' capacity constraint leads to a coordination...

We consider an n-player bargaining problem where the utility possibility set is compact, convex, and stricly comprehensive. We show that a stationary subgame perfect Nash equilibrium exists, and that, if the Pareto surface is differentiable, all such equilibria converge to the Nash bargaining...

We provide a simple characterization of the stationary subgame perfect equilibrium of an alternating offers bargaining game when the number of players increases without a limit. Core convergence literature is emulated by increasing the number of players by replication. The limit allocation is...

We study infinitely repeated Prisoners' Dilemma, where one of the players may be demented. If a player gets demented in period t after his choice of action, he is stuck to this choice for the rest of the game. So if his last choice was "cooperate" just before dementia struck him, then he's bound...

In this paper we study the number of pure strategy Nash equilibria in large finite n-player games. A distinguishing feature of our study is that we allow general - potentially multivalued - best reply correspondences. Given the number K of pure strategies to each player, we assign to each player...