For each assignment market, an associated bargaining problem is defined and some bargaining solutions to this problem are analyzed. For a particular choice of the disagreement point, the Nash solution and the Kalai-Smorodinsky solution coincide and give the midpoint between the buyers-optimal...

We conduct a laboratory experiment to study how, after a history of decay, cooperation in a repeated voluntary contribution game can be revived in an enduring way. Simply starting the repeated game over - a simple fresh start - leads to an initial increase of cooperation, but to a subsequent new...

The purpose of this paper is to generalize the theory of "equal share analysis", developed by Selten in 1972, to the one in which every player has a positive weight. We show that for any positive vector of weights, it is always possible to find a coalition structure and a payoff vector forming a...

Using a bi-choice graph technique (Klaus and Klijn, 2009), we show that a matching for a roommate market indirectly dominates another matching if and only if no blocking pair of the former is matched in the latter (Proposition 1). Using this characterization of indirect dominance, we investigate...

Existence of von NeumannMorgenstern solutions (stable sets) is proved for any assignment game. For each optimal matching, a stable set is defined as the union of the core of the game and the core of the subgames that are compatible with this matching. All these stable sets exclude third-party...