We study linearly weighted versions of the least core and the (pre)nucleolus and investigatethe reduction possibilities in their computation. We slightly extend some well-known related results and establish their counterparts by using the dual game. Our main results imply, for example, that if...

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 study linearly weighted versions of the least core and the (pre)nucleolus and investigatethe reduction possibilities in their computation. We slightly extend some well-known related results and establish their counterparts by using the dual game. Our main results imply, for example, that if...

It is well known that in three-person transferable-utility cooperative games the bargaining set {\cal M}i1 and the core coincide for any coalition structure, provided the latter solution is not empty. In contrast, five-person totally-balanced games are discussed in the literature in which 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...