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

We consider various lexicographic allocation procedures for coalitional games with transferable utility where the payoffs are computed in an externally given order of the players. The common feature of the methods is that if the allocation is in the core, it is an extreme point of the core. We...

We prove that the core of an assignment game (a two-sided matching game with transferable utility as introduced by Shapley and Shubik, 1972) is stable (i.e., it is the unique von Neumann-Morgenstern solution) if and only if there is a matching between the two types of players such that the...

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