| Article ID: | iaor19942339 |
| Country: | Germany |
| Volume: | 39 |
| Start Page Number: | 243 |
| End Page Number: | 248 |
| Publication Date: | Sep 1994 |
| Journal: | Mathematical Methods of Operations Research (Heidelberg) |
| Authors: | Alidaee B. |
Granot and Hubermann showed that minimum cost spanning tree (MCST) games are permutationally convex (PC). Recently, Rosenthal gave an extension of MCST games to minimum cost spanning forest (MCSF) games and showed these games have nonempty cores. In this note it is shown that any MCSF game is a PC game.