We consider a standard search model with buyers and sellers. Upon meeting the buyers make a take-it-or-leave-it offer, but the sellers have an option not to trade immediately but wait for more agents to appear. If more buyers come, there is excess demand, and the buyers engage in auction to get...

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

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