Multisided matching games with complementarities

The paper considers multisided matching games with transfereable utility us ing the approach of cooperative game theory. Stable matchings are shown: to exist when characteristic functions are supermodular, i.e., agents' abilit ies to contribute to the value of a coalition are complementary across type s. We analyze the structure of the core of supermodular matching games and suggest an algorithm for constructing its extreme payoff vectors.