Top responsiveness is introduced by Alcalde and Revilla [Journal of Mathematical Economics 40 (2004) 869-887] as a property which induces a rich domain on playerss preferences in hedonic games, and guarantees the existence of core stable partitions. We strengthen this observation by proving the...

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

This article provides an exact non-cooperative foundation of the sequential Raiffa solution for two person bargaining games. Based on an approximate foundation due to Myerson (1997) for any two-person bargaining game (S, d) an extensive form game G^{S,d} is defined that has an infinity of weakly...

We investigate the relationship between the inner core and asymmetric Nash bargaining solutions for n-person bargaining games with complete information. We show that the set of asymmetric Nash bargaining solutions for different strictly positive vectors of weights coincides with the inner core...

By viewing negotiation problems as problems of fair division, one can apply intuitive procedures to a variety of complex conflicts. This, however, requires the negotiated issues to be interpreted as items to be divided among the parties involved. In this paper, we go in the opposite direction...

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

We are concerned with the problem of core membership testing for hedonic coalition formation games, which is to decide whether a certain coalition structure belongs to the core of a given game. We show that this problem is co-NP complete when players' preferences are additive.