1 / 36

Local Connection Game

Local Connection Game. Introduction. Introduced in [FLMPS,PODC’03] A LCG is a game that models the creation of networks two competing issues: players want to minimize the cost they incur in building the network to ensure that the network provides them with a high quality of service

mattsons
Download Presentation

Local Connection Game

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. Local Connection Game

  2. Introduction • Introduced in [FLMPS,PODC’03] • A LCG is a game that models the creation of networks • two competing issues: players want • to minimize the cost they incur in building the network • to ensure that the network provides them with a high quality of service • Players are nodes that: • pay for the links • benefit from short paths [FLMPS,PODC’03]: A. Fabrikant, A. Luthra, E. Maneva, C.H. Papadimitriou, S. Shenker, On a network creation game, PODC’03

  3. The model • n players: nodes in a graph to be built • Strategy for player u: a set of undirected edges that u will build (all incident to u) • Given a strategy vector S, the constructed network will be G(S) • there is the undirected edge (u,v) if it is bought by u or v (or both) • player u’s goal: • to make the distance to other nodes small • to pay as little as possible

  4. The model • Each edge costs  • distG(S)(u,v): length of a shortest path (in terms of number of edges) between u and v • Player u aims to minimize its cost: • nu: number of edges bought by node u costu(S) = nu + v distG(S)(u,v)

  5. Remind • We use Nash equilibrium (NE) as the solution concept • To evaluate the overall quality of a network, we consider the social cost, i.e. the sum of all players’ costs • a network is optimal or socially efficient if it minimizes the social cost • A graph G=(V,E) is stable (for a value ) if there exists a strategy vector S such that: • S is a NE • S forms G

  6. 2 1 -1 3 -3 4 2 1 cu=2+9 Example u +  cu=+13 (Convention: arrow from the node buying the link)

  7. +2 -2 -1 -5 +2 -1 -1 +5 +5 +5 -5 -5 +4 +1 -1 -5 +1 Example • Set =5, and consider: That’s a stable network!

  8. Some simple observations • In SC(S) each term distG(S)(u,v) contributes to the overall quality twice • In a stable network each edge (u,v) is bough at most by one player • Any stable network must be connected • Since the distance dist(u,v) is infinite whenever u and v are not connected Social cost of a (stable) network G(S)=(V,E): SC(S)=|E| + u,vdistG(S)(u,v)

  9. Our goal • to bound the efficiency loss resulting from stability • In particular: • To bound the Price of Stability (PoS) • To bound the Price of Anarchy (PoA)

  10. How does an optimal network look like?

  11. Some notation Kn:completegraph with n nodes A star is a tree with height at most 1 (when rooted at its center)

  12. Lemma Il ≤2 then the complete graph is an optimal solution, while if ≥2 then any star is an optimal solution. proof Let G=(V,E) be an optimal solution; |E|=m and SC(G)=OPT OPT≥ m + 2m + 2(n(n-1) -2m) =(-2)m + 2n(n-1) LB(m) Notice: LB(m) is equal to SC(Kn) when m=n(n-1)/2 and to SC of any star when m=n-1

  13. proof G=(V,E): optimal solution; |E|=m and SC(G)=OPT LB(m)=(-2)m + 2n(n-1) LB(n-1) = SC of any star ≥ 2 min m OPT≥ min LB(m) ≥ m ≤ 2 max m LB(n(n-1)/2) = SC(Kn)

  14. Are the complete graph and stars stable?

  15. c Lemma If ≤1 the complete graph is stable, while if ≥1 then any star is stable. proof ≤1 a node v cannot improve by saving k edges ≥1 c has no interest to deviate v buys k more edges… …pays k more… …saves (w.r.t distances) k… v

  16. Theorem For ≤1 and ≥2 the PoS is 1. For 1<<2 the PoS is at most 4/3 proof ≤1 and ≥2 …trivial! …Kn is an optimal solution, any star T is stable… 1<<2 maximized when   1 -1(n-1) + 2n(n-1) (-2)(n-1) + 2n(n-1) SC(T) PoS ≤ = ≤ n(n-1)/2 + n(n-1)  n(n-1)/2 + n(n-1) SC(Kn) 2n - 1 4n -2 = = < 4/3 (3/2)n 3n

  17. What about price of Anarchy? …for <1 the complete graph is the only stable network, (try to prove that formally) hence PoA=1… …for larger value of ?

  18. Some more notation The diameter of a graph G is the maximum distance between any two nodes diam=1 diam=2 diam=4

  19. Some more notation An edge e is a cut edge of a graph G=(V,E) if G-e is disconnected G-e=(V,E\{e}) A simple property: Any graph has at most n-1 cut edges

  20. Theorem The PoA is at most O( ). proof It follows from the following lemmas: Lemma 1 The diameter of any stable network is at most 2 +1 . Lemma 2 The SC of any stable network with diameter d is at most O(d) times the optimum SC.

  21. ● ● ● proof of Lemma 1 G: stable network Consider a shortest path in G between two nodes u and v u v k vertices reduce their distance from u 2k≤ distG(u,v) ≤ 2k+1 for some k from ≥2k to 1  ≥ 2k-1 from ≥2k-1 to 2  ≥ 2k-3 …since G is stable: from ≥ k+1 to k  ≥ 1 ≥k2 k ≤  k-1 (2i+1)=k2 i=0 distG(u,v) ≤ 2  + 1

  22. Lemma 2 The SC of any stable network G=(V,E) with diameter d is at most O(d) times the optimum SC. idea of the proof (we’ll formally prove it later) OPT ≥  (n-1) OPT ≥  (n-1) + n(n-1) OPT = (n2) SC(G)= u,vdG(u,v) +  |E| ≤OPT O(d) OPT =u,vdG(u,v) + |Ecut| + |Enon-cut| =O(d) OPT ≤(n-1) O(d n2) = O(d) OPT that’s the tricky bound O(n2d/)

  23. Proposition 1 Let G be a network with diameter d, and let e=(u,v) be a non-cut edge. Then in G-e, every node w increases its distance from u by at most 2d proof BFS tree from u u e v w

  24. Proposition 1 Let G be a network with diameter d, and let e=(u,v) be a non-cut edge. Then in G-e, every node w increases its distance from u by at most 2d proof BFS tree from u u (x,y): any edge crossing the cut induced by the removal of e e v x y w

  25. Proposition 1 Let G be a network with diameter d, and let e=(u,v) be a non-cut edge. Then in G-e, every node w increases its distance from u by at most 2d proof BFS tree from u u (x,y): any edge crossing the cut induced by the removal of e e v x y w dG-e(u,w)  dG (u,x) + 1 + dG(y,v)+ dG(v,w)  dG(u,w) +2d  d  d = dG(u,w)-1

  26. Proposition 2 Let G be a stable network, and let F be the set of Non-cut edges paid for by a node u. Then |F|≤(n-1)2d/ proof (part of the) BFS tree from u k=|F| u if u removes (u,vi) saves  and its distance cost increses by at most 2d ni (Prop. 1) vi v1 ... ... vk ni nk n1 nodes nodes nodes since G is stable:   2d ni by summing up for all i  2d (n-1) k  (n-1) 2d/ k ni k  2d i=1

  27. Lemma 2 The SC of any stable network G=(V,E) with diameter d is at most O(d) times the optimum SC. proof OPT ≥  (n-1) + n(n-1) SC(G)= u,vdG(u,v) +  |E| ≤d OPT+2d OPT= 3d OPT ≤dn(n-1) ≤d OPT ≤(n-1)+n(n-1)2d ≤ 2d OPT |E|=|Ecut| + |Enon-cut| ≤(n-1) ≤n(n-1)2d/ Prop. 2

  28. Theorem It is NP-hard, given the strategies of the other agents, to compute the best response of a given player. proof Reduction from dominating set problem

  29. Dominating Set (DS) problem • Input: • a graph G=(V,E) • Solution: • UV, such that for every vV-U, there is uU with (u,v)E • Measure: • Cardinality of U

  30. the reduction 1<<2 player i = G(S-i) G=(V,E) Player i has a strategy yielding a cost  k+2n-k if and only if there is a DS of size  k

  31. the reduction 1<<2 player i = G(S-i) G=(V,E) ( ) easy: given a dominating set U of size k, player i buys edges incident to the nodes in U Cost for i is k+2(n-k)+k =k+2n-k

  32. 1<<2 the reduction x player i = G(S-i) G=(V,E) ( ) Let Si be a strategy giving a cost  k+2n-k Modify Si as follows: repeat: if there is a node v with distance ≥3 from x in G(S), then add edge (x,v) to Si (this decreases the cost)

  33. 1<<2 the reduction x player i = G(S-i) G=(V,E) ( ) Let Si be a strategy giving a cost  k+2n-k Modify Si as follows: repeat: if there is a node v with distance ≥3 from x in G(S), then add edge (x,v) to Si (this decreases the cost) Finally, every node has distance either 1 or 2 from x

  34. 1<<2 the reduction x player i = G(S-i) G=(V,E) ( ) Let Si be a strategy giving a cost  k+2n-k Modify Si as follows: repeat: if there is a node v with distance ≥3 from x in G(S), then add edge (x,v) to Si (this decreases the cost) Finally, every node has distance either 1 or 2 from x Let U be the set of nodes at distance 1 from x…

  35. 1<<2 the reduction x player i = G(S-i) G=(V,E) ( ) …U is a dominating set of the original graph G We have costi(S)= |U|+2n-|U|  k+2n-k |U|  k

  36. PoA as function of : state of the art NEs are trees  O(1) [Bilò et al,18] NEs are trees  O(1) [Alvarez et al,17] NEs are trees  O(1) [Mamageishvili et al,15] NEs are trees  O(1) [Mihalak et al,10] O(1) [Demaine et al,07] NEs are trees  O(1) [Alberts et al,06]  12n logn 4 n 17 n 45 n 273 n n3/2 O(n) O(n1-) O(n1/3) o(n) O() [FLMPS,03] [Alberts et al,06] [Demaine et al,07] O(1) O(1) [Lin,03]: [Lin,03]: [Bilò et al,18]: D. Bilò, P. Lezner, On the Tree Conjecture for the Network Creation Game, STACS’18

More Related