Download This PaperConvex Congestion Network Problems
CentER Discussion Paper No. 2004-59
18 Pages Posted: 3 Sep 2004
Date Written: July 2004
Abstract
This paper analyzes convex congestion network problems. It is shown that for network problems with convex congestion costs, an algorithm based on a shortest path algorithm, can be used to find an optimal network for any coalition. Furthermore, an easy way of determining if a given network is optimal is provided.
Keywords: Game theory, cooperative games, algorithm
JEL Classification: C63, C71
Suggested Citation: Suggested Citation
Quant, Marieke and Reijnierse, Hans, Convex Congestion Network Problems (July 2004). CentER Discussion Paper No. 2004-59, Available at SSRN: https://ssrn.com/abstract=585102 or http://dx.doi.org/10.2139/ssrn.585102
Do you have negative results from your research you’d like to share?
Recommended Papers
Feedback
Feedback to SSRN
If you need immediate assistance, call 877-SSRNHelp (877 777 6435) in the United States, or +1 212 448 2500 outside of the United States, 8:30AM to 6:00PM U.S. Eastern, Monday - Friday.