We study a special three-sided matching game, the so-called supplier-firm-buyer game, in which buyers (customers) and …-firm-buyer games have non-empty core. We show that for these games the core coincides with the classical bargaining set (Davis and …

the average rankings of the other types of groups. We show that a core stable coalition structure always exists, provided …

We develop a theory of stability in many-to-many matching markets. We give conditions under which the setwise …-stable set, a core-like concept, is nonempty and can be approached through an algorithm. The usual core may be empty. The setwise … parallels the standard theory of stability for many-to-one, and one-to-one, models. We provide results for a number of core …

when agents are farsighted in one-to-one matching problems. We provide the characterization of von Neumann … set and its element is a corewise stable matching. Thus, contrary to the von Neumann-Morgenstern (myopically) stable sets … show that our main result is robust to many- to-one matching problems with responsive preferences …

We study von Neumann Morgenstern stable sets for one-to-one matching problems under the assumption of coalitional … matchings that belong to the core. We also show that the pairwise and coalitional analogues of the level-1 farsighted set yield … the core as the unique prediction …