Abstract
A congestion game represents a routing game on a graph in which players choose an appropriate route, striving to avoid “bottlenecks” that hamper traffic flows. Theory of potential games is a good tool to find equilibria in such systems. Therefore, first we dwell on the methods of potential games and then pass to an analysis of congestion games. We prove the existence of the equilibrium in pure strategies in symmetric congestion games, player specific congestion games and congestion games with constraint for strategy set.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Paper version not known
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
