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

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 focuses on the relationship between higher wages and capital intensity. The relationship itself is by no means a novel finding but we try to provide a meaningful theoretical explanation for the relationship and empirical evidence on its exact nature. Our explanation is the outcome of...

We investigate a random proposer bargaining game with a dead line. A bounded time interval is divided into bargaining periods of equal length and we study the limit of the subgame perfect equilibrium outcome as the number of bargaining periods goes to infinity while the dead line is kept fixed....

We study a Baron-Ferejohn (1989) type of bargaining model to which we append an investment stage. As long as no agreement is reached, a new proposer is selected randomly from the player set. A proposal is accepted if at least q players accept it. Prior to the bargaining stage, players may make...