One set of n objects of type I, another set of n objects of type II, and an amount M of money is to be completely allocated among n agents in such a way that each agent gets one object of each type with some amount of money. We propose a new solution concept to this problem called a perfectly...

In this note we provide a neccesary and sufficient condition for the non-emptiness of the socially stable core of a general structured TU-game which resembles closely the classical condition of balancedness given by Bondareva (1963) and Shapley (1967) to guarantee the non-emptiness of the...