Convex Congestion Network Problems
AbstractThis 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.
Download InfoIf you experience problems downloading a file, check if you have the proper application to view it first. In case of further problems read the IDEAS help page. Note that these files are not on the IDEAS site. Please be patient as the files may be large.
Bibliographic InfoPaper provided by Tilburg University, Center for Economic Research in its series Discussion Paper with number 2004-59.
Date of creation: 2004
Date of revision:
Contact details of provider:
Web page: http://center.uvt.nl
game theory; cooperative games; algorithm;
This paper has been announced in the following NEP Reports:
Please report citation or reference errors to , or , if you are the registered author of the cited work, log in to your RePEc Author Service profile, click on "citations" and make appropriate adjustments.:
- Borm, P.E.M. & Hamers, H.J.M. & Hendrickx, R.L.P., 2001.
"Operations research games: A survey,"
Open Access publications from Tilburg University
urn:nbn:nl:ui:12-305110, Tilburg University.
- Peter Borm & Herbert Hamers & Ruud Hendrickx, 2001. "Operations research games: A survey," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer, vol. 9(2), pages 139-199, December.
- Kleppe, J. & Reijnierse, J.H., 2007. "Public Congestion Network Situations, and Related Games," Discussion Paper 2007-58, Tilburg University, Center for Economic Research.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Richard Broekman).
If references are entirely missing, you can add them using this form.