Amir Hossein Abiri Sharif University of Technology
Approximation Algorithms
Spring 2019
John Nash - 1928-2015
Spring 2019
Approximation Algorithms
Spring 2019
Approximation Algorithms
Spring 2019
Weighted Congestion Game - No Pure Nash Equilibrium
Approximation Algorithms
Spring 2019
Approximation Algorithms
Spring 2019
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
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
Approximation Algorithms
Spring 2019
Approximation Algorithms
Spring 2019
Finally we have:
Approximation Algorithms
Spring 2019
Approximation Algorithms
Examples of usages:
- flapping in routers
Spring 2019
Approximation Algorithms