We study a special three-sided matching game, the so-called supplier-firm-buyer game, in which buyers (customers) and sellers (suppliers) trade indirectly through middlemen (firms). Stuart (Stuart, 1997) showed that all supplier-firm-buyer games have non-empty core. We show that for these games...

In this paper, we study different notions of stability for three-sided assignment games. Since the core may be empty in this case, we first focus on other notions of stability such as the notions of subsolution and von Neumann-Morgenstern stable sets. The dominant diagonal property is necessary...

We study a special three-sided matching game, the so-called supplier-firm-buyer game, in which buyers (customers) and sellers (suppliers) trade indirectly through middlemen (firms). Stuart (Stuart, 1997) showed that all supplier-firm-buyer games have non-empty core. We show that for these games...

In this paper, we study different notions of stability for three-sided assignment games. Since the core may be empty in this case, we first focus on other notions of stability such as the notions of subsolution and von Neumann-Morgenstern stable sets. The dominant diagonal property is necessary...

Pairing Games or Markets studied here are the non-two-sided NTU generalization of assignment games. We show that the Equilibrium Set is nonempty, that it is the set of stable allocations or the set of semistable allocations, and that it has several notable structural properties. We also...