Howard (1992) argues that the Nash bargaining solution is not Nash implementable, as it does not satisfy Maskin monotonicity. His arguments can be extended to other bargaining solutions as well. However, by defining a social choice correspondence that is based on the solution rather than on its...

We discuss two support results for the Kalai-Smorodinsky bargaining solution in the context of an object division problem involving two agents. Allocations of objects resulting from strategic interaction are obtained as a demand vector in a specific market. For the first support result games in...

We analyse the two-dimensional Nash bargaining solution (NBS) deploying a standard labour market negotiations model (McDonald and Solow, 1981). We show that the two-dimensional bargaining problem can be decomposed into two one-dimensional problems such that the two solutions together replicate...

Howard (1992) argues that the Nash bargaining solution is not Nash implementable, as it does not satisfy Maskin monotonicity. His arguments can be extended to other bargaining solutions as well. However, by defining a social choice correspondence that is based on the solution rather than on its...

Howard (1992) argues that the Nash bargaining solution is not Nash implementable, as it does not satisfy Maskin monotonicity. His arguments can be extended to other bargaining solutions as well. However, by de.ning a social choice correspondence that is based on the solution rather than on its...

We discuss a model, in which two agents may distribute finitely many objects among themselves. The conflict is resolved by means of a market procedure. Depending on the specifications, this procedure serves to implement bargaining solutions such as the discrete Raiffa solution, the...

We analyse the two-dimensional Nash bargaining solution (NBS) deploying a standard labour market negotiations model (McDonald and Solow, 1981). We show that the two-dimensional bargaining problem can be decomposed into two one-dimensional problems such that the two solutions together replicate...

We consider two-sided matching markets with couples. First, we extend a result by Klaus and Klijn (2005, Theorem 3.3) and show that for any weakly responsive couples market there always exists a "double stable" matching, i.e., a matching that is stable for the couples market and for any...

We consider general two-sided matching markets, so-called matching with contracts markets as introduced by Hatfield and Milgrom (2005), and analyze (Maskin) monotonic and Nash implementable solutions. We show that for matching with contracts markets the stable correspondence is monotonic and...