Approximate Pure Nash Equilibria in Weighted Congestion Games
Amir Hossein Abiri Sharif University of Technology
Outline
- Introduction to Game Theory
- Congestion Games
- Weighted Congestion Games
- Existence of Approximation for weighted congestion games
- Wrap up and questions
- References
Introduction to Game Theory
Approximation Algorithms
Spring 2019

John Nash - 1928-2015

Nash Equilibrium
Spring 2019

Approximation Algorithms
Congestion Games
Spring 2019


Approximation Algorithms
Weighted Congestion Games
Spring 2019

Weighted Congestion Game - No Pure Nash Equilibrium
Approximation Algorithms
Spring 2019

Contributions
Approximation Algorithms
Spring 2019
Existence of an Approximate Potential Function
Key Idea: Potential Function
Approximation Algorithms
An α-approximate potential is a map from the space of all strategy profiles to the real numbers that has the property that it decreases if a player decreases his cost by a factor greater than α
Spring 2019
Existence of an Approximate Potential Function

We are interested in permutations of the vector v that minimize or maximize the value of the discrete integral among all permutations of the vector.
Definition 2 - \( \hat{\sigma}_f(v) \) : The permutation that minimizes discrete integral
Definition 3 - \( \breve{\sigma}_f(v) \) : The permutation that maximizes discrete integral
Definition 4 - \( \hat{\sigma}^i_f(v) \) : The permutation that minimizes discrete integral by moving \(v_i\) to the end of vector
Definition 5 - \( \breve{\sigma}^i_f(v) \) : The permutation that maximizes discrete integral by moving \(v_i\) to the end of vector
Approximation Algorithms
Spring 2019
Existence of an Approximate Potential Function

Approximation Algorithms
Spring 2019
Existence of an Approximate Potential Function

Approximation Algorithms
Spring 2019
Existence of an Approximate Potential Function




Finally we have:
Approximation Algorithms
Spring 2019
Wrapping Up
Approximation Algorithms

Examples of usages:
- flapping in routers
References
- Hansknecht, Christoph, Max Klimm, and Alexander Skopalik. "Approximate pure Nash equilibria in weighted congestion games." Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2014). Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik, 2014.
- Rosenthal, Robert W. "A class of games possessing pure-strategy Nash equilibria." International Journal of Game Theory 2.1 (1973): 65-67.
Spring 2019
Approximation Algorithms
Approximate Pure Nash Equilibria
By Amir Hossein Abiri
Approximate Pure Nash Equilibria
Approximation Algorithms, Spring 2019
- 373