Models of Non-atomic Congestion Games --- From Unicast to Multicast Routing

Authors:
Lasse Kliemann;Anand Srivastav
Affiliations:
Institut für Informatik, Christian-Albrechts-Universität Kiel, Kiel, 24118;Institut für Informatik, Christian-Albrechts-Universität Kiel, Kiel, 24118
Venue:
Algorithmics of Large and Complex Networks
Year:
2009

Citing 12
Cited 0

Achieving network optima using Stackelberg routing strategies

IEEE/ACM Transactions on Networking (TON)
Lancelot: A FORTRAN Package for Large-Scale Nonlinear Optimization (Release A)

Lancelot: A FORTRAN Package for Large-Scale Nonlinear Optimization (Release A)
Selfish routing

Selfish routing
Convex Optimization

Convex Optimization
Tolls for Heterogeneous Selfish Users in Multicommodity Networks and Generalized Congestion Games

FOCS '04 Proceedings of the 45th Annual IEEE Symposium on Foundations of Computer Science
Selfish Routing in Capacitated Networks

Mathematics of Operations Research
On the implementation of an interior-point filter line-search algorithm for large-scale nonlinear programming

Mathematical Programming: Series A and B
Fast convergence to Wardrop equilibria by adaptive sampling methods

Proceedings of the thirty-eighth annual ACM symposium on Theory of computing
On a Paradox of Traffic Planning

Transportation Science
Convergence to approximate Nash equilibria in congestion games

SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
The price of anarchy in selfish multicast routing

CAAN'06 Proceedings of the Third international conference on Combinatorial and Algorithmic Aspects of Networking
Approximating wardrop equilibria with finitely many agents

DISC'07 Proceedings of the 21st international conference on Distributed Computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

We give an overview of important results for non-atomic congestion games in their traditional form along with self-contained and short proofs and then present new results and challenges for an extended model, which we call consumption-relevance congestion games . We introduce the consumption-relevance congestion game first and show that all other models are special cases of it. Our focus is on the price of anarchy, computation of equilibria, and experimental studies. Further interesting aspects are summarized at the end of this article.