Average Convexity in Communication Situations

M. Slikker

Average Convexity in Communication Situations

M. Slikker

Research Group: Operations Research

Research output: Working paper › Discussion paper › Other research output

211 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 language	English
Place of Publication	Tilburg
Publisher	Operations research
Number of pages	21
Volume	1998-12
Publication status	Published - 1998

Publication series

Name	CentER Discussion Paper
Volume	1998-12

Access to Document

12

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

Cite this

@techreport{612b0000a66a435aa70729af0807bb3d,

title = "Average Convexity in Communication Situations",

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.",

author = "M. Slikker",

note = "Pagination: 21",

year = "1998",

language = "English",

volume = "1998-12",

series = "CentER Discussion Paper",

publisher = "Operations research",

type = "WorkingPaper",

institution = "Operations research",

}

TY - UNPB

T1 - Average Convexity in Communication Situations

AU - Slikker, M.

N1 - Pagination: 21

PY - 1998

Y1 - 1998

N2 - 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.

AB - 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.

M3 - Discussion paper

VL - 1998-12

T3 - CentER Discussion Paper

BT - Average Convexity in Communication Situations

PB - Operations research

CY - Tilburg

ER -