Advertisement
Published in:
2009 | OriginalPaper | Chapter
Models of Non-atomic Congestion Games – From Unicast to Multicast Routing
Authors : Lasse Kliemann, Anand Srivastav
Published in: Algorithmics of Large and Complex Networks
Publisher: Springer Berlin Heidelberg
Activate our intelligent search to find suitable subject content or patents.
Select sections of text to find matching patents with Artificial Intelligence. powered by
Select sections of text to find additional relevant content using AI-assisted search. powered by
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.