@techreport{4de27e1fabe040c183692bb5e6195fe7,

title = "Convex Congestion Network Problems",

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",

author = "M. Quant and J.H. Reijnierse",

note = "Pagination: 18",

year = "2004",

language = "English",

volume = "2004-59",

series = "CentER Discussion Paper",

publisher = "Operations research",

type = "WorkingPaper",

institution = "Operations research",

}