This file is part of IDEAS, which uses RePEc data


[ Papers | Articles | Software | Books | Chapters | Authors | Institutions | JEL Classification | NEP reports | Search | New papers by email | Author registration | Rankings | Volunteers | FAQ | Blog | Help! ]

Convex congestion network problems

Author info | Abstract | Publisher info | Download info | Related research | Statistics
Author Info
Quant, M.
Reijnierse, J.H. (Tilburg University, Center for Economic Research)

Additional information is available for the following registered author(s):

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.

Download Info
To download:

If you experience problems downloading a file, check if you have the proper application to view it first. Information about this may be contained in the File-Format links below. 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.

File URL: http://arno.uvt.nl/show.cgi?fid=10570
File Format: application/pdf
File Function:
Download Restriction: no

Publisher Info
Paper provided by Tilburg University, Center for Economic Research in its series Discussion Paper with number 59.

Download reference. The following formats are available: HTML (with abstract), plain text (with abstract), BibTeX, RIS (EndNote, RefMan, ProCite), ReDIF
Length:
Date of creation: 2004
Date of revision:
Handle: RePEc:dgr:kubcen:200459

Contact details of provider:
Web page: http://center.uvt.nl

For technical questions regarding this item, or to correct its listing, contact: (Corry Stuyts).

Related research
Keywords:

Find related papers by JEL classification:
C63 - Mathematical and Quantitative Methods - - Mathematical Methods and Programming - - - Computational Techniques
C71 - Mathematical and Quantitative Methods - - Game Theory and Bargaining Theory - - - Cooperative Games

This paper has been announced in the following NEP Reports:

References listed on IDEAS
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.:
  1. Borm, P. & Hamers, H. & Hendrickx,, 2001. "Operations research games : a survey," Discussion Paper 45, Tilburg University, Center for Economic Research. [Downloadable!]
    Other versions:
Full references

Cited by:
(explanations, 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.)

  1. Kleppe, J. & Reijnierse, J.H., 2007. "Public Congestion Network Situations, and Related Games," Discussion Paper 2007-58, Tilburg University, Center for Economic Research. [Downloadable!]
Statistics
Access and download statistics

Did you know? IDEAS uses the data collected within the RePEc project, the largest online bibliographic database in Economics.

This page was last updated on 2009-11-25.

This information is provided to you by IDEAS at the Department of Economics, College of Liberal Arts and Sciences, University of Connecticut using RePEc data on a server sponsored by the Society for Economic Dynamics.