Advertisement

Minimizing Rosenthal Potential in Multicast Games

  • Fedor V. Fomin
  • Petr Golovach
  • Jesper Nederlof
  • Michał Pilipczuk
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 7392)

Abstract

A multicast game is a network design game modelling how selfish non-cooperative agents build and maintain one-to-many network communication. There is a special source node and a collection of agents located at corresponding terminals. Each agent is interested in selecting a route from the special source to its terminal minimizing the cost. The mutual influence of the agents is determined by a cost sharing mechanism, which evenly splits the cost of an edge among all the agents using it for routing. The existence of a Nash equilibrium for the game was previously established by the means of Rosenthal potential. Anshelevich et al. [FOCS 2004, SICOMP 2008] introduced a measure of quality of the best Nash equilibrium, the price of stability, as the ratio of its cost to the optimum network cost. While Rosenthal potential is a reasonable measure of the quality of Nash equilibra, finding a Nash equilibrium minimizing this potential is NP-hard.

In this paper we provide several algorithmic and complexity results on finding a Nash equilibrium minimizing the value of Rosenthal potential. Let n be the number of agents and G be the communication network. We show that
  • For a given strategy profile s and integer k ≥ 1, there is a local search algorithm which in time n O(k) ·|G| O(1) finds a better strategy profile, if there is any, in a k-exchange neighbourhood of s. In other words, the algorithm decides if Rosenthal potential can be decreased by changing strategies of at most k agents;

  • The running time of our local search algorithm is essentially tight: unless FPT = W[1], for any function f(k), searching of the k-neighbourhood cannot be done in time f(k)·|G| O(1).

The key ingredient of our algorithmic result is a subroutine that finds an equilibrium with minimum potential in 3 n ·|G| O(1) time. In other words, finding an equilibrium with minimum potential is fixed-parameter tractable when parameterized by the number of agents.

Keywords

Nash Equilibrium Local Search Cost Sharing Local Search Algorithm Social Optimum 
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.
    Aarts, E.H.L., Lenstra, J.K.: Local Search in Combinatorial Optimization. Princeton University Press (1997)Google Scholar
  2. 2.
    Albers, S.: On the value of coordination in network design. SIAM J. Comput. 38, 2273–2302 (2009)MathSciNetzbMATHCrossRefGoogle Scholar
  3. 3.
    Anshelevich, E., Dasgupta, A., Kleinberg, J.M., Tardos, É., Wexler, T., Roughgarden, T.: The price of stability for network design with fair cost allocation. SIAM J. Comput. 38, 1602–1623 (2008)MathSciNetzbMATHCrossRefGoogle Scholar
  4. 4.
    Anshelevich, E., Dasgupta, A., Tardos, É., Wexler, T.: Near-optimal network design with selfish agents. Theory of Computing 4, 77–109 (2008)MathSciNetCrossRefGoogle Scholar
  5. 5.
    Chekuri, C., Chuzhoy, J., Lewin-Eytan, L., Naor, J., Orda, A.: Non-cooperative multicast and facility location games. IEEE Journal on Selected Areas in Communications 25, 1193–1206 (2007)CrossRefGoogle Scholar
  6. 6.
    Chen, H.-L., Roughgarden, T., Valiant, G.: Designing network protocols for good equilibria. SIAM J. Comput. 39, 1799–1832 (2010)MathSciNetzbMATHCrossRefGoogle Scholar
  7. 7.
    Downey, R.G., Fellows, M.R.: Parameterized complexity. Springer, New York (1999)CrossRefGoogle Scholar
  8. 8.
    Dreyfus, S.E., Wagner, R.A.: The Steiner problem in graphs. Networks 1, 195–207 (1972)MathSciNetzbMATHCrossRefGoogle Scholar
  9. 9.
    Epstein, A., Feldman, M., Mansour, Y.: Strong equilibrium in cost sharing connection games. In: Proceedings 8th ACM Conference on Electronic Commerce (EC 2007), pp. 84–92. ACM (2007)Google Scholar
  10. 10.
    Fellows, M., Fomin, F.V., Lokshtanov, D., Rosamond, F., Saurabh, S., Villanger, Y.: Local search: Is brute-force avoidable? In: Proceedings of the 21st International Joint Conference on Artificial Intelligence (IJCAI 2009), pp. 486–491. AAAI (2009)Google Scholar
  11. 11.
    Fellows, M.R., Hermelin, D., Rosamond, F.A., Vialette, S.: On the parameterized complexity of multiple-interval graph problems. Theor. Comput. Sci. 410, 53–61 (2009)MathSciNetzbMATHCrossRefGoogle Scholar
  12. 12.
    Flum, J., Grohe, M.: Parameterized Complexity Theory. Springer, Berlin (2006)Google Scholar
  13. 13.
    Gupta, A., Kumar, A., Pál, M., Roughgarden, T.: Approximation via cost sharing: Simpler and better approximation algorithms for network design. J. ACM 54, 11 (2007)MathSciNetzbMATHCrossRefGoogle Scholar
  14. 14.
    Gupta, A., Srinivasan, A., Tardos, É.: Cost-sharing mechanisms for network design. Algorithmica 50, 98–119 (2008)MathSciNetzbMATHCrossRefGoogle Scholar
  15. 15.
    Kleinberg, J., Tardos, E.: Algorithm design. Addison-Wesley, Boston (2005)Google Scholar
  16. 16.
    Koutsoupias, E., Papadimitriou, C.H.: Worst-case equilibria. Computer Science Review 3, 65–69 (2009)CrossRefGoogle Scholar
  17. 17.
    Marx, D.: Local search. Parameterized Complexity Newsletter 3, 7–8 (2008)Google Scholar
  18. 18.
    Michiels, W., Aarts, E.H.L., Korst, J.: Theoretical Aspects of Local Search. Springer (2007)Google Scholar
  19. 19.
    Niedermeier, R.: Invitation to fixed-parameter algorithms. Oxford University Press (2006)Google Scholar
  20. 20.
    Rosenthal, R.W.: A class of games possessing pure-strategy Nash equilibria. Internat. J. Game Theory 2, 65–67 (1973)MathSciNetzbMATHCrossRefGoogle Scholar
  21. 21.
    Roughgarden, T., Sundararajan, M.: Quantifying inefficiency in cost-sharing mechanisms. J. ACM 56 (2009)Google Scholar
  22. 22.
    Roughgarden, T., Tardos, É.: How bad is selfish routing? J. ACM 49, 236–259 (2002)MathSciNetCrossRefGoogle Scholar
  23. 23.
    Szeider, S.: The parameterized complexity of k-flip local search for sat and max sat. Discrete Optimization 8, 139–145 (2011)MathSciNetCrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2012

Authors and Affiliations

  • Fedor V. Fomin
    • 1
  • Petr Golovach
    • 2
  • Jesper Nederlof
    • 3
  • Michał Pilipczuk
    • 1
  1. 1.Department of InformaticsUniversity of BergenBergenNorway
  2. 2.School of Engineering and Computing ScienceDurham UniversityDurhamUK
  3. 3.Utrecht UniversityUtrechtThe Netherlands

Personalised recommendations