Congestion Network Problems and Related Games

M. Quant, P.E.M. Borm, J.H. Reijnierse

Research output: Working paperDiscussion paperOther research output

217 Downloads (Pure)

Abstract

This paper analyzes network problems with congestion effects from a cooperative game theoretic perspective.It is shown that for network problems with convex congestion costs, the corresponding games have a non-empty core.If congestion costs are concave, then the corresponding game has not necessarily core elements, but it is derived that, contrary to the convex congestion situation, there always exist optimal tree networks.Extensions of these results to a class of relaxed network problems and associated games are derived.
Original languageEnglish
Place of PublicationTilburg
PublisherOperations research
Number of pages18
Volume2003-106
Publication statusPublished - 2003

Publication series

NameCentER Discussion Paper
Volume2003-106

Fingerprint

Costs

Keywords

  • cooperative games
  • network
  • congestion
  • core

Cite this

Quant, M., Borm, P. E. M., & Reijnierse, J. H. (2003). Congestion Network Problems and Related Games. (CentER Discussion Paper; Vol. 2003-106). Tilburg: Operations research.
Quant, M. ; Borm, P.E.M. ; Reijnierse, J.H. / Congestion Network Problems and Related Games. Tilburg : Operations research, 2003. (CentER Discussion Paper).
@techreport{1a0fb713694942cb96f1408689618895,
title = "Congestion Network Problems and Related Games",
abstract = "This paper analyzes network problems with congestion effects from a cooperative game theoretic perspective.It is shown that for network problems with convex congestion costs, the corresponding games have a non-empty core.If congestion costs are concave, then the corresponding game has not necessarily core elements, but it is derived that, contrary to the convex congestion situation, there always exist optimal tree networks.Extensions of these results to a class of relaxed network problems and associated games are derived.",
keywords = "cooperative games, network, congestion, core",
author = "M. Quant and P.E.M. Borm and J.H. Reijnierse",
note = "Pagination: 18",
year = "2003",
language = "English",
volume = "2003-106",
series = "CentER Discussion Paper",
publisher = "Operations research",
type = "WorkingPaper",
institution = "Operations research",

}

Quant, M, Borm, PEM & Reijnierse, JH 2003 'Congestion Network Problems and Related Games' CentER Discussion Paper, vol. 2003-106, Operations research, Tilburg.

Congestion Network Problems and Related Games. / Quant, M.; Borm, P.E.M.; Reijnierse, J.H.

Tilburg : Operations research, 2003. (CentER Discussion Paper; Vol. 2003-106).

Research output: Working paperDiscussion paperOther research output

TY - UNPB

T1 - Congestion Network Problems and Related Games

AU - Quant, M.

AU - Borm, P.E.M.

AU - Reijnierse, J.H.

N1 - Pagination: 18

PY - 2003

Y1 - 2003

N2 - This paper analyzes network problems with congestion effects from a cooperative game theoretic perspective.It is shown that for network problems with convex congestion costs, the corresponding games have a non-empty core.If congestion costs are concave, then the corresponding game has not necessarily core elements, but it is derived that, contrary to the convex congestion situation, there always exist optimal tree networks.Extensions of these results to a class of relaxed network problems and associated games are derived.

AB - This paper analyzes network problems with congestion effects from a cooperative game theoretic perspective.It is shown that for network problems with convex congestion costs, the corresponding games have a non-empty core.If congestion costs are concave, then the corresponding game has not necessarily core elements, but it is derived that, contrary to the convex congestion situation, there always exist optimal tree networks.Extensions of these results to a class of relaxed network problems and associated games are derived.

KW - cooperative games

KW - network

KW - congestion

KW - core

M3 - Discussion paper

VL - 2003-106

T3 - CentER Discussion Paper

BT - Congestion Network Problems and Related Games

PB - Operations research

CY - Tilburg

ER -

Quant M, Borm PEM, Reijnierse JH. Congestion Network Problems and Related Games. Tilburg: Operations research. 2003. (CentER Discussion Paper).