Approximate Pure Nash Equilibria in Weighted Congestion Games: Existence, Efficient Computation, and Structure
ACM Trans. Economics and Comput., 2015.
latency functionalgorithmspotential gamessocial and behavioral sciencesunweighted congestion gameMore(17+)
We consider structural and algorithmic questions related to the Nash dynamics of weighted congestion games. In weighted congestion games with linear latency functions, the existence of pure Nash equilibria is guaranteed by a potential function argument. Unfortunately, this proof of existence is inefficient and computing pure Nash equilibr...More
PPT (Upload PPT)