ON THE CORE OF INFORMATION GRAPH GAMES

This paper considers a subclass of minimum cost spanning tree games, c alled information graph games. It is proved that the core of these gam es can be described by a set of at most 2n - 1 linear constraints, whe re n is the number of players. Furthermore, it is proved that each inf ormation graph game has an associated concave. information graph game, which has the same core as the original game. Consequently, the set o f extreme core allocations of an information graph game is characteriz ed as the set of marginal allocation vectors of its associated concave game. Finally, it is proved that all extreme core allocations of an i nformation graph game are marginal allocation vectors of the game itse lf, though not all marginal allocation vectors need to be core allocat ions.