Average Convexity in Communication Situations

M. Slikker

Research output: Working paperDiscussion paperOther research output

214 Downloads (Pure)

Abstract

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.
Original languageEnglish
Place of PublicationTilburg
PublisherOperations research
Number of pages21
Volume1998-12
Publication statusPublished - 1998

Publication series

NameCentER Discussion Paper
Volume1998-12

Fingerprint Dive into the research topics of 'Average Convexity in Communication Situations'. Together they form a unique fingerprint.

  • Cite this

    Slikker, M. (1998). Average Convexity in Communication Situations. (CentER Discussion Paper; Vol. 1998-12). Operations research.