Average Convexity in Communication Situations

M. Slikker

Research output: Working paperDiscussion paperOther research output

206 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

Convexity
Convex Games
Potential Games
Star Graph
Graph in graph theory
Complete Graph
Subgraph
Game
If and only if
Communication

Cite this

Slikker, M. (1998). Average Convexity in Communication Situations. (CentER Discussion Paper; Vol. 1998-12). Tilburg: Operations research.
Slikker, M. / Average Convexity in Communication Situations. Tilburg : Operations research, 1998. (CentER Discussion Paper).
@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",

}

Slikker, M 1998 'Average Convexity in Communication Situations' CentER Discussion Paper, vol. 1998-12, Operations research, Tilburg.

Average Convexity in Communication Situations. / Slikker, M.

Tilburg : Operations research, 1998. (CentER Discussion Paper; Vol. 1998-12).

Research output: Working paperDiscussion paperOther research output

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 -

Slikker M. Average Convexity in Communication Situations. Tilburg: Operations research. 1998. (CentER Discussion Paper).