Convex Congestion Network Problems

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.

MoreLess

Year of publication:	2004
Authors:	Quant, Marieke ; Reijnierse, Hans
Institutions:	Tilburg University, Center for Economic Research
Subject:	game theory \| cooperative games \| algorithm

freely available

Full text |

More access options

Check Google Scholar

In German libraries (KVK)

I need help

More details

Extent:	application/pdf
Series:	Discussion Paper.
Type of publication:	Book / Working Paper
Notes:	The text is part of a series CentER Discussion Paper Number 2004-59
Source:	RePEc - Research Papers in Economics

Persistent link: https://www.econbiz.de/10011092611