skip to main content
10.1145/2213977.2214046acmconferencesArticle/Chapter ViewAbstractPublication PagesstocConference Proceedingsconference-collections
research-article

Competitive contagion in networks

Published:19 May 2012Publication History

ABSTRACT

We develop a game-theoretic framework for the study of competition between firms who have budgets to "seed" the initial adoption of their products by consumers located in a social network. The payoffs to the firms are the eventual number of adoptions of their product through a competitive stochastic diffusion process in the network. This framework yields a rich class of competitive strategies, which depend in subtle ways on the stochastic dynamics of adoption, the relative budgets of the players, and the underlying structure of the social network.

We identify a general property of the adoption dynamics --- namely, decreasing returns to local adoption --- for which the inefficiency of resource use at equilibrium (the Price of Anarchy) is uniformly bounded above, across all networks. We also show that if this property is violated the Price of Anarchy can be unbounded, thus yielding sharp threshold behavior for a broad class of dynamics.

We also introduce a new notion, the Budget Multiplier, that measures the extent that imbalances in player budgets can be amplified at equilibrium. We again identify a general property of the adoption dynamics --- namely, proportional local adoption between competitors --- for which the (pure strategy) Budget Multiplier is uniformly bounded above, across all networks. We show that a violation of this property can lead to unbounded Budget Multiplier, again yielding sharp threshold behavior for a broad class of dynamics.

Skip Supplemental Material Section

Supplemental Material

stoc_9a_1.mp4

mp4

137.2 MB

