Skip to main content
SpringerLink
Log in

Non-Cooperative Tree Creation

  • Published:
Algorithmica Aims and scope Submit manuscript

Abstract

In this paper we consider the connection game, a simple network design game with independent selfish agents that was introduced by Anshelevich et al. (Proc. 35th Ann. ACM Symp. Theo. Comp. (STOC), pp. 511–520, 2003). Our study concerns an important subclass of tree games, in which every feasible network is guaranteed to be connected. It generalizes the class of single-source games considered by Anshelevich et al. We focus on the existence, quality, and computability of pure-strategy exact and approximate Nash equilibria.

For tree connection games, in which every player holds two terminals, we show that there is a Nash equilibrium as cheap as the optimum network. In contrast, for single-source games, in which every player has at most three terminals, the price of stability is at least k−2, and it is \(\mathsf{NP}\) -complete to decide the existence of a Nash equilibrium. Hence, we propose polynomial time algorithms for computing approximate Nash equilibria, which provide relaxed stability and cost efficiency guarantees. For the case of two terminals per player, there is an algorithm to find a (2+ε,1.55)-approximate Nash equilibrium. It can be generalized to an algorithm to find a (3.1+ε,1.55)-approximate Nash equilibrium for general tree connection games. This improves the guarantee of the only previous algorithm for the problem, which returns a (4.65+ε,1.55)-approximate Nash equilibrium. Tightness results for the analysis of all algorithms are derived. Our algorithms use a novel iteration technique for trees that might be of independent interest.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Agrawal, A., Klein, P., Ravi, R.: When trees collide: an approximation algorithm for the generalized Steiner problem on networks. SIAM J. Comput. 24(3), 445–456 (1995)

    Article  MathSciNet  Google Scholar 

  2. Albers, S., Eilts, S., Even-Dar, E., Mansour, Y., Roditty, L.: On Nash equilibria for a network creation game. In: Proc. 17th Ann. ACM-SIAM Symp. Discrete Algorithms (SODA), pp. 89–98 (2006)

  3. Anshelevich, E., Dasgupta, A., Tardos, É., Wexler, T.: Near-optimal network design with selfish agents. In: Proc. 35th Ann. ACM Symp. Theo. Comp. (STOC), pp. 511–520 (2003)

  4. Anshelevich, E., Dasgupta, A., Kleinberg, J., Roughgarden, T., Tardos, É., Wexler, T.: The price of stability for network design with fair cost allocation. In: Proc. 45th Ann. IEEE Symp. Foundations Comp. Sci. (FOCS), pp. 295–304 (2004)

  5. Cardinal, J., Hoefer, M.: Selfish serive installation in networks. In: Proc. 2nd Workshop Internet & Network Economics (WINE) (2006)

  6. Chen, H.-L., Roughgarden, T.: Network design with weighted players. In: Proc. 18th Symp. Parallelism in Algorithms and Architectures (SPAA), pp. 29–38 (2006)

  7. Corbo, J., Parkes, D.: The price of selfish behavior in bilateral network formation. In: Proc. 24th Ann. ACM Symp. Principles of Distributed Comp. (PODC), pp. 99–107 (2005)

  8. Czumaj, A., Krysta, P., Vöcking, B.: Selfish traffic allocation for server farms. In: Proc. 34th Ann. ACM Symp. Theory Comp. (STOC), pp. 287–296 (2002)

  9. Demaine, E., Mahini, H., Hajiaghayi, M.T., Zadimoghaddam, M.: The price of anarchy in network creation games. In: Proc. 26th Ann. ACM Symp. Principles of Distributed Comp. (PODC) (2007)

  10. Dreyfus, S.E., Wagner, R.A.: The steiner problem in graphs. Networks 1, 195–207 (1972)

    Article  MATH  MathSciNet  Google Scholar 

  11. Fabrikant, A., Luthera, A., Maneva, E., Papadimitriou, C., Shenker, S.: On a network creation game. In: Proc. 22nd Ann. ACM Symp. Principles of Distributed Comp. (PODC), pp. 347–351 (2003)

  12. Goemams, M., Williamson, D.: A general approximation technique for constrained forest problems. SIAM J. Comput. 24(2), 296–317 (1995)

    Article  MathSciNet  Google Scholar 

  13. Hoefer, M.: Non-cooperative facility location and covering games. In: Proc. 17th Int. Symp. Algorithms and Computation (ISAAC 2006) (2006)

  14. Hoefer, M.: Non-cooperative tree creation. In: Proc. 31st Symp. Math. Foundations of Comp. Sci. (MFCS), pp. 517–527 (2006)

  15. Hoefer, M., Krysta, P.: Geometric network design with selfish agents. In: Proc. 11th Conf. on Comp. and Comb. (COCOON), Lecture Notes in Computer Science, vol. 3595, pp. 167–178 (2005)

  16. Jackson, M.: A survey of models of network formation: stability and efficiency. In: Demange, G., Wooders, M. (eds.) Group Formation in Economics; Networks, Clubs and Coalitions. Cambridge University Press, Cambridge (2004). Chap. 1

    Google Scholar 

  17. Koutsoupias, E., Papadimitriou, C.: Worst-case equilibria. In: Proc. 16th Ann. Symp. Theoretical Aspects Comp. Sci. (STACS), pp. 404–413 (1999)

  18. Robins, G., Zelikovsky, A.: Improved Steiner tree approximation in graphs. In: Proc. 10th Ann. ACM-SIAM Symp. Discrete Algorithms (SODA), pp. 770–779 (2000)

  19. Roughgarden, T., Tardos, É.: How bad is selfish routing?. J. ACM 49(2), 236–259 (2002)

    MathSciNet  Google Scholar 

  20. Schulz, A., Stier Moses, N.: Selfish routing in capacitated networks. Math. Oper. Res. 29(4), 961–976 (2004)

    Article  MATH  MathSciNet  Google Scholar 

  21. Vetta, A.: Nash equilibria in competitive societies with application to facility location, traffic routing and auctions. In: Proc. 43rd Ann. IEEE Symp. Foundations Comp. Sci. (FOCS), p. 416 (2002)

Download references

Author information

Authors and Affiliations

  1. Department of Computer & Information Science, Konstanz University, Box D 67, 78457, Konstanz, Germany

    Martin Hoefer

Authors
  1. Martin Hoefer
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Martin Hoefer.

Additional information

This work has appeared in part as an extended abstract at the 31st Symposium on Mathematical Foundations of Computer Science (MFCS 2006) and the 17th International Symposium on Algorithms and Computation (ISAAC 2006).

Supported by DFG Research Training Group 1042 “Explorative Analysis and Visualization of Large Information Spaces”.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Hoefer, M. Non-Cooperative Tree Creation. Algorithmica 53, 104–131 (2009). https://doi.org/10.1007/s00453-007-9014-9

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00453-007-9014-9

Keywords

Search

Navigation