Akaki Mamageishvili Paolo Penna
Tighter Bounds on the Inefficiency Ratio of Stable Equilibria in Load Balancing Games
ETH Zurich
Tighter Bounds on the Inefficiency Ratio of Stable Equilibria in - - PowerPoint PPT Presentation
Tighter Bounds on the Inefficiency Ratio of Stable Equilibria in Load Balancing Games Akaki Mamageishvili Paolo Penna ETH Zurich Outline Load Balancing Games Inefficiency Ratio of Stable Equilibria Tighter Bounds for IRSE (Our
Akaki Mamageishvili Paolo Penna
ETH Zurich
Load Balancing Games Inefficiency Ratio of Stable Equilibria Tighter Bounds for IRSE (Our Contribution)
no improvement
OPT Nash Equilibrium
Price of Anarchy: Let the players choose some equilibrium by themselves. How bad this can be? Nash
Price of Anarchy: Let the players choose some equilibrium by themselves. How bad this can be? PoA = worst Nash
Opt
Nash
Price of Anarchy: Let the players choose some equilibrium by themselves. How bad this can be? PoA = worst Nash
Opt
PoS = best Nash
Opt
Nash
1 1 x x x x 1 1
1 1 x x x x 1 1 PoA =
2x 1+x → 4 3
1 1 x x x x 1 1 PoA =
2x 1+x → 4 3
PoA = 2
1 m+1
PoS = 1
PoA = worst Nash
Opt
PoS = best Nash
Opt
Nash
PoA = worst Nash
Opt
PoS = best Nash
Opt
Nash Stable
PoA = worst Nash
Opt
PoS = best Nash
Opt
Nash Stable noisy best response min potential
Noisy best response €10 €1 prob ∝ e10/noise prob ∝ e1/noise Strategies with higher payoff chosen with higher probability
PoA = worst Nash
Opt
PoS = best Nash
Opt
Nash Stable noisy best response min potential
PoA = worst Nash
Opt
PoS = best Nash
Opt
Nash Stable noisy best response min potential IRSE= worst Stable Nash
Opt (Asadpour, Saberi, 2009)
PoA = worst Nash
Opt
PoS = best Nash
Opt
Nash Stable noisy best response min potential IRSE= worst Stable Nash
Opt
L2-norm L∞-norm
(Asadpour, Saberi, 2009)
PoA = worst Nash
Opt
PoS = best Nash
Opt
Nash Minimize L2-norm ⇒ also good for L∞-norm (makespan)? Stable noisy best response min potential IRSE= worst Stable Nash
Opt (Asadpour, Saberi, 2009)
(Alon, Azar, Woeginger, Yadid, 1997)
mininimize L2-norm automatically 4/3-APX for L∞-norm
mininimize L2-norm sometimes at least 7/6-APX of L∞-norm
Previous bunds:
Alon - Azar - Woeginger - Yadid, SODA 1997 Asadpour - Saberi, WINE 2009 Previous bunds:
mininimize L2-norm sometimes at least 7/6-APX of L∞-norm
2
9 2
2 3 3 2
2
9 2
2 3 3 2 min potential
2
9 2
2 3 3 2 min potential
2
9 2
2 3 3 2 2
9 2
2 3 3 2 min potential
min potential 3
14 2
3 5 4 4 3
14 2
5 3 3 3 4 5 5 4
min potential 3
14 2
3 5 4 4 3
14 2
5 3 3 3 4 5 5 4
min potential 3
14 2
3 5 4 4 3
14 2
5 3 3 3 4 5 5 4
m − 1
min potential 3
14 2
3 5 4 4 3
14 2
5 3 3 3 4 5 5 4
3m − 3 m − 1
min potential 3
14 2
3 5 4 4 3
14 2
5 3 3 3 4 5 5 4
3m − 3 2m − 3 m − 1
min potential 3
14 2
3 5 4 4 3
14 2
5 3 3 3 4 5 5 4
3m − 3 2m − 3
5m−3 2
m − 1
min potential 3
14 2
3 5 4 4 3
14 2
5 3 3 3 4 5 5 4
3m − 3 2m − 3
5m−3 2 7m−4 2
mininimize L2-norm automatically 4/3-APX for L∞-norm
3
L1 ≥ L2 Lm ≥ ≥ · · · · · · α > 1/3 min potential
3
L1 ≥ L2 Lm ≥ ≥ · · · · · · α > 1/3 min potential smallest
3
L1 ≥ L2 Lm ≥ ≥ · · · · · · α > 1/3 min potential smallest
3
L1 ≥ L2 Lm ≥ ≥ · · · · · · α > 1/3 min potential smallest β > 2/3
3
L1 ≥ L2 Lm ≥ ≥ · · · · · · α > 1/3 min potential smallest β > 2/3 α > 1/3 α > 1/3 β > 2/3 OR IN EVERY MACHINE
3
L1 ≥ L2 Lm ≥ ≥ · · · · · · α > 1/3 min potential smallest β > 2/3 α > 1/3 α > 1/3 β > 2/3 · · · smallest · · ·
3
L1 ≥ L2 Lm ≥ ≥ · · · · · · α > 1/3 min potential smallest β > 2/3 α > 1/3 α > 1/3 β > 2/3 OR IN EVERY MACHINE
3
L1 ≥ L2 Lm ≥ ≥ · · · · · · α > 1/3 min potential smallest β > 2/3 x > x′ y > y ′
3
L1 ≥ L2 Lm ≥ ≥ · · · · · · α > 1/3 min potential smallest β > 2/3 x > x′ y > y ′ 3
PoA ≈ 2 PoS = 1 Nash Stable
PoA ≈ 2 PoS = 1 Nash Stable 4/3 7/6 IRSE
PoA ≈ 2 PoS = 1 Nash Stable 4/3 7/6 IRSE
Minimize L2-norm ⇒ also good for L∞-norm (makespan)?
PoA ≈ 2 PoS = 1 Nash Stable 4/3 7/6 IRSE
Global properties? 3