References

  1. Ballester, C., A. Calvo-Armengol, and Y. Zenou (2006),Who's Who in Networks. Wanted: The Key Player, Econometrica, 74, 5, 1403--1417.Google ScholarGoogle ScholarCross RefCross Ref
  2. Bharathi, S., D. Kempe and M. Salek (2007),Competitive Influence Maximization in Social Networks, Internetand Network Economics Lecture Notes in Computer Science, 4858, 306--311. Google ScholarGoogle ScholarDigital LibraryDigital Library
  3. Borodin, A., Filmus, Y., Oren, J. (2010)Threshold Models for Competitive Influence in Social Networks, Proc. Workshop on Internet and Network Economics (WINE) Google ScholarGoogle ScholarDigital LibraryDigital Library
  4. Butters, G. (1977), Equilibrium Distribution of Prices and Advertising, Review of Economic Studies, 44, 465--492.Google ScholarGoogle ScholarCross RefCross Ref
  5. Chasparis, G. and Shamma, J. (2010),Control of Preferences in Social Networks", 49th IEEE Conference on Decision and Control.Google ScholarGoogle ScholarCross RefCross Ref
  6. Coleman, J. (1966), Medical Innovation: A Diffusion Study.Second Edition, Bobbs-Merrill. New York.Google ScholarGoogle Scholar
  7. Conley, T. and C. Udry (2010), Learning about a New Technology:Pineapple in Ghana. American Economic Review, .Google ScholarGoogle Scholar
  8. Carnes, T., Nagarajan, C., Wild, S.,van Zuylen, A. (2007),Maximizing Influence in a Competitive Social Network:A Follower's Perspective. Proc. Ninth ACM Conference on Electronic Commerce (EC), pages 351--360. Google ScholarGoogle ScholarDigital LibraryDigital Library
  9. Dubey, P., Garg, R., De Meyer, B. (2006), Competingfor Customers in a Social Network: The Quasi-linear Case. Proc. Workshop on Internet and Network Economics (WINE) Google ScholarGoogle ScholarDigital LibraryDigital Library
  10. Dubey, P. (1986), Inefficiency of Nash Equilibria. Mathematics of Operations Research., 11, 1, 1 V8. Google ScholarGoogle ScholarDigital LibraryDigital Library
  11. Feick, L.F. and L.L. Price (1987), The Market Maven:A Diffuser of Marketplace Information. Journal of Marketing, 51(1), 83--97.Google ScholarGoogle ScholarCross RefCross Ref
  12. Foster, A.D. and M.R. Rosenzweig (1995), Learning by Doing and Learning from Others: Human Capital and Technical Change in Agriculture. Journal of Political Economy, 103(6), 1176--1209.Google ScholarGoogle ScholarCross RefCross Ref
  13. Galeotti, A., and S. Goyal (2009), Influencing the Influencers: a Theory of Strategic Diffusion,Rand Journal of Economics, 40, 3,Google ScholarGoogle Scholar
  14. Godes D. and D. Mayzlin (2004), Using Online Conversations to Study Word of Mouth Communication. Marketing Science, 23(4), 545--560. Google ScholarGoogle ScholarDigital LibraryDigital Library
  15. Granovetter, M. (1978), Threshold Models of Collective Behavior, American Journal of Sociology,83, 6, 1420--1443.Google ScholarGoogle ScholarCross RefCross Ref
  16. Grossman, G. and C. Shapiro (1984), Informative Advertising with Differentiated Products. Review of Economic Studies, 51,63--82.Google ScholarGoogle ScholarCross RefCross Ref
  17. Heidari, H. (2012),A Note on the Competitive Contagion Problem.Personal communication.Google ScholarGoogle Scholar
  18. Koutsoupias, E., and C. H. Papadimitriou (1999), Worst-case Equilibria, STACS. Google ScholarGoogle ScholarDigital LibraryDigital Library
  19. Kempe, D., J. Kleinberg, E. Tardos. (2003), Maximizing the Spread of Influence through a Social Network. Proc. 9th ACM SIGKDD Intl. Conf. on Knowledge Discovery and Data Mining. Google ScholarGoogle ScholarDigital LibraryDigital Library
  20. Kempe, D., J. Kleinberg, E. Tardos (2005), Influential Nodesin a Diffusion Model for Social Networks. Proc. 32nd International Colloquium on Automata,Languages and Programming (ICALP). Google ScholarGoogle ScholarDigital LibraryDigital Library
  21. Mossel, E., Roch, S. (2007),Submodularity of Influence in Social Networks: From Local to Global. SIAM J. Computing, 39(6):2176--2188. Google ScholarGoogle ScholarDigital LibraryDigital Library
  22. Reingen, P.H., B.L. Foster, J.J. Brown and S.B. Seidman (1984),Brand Congruence in Interpersonal Relations:A Social Network Analysis. The Journal of Consumer Research, 11(3), 771--783.Google ScholarGoogle ScholarCross RefCross Ref
  23. Roughgarden, T., Tardos, E. (2000),How Bad is Selfish Routing? Proc. 41st Annual IEEE Symposiumon Foundations of Computer Science (FOCS). Google ScholarGoogle ScholarDigital LibraryDigital Library
  24. Skaperdas, S. (1996), Contest Success Functions, Economic Theory, 7, 2, 283--290.Google ScholarGoogle ScholarCross RefCross Ref
  25. Tullock, G. (1967), The Welfare Costs of Tariffs,Monopolies, and Theft, Western Economic Journal 5, 3,224--232.Google ScholarGoogle Scholar
  26. Tullock, G. (1980), Efficient Rent Seeking, Towards a theory of the rent-seeking society, edited by Buchanan, J., Tollison, R., and Tullock, G., Texas A&M University Press.Google ScholarGoogle Scholar
  27. Vetta, A. (2002), Nash Equilibria in Competitive Societies with Applications to Facility Location, Traffic Routing and Auctions. Proceedings of the 43rd Symposium on the Foundations of Computer Science (FOCS), 416--425. Google ScholarGoogle ScholarDigital LibraryDigital Library

Index Terms

  1. Competitive contagion in networks

    Recommendations

    Comments

    Login options

    Check if you have access through your login credentials or your institution to get full access on this article.

    Sign in
    • Published in

      cover image ACM Conferences
      STOC '12: Proceedings of the forty-fourth annual ACM symposium on Theory of computing
      May 2012
      1310 pages
      ISBN:9781450312455
      DOI:10.1145/2213977

      Copyright © 2012 ACM

      Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

      Publisher

      Association for Computing Machinery

      New York, NY, United States

      Publication History

      • Published: 19 May 2012

      Permissions

      Request permissions about this article.

      Request Permissions

      Check for updates

      Qualifiers

      • research-article

      Acceptance Rates

      Overall Acceptance Rate1,469of4,586submissions,32%

      Upcoming Conference

      STOC '24
      56th Annual ACM Symposium on Theory of Computing (STOC 2024)
      June 24 - 28, 2024
      Vancouver , BC , Canada

    PDF Format

    View or Download as a PDF file.

    PDF

    eReader

    View online with eReader.

    eReader