Spanning network games, which are a generalization of minimum cost spa
nning tree games, were introduced by Granot and Maschler (1991), who s
howed that these games are always monotonic. In this paper a subclass
of spanning network games is introduced, namely simplex games, and it
is shown that every monotonic game is a simplex game. Hence, the class
of spanning network games coincides with the class of monotonic games
.