The Relationship Between Convex and Minimum Cost Spanning Tree Games: A Case for Permutationally Convex Games

Notwithstanding the apparent differences between convex games and minimum cost spanning tree (m.c.s.t.) games, we show that there is a close relationship between these two types of games. This close relationship is realized with the introduction of the group of permutationally convex (p.c.) games. It is shown that a p.c. game has a nonempty core and that both convex games and m.c.s.t, games are permutationally convex.