Advanced Search
MyIDEAS: Login

Congestion network problems and related games

Contents:

Author Info

  • Quant, M.

    (Tilburg University)

  • Borm, P.E.M.

    (Tilburg University)

  • Reijnierse, J.H.

    (Tilburg University)

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.

(This abstract was borrowed from another version of this item.)

Download Info

If 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.
File URL: http://arno.uvt.nl/show.cgi?fid=95498
Our checks indicate that this address may not be valid because: 404 Not Found. If this is indeed the case, please notify (Economists Online Support)
Download Restriction: no

Bibliographic Info

Paper provided by Tilburg University in its series Open Access publications from Tilburg University with number urn:nbn:nl:ui:12-175063.

as in new window
Length:
Date of creation: 2006
Date of revision:
Publication status: Published in European Journal of Operational Research (2006) v.172, p.919-930
Handle: RePEc:ner:tilbur:urn:nbn:nl:ui:12-175063

Contact details of provider:
Web page: http://www.tilburguniversity.edu/

Related research

Keywords:

Other versions of this item:

Find related papers by JEL classification:

References

No references listed on IDEAS
You can help add them by filling out this form.

Citations

Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
as in new window

Cited by:
  1. Kleppe, J. & Reijnierse, J.H., 2007. "Public Congestion Network Situations, and Related Games," Discussion Paper 2007-58, Tilburg University, Center for Economic Research.
  2. Bergantiños, G. & Gómez-Rúa, M. & Llorca, N. & Pulido, M. & Sánchez-Soriano, J., 2014. "A new rule for source connection problems," European Journal of Operational Research, Elsevier, vol. 234(3), pages 780-788.
  3. Trudeau, Christian, 2009. "Network flow problems and permutationally concave games," Mathematical Social Sciences, Elsevier, vol. 58(1), pages 121-131, July.

Lists

This item is not listed on Wikipedia, on a reading list or among the top items on IDEAS.

Statistics

Access and download statistics

Corrections

When requesting a correction, please mention this item's handle: RePEc:ner:tilbur:urn:nbn:nl:ui:12-175063. See general information about how to correct material in RePEc.

For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Economists Online Support).

If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

If references are entirely missing, you can add them using this form.

If the full references list an item that is present in RePEc, but the system did not link to it, you can help with this form.

If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your profile, as there may be some citations waiting for confirmation.

Please note that corrections may take a couple of weeks to filter through the various RePEc services.