Abstract

Congestion games are an elegant model to study the effects of selfish usage of resources. In my thesis—of the same title as this note—we characterized the maximal conditions for which the existence of a pure Nash equilibrium can be guaranteed for four variants of congestion games: weighted congestion games, congestion games with resource-dependent demands, congestion games with vari- able demands, and bottleneck congestion games. This note reviews the main results obtained there.

Full Text
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