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

In this paper we demonstrate a new method for computing approximate Nash equilibria in n-person games. Strategy spaces are assumed to be represented by simplices, while payoff functions are assumed to be concave. Our procedure relies on a simplicial algorithm that traces paths through the set of...

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