This thesis discusses three problems that arise from routing flow through networks that exhibit some interaction of flow on links. This interaction manifests itself in delay from congestion or benefit from sharing. We develop a polynomial-time algorithm for two undirected disjoint shortest paths. Further, we address the computation of dynamic equilibria under the fluid queuing model. For cost-sharing network games, we investigate the computational complexity of Nash equilibria and the price of stability.
«
This thesis discusses three problems that arise from routing flow through networks that exhibit some interaction of flow on links. This interaction manifests itself in delay from congestion or benefit from sharing. We develop a polynomial-time algorithm for two undirected disjoint shortest paths. Further, we address the computation of dynamic equilibria under the fluid queuing model. For cost-sharing network games, we investigate the computational complexity of Nash equilibria and the price of s...
»