Sciweavers

Share
DFG
2009
Springer

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

10 years 4 months ago
Models of Non-atomic Congestion Games - From Unicast to Multicast Routing
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.
Lasse Kliemann, Anand Srivastav
Added 26 May 2010
Updated 26 May 2010
Type Conference
Year 2009
Where DFG
Authors Lasse Kliemann, Anand Srivastav
Comments (0)
books