Congestion network problems and related games

@article{Quant2006CongestionNP,
  title={Congestion network problems and related games},
  author={Marieke Quant and Peter Borm and Hans Reijnierse},
  journal={European Journal of Operational Research},
  year={2006},
  volume={172},
  pages={919-930}
}
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… CONTINUE READING

From This Paper

Figures, tables, and topics from this paper.

Citations

Publications citing this paper.
Showing 1-10 of 11 extracted citations

References

Publications referenced by this paper.
Showing 1-10 of 19 references

Potential games and interactive decisions with multiple criteria

M. 156–171. Voorneveld
Ph.D. thesis, • 1999
View 1 Excerpt

Potential games

D. Monderer, L. S. Shapley
Games and Economic Behavior • 1996
View 1 Excerpt

Potential games. Games and Economic Behavior 14, 111–124

D. Monderer, L. S. Shapley
European Journal of Operations Research • 1996
View 1 Excerpt

Traffic - based cost allocation in a network

D. Henriet, H. Moulin
The Rand Journal of Economics • 1996
View 1 Excerpt

On the irreducible core and the equal remaining obligations rule of minimum cost spanning extension problems

V. Feltkamp, S. Tijs, S. Muto
1994
View 1 Excerpt

Similar Papers

Loading similar papers…