Asymmetric Swap-Equilibrium: A Unifying Equilibrium Concept for Network Creation Games

  • Matúš Mihalák
  • Jan Christoph Schlegel
Part of the Lecture Notes in Computer Science book series (LNCS, volume 7464)

Abstract

We introduce and study the concept of an asymmetric swap-equilibrium for network creation games. A graph where every edge is owned by one of its endpoints is called to be in asymmetric swap-equilibrium, if no vertex v can delete its own edge {v,w} and add a new edge {v,w′} and thereby decrease the sum of distances from v to all other vertices. This equilibrium concept generalizes and unifies some of the previous equilibrium concepts for network creation games. While the structure and the quality of equilibrium networks is still not fully understood, we provide further (partial) insights for this open problem. As the two main results, we show that (1) every asymmetric swap-equilibrium has at most one (non-trivial) 2-edge-connected component, and (2) we show a logarithmic upper bound on the diameter of an asymmetric swap-equilibrium for the case that the minimum degree of the unique 2-edge-connected component is at least n ε , for \(\varepsilon>\frac{4\lg 3}{\lg n}\). Due to the generalizing property of asymmetric swap equilibria, these results hold for several equilibrium concepts that were previously studied. Along the way, we introduce a node-weighted version of the network creation games, which is of independent interest for further studies of network creation games.

Keywords

Nash Equilibrium Minimum Degree Usage Cost Equilibrium Concept Adjacent Edge 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Albers, S., Eilts, S., Even-Dar, E., Mansour, Y., Roditty, L.: On Nash equilibria for a network creation game. In: Proceedings of the Seventeenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA, pp. 89–98 (2006)Google Scholar
  2. 2.
    Alon, N., Demaine, E.D., Hajiaghayi, M., Leighton, T.: Basic network creation games. In: Proceedings of the 22nd ACM Symposium on Parallelism in Algorithms and Architectures, SPAA, pp. 106–113 (2010)Google Scholar
  3. 3.
    Demaine, E.D., Hajiaghayi, M., Mahini, H., Zadimoghaddam, M.: The price of anarchy in network creation games. In: Proceedings of the Twenty-Sixth Annual ACM Symposium on Principles of Distributed Computing, PODC, pp. 292–298 (2007)Google Scholar
  4. 4.
    Ehsani, S., Fazli, M., Mehrabian, A., Sadeghian Sadeghabad, S., Safari, M., Saghafian, M., ShokatFadaee, S.: On a bounded budget network creation game. In: Proceedings of the 23rd ACM Symposium on Parallelism in Algorithms and Architectures, SPAA, pp. 207–214 (2011)Google Scholar
  5. 5.
    Fabrikant, A., Luthra, A., Maneva, E., Papadimitriou, C.H., Shenker, S.: On a network creation game. In: Proceedings of the Twenty-Second Annual Symposium on Principles of Distributed Computing, PODC, pp. 347–351 (2003)Google Scholar
  6. 6.
    Lenzner, P.: On Dynamics in Basic Network Creation Games. In: Persiano, G. (ed.) SAGT 2011. LNCS, vol. 6982, pp. 254–265. Springer, Heidelberg (2011)CrossRefGoogle Scholar
  7. 7.
    Mihalák, M., Schlegel, J.C.: The Price of Anarchy in Network Creation Games Is (Mostly) Constant. In: Kontogiannis, S., Koutsoupias, E., Spirakis, P.G. (eds.) SAGT 2010. LNCS, vol. 6386, pp. 276–287. Springer, Heidelberg (2010)CrossRefGoogle Scholar
  8. 8.
    Mihalák, M., Schlegel, J.C.: Asymmetric swap-equilibrium: A unifying equilibrium concept for network creation games. Tech. Rep. 764, Department of Computer Science, ETH Zurich (June 2012), https://www1.ethz.ch/inf/research/disstechreps/techreports

Copyright information

© Springer-Verlag Berlin Heidelberg 2012

Authors and Affiliations

  • Matúš Mihalák
    • 1
  • Jan Christoph Schlegel
    • 1
  1. 1.Institute of Theoretical Computer ScienceETH ZurichSwitzerland

Personalised recommendations