Congestion network problems and related games

Congestion network problems and related games

0.00 Avg rating0 Votes
Article ID: iaor20084094
Country: Netherlands
Volume: 172
Issue: 3
Start Page Number: 919
End Page Number: 930
Publication Date: Aug 2006
Journal: European Journal of Operational Research
Authors: , ,
Keywords: game theory
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.

Reviews

Required fields are marked *. Your email address will not be published.