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

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