In this paper we study inheritance properties of average convexity in communication situations. We show that the underlying graph ensures that the graphrestricted game originating from an average convex game is average convex if and only if every subgraph associated with a component of the underlying graph is the complete graph or a star graph. Furthermore, we study inheritance of (average) convexity of the associated potential games.
|Place of Publication||Tilburg|
|Number of pages||21|
|Publication status||Published - 1998|
|Name||CentER Discussion Paper|