Abstract
Adoption or rejection of ideas, products, and technologies in a society is often governed by simultaneous propagation of positive and negative influences. Consider a planner trying to introduce an idea in different parts of a society at different times. How should the planner design a schedule considering this fact that positive reaction to the idea in early areas has a positive impact on probability of success in later areas, whereas a flopped reaction has exactly the opposite impact? We generalize a well-known economic model which has been recently used by Chierichetti, Kleinberg, and Panconesi (ACM EC’12). In this model the reaction of each area is determined by its initial preference and the reaction of early areas. We model the society by a graph where each node represents a group of people with the same preferences. We consider a full propagation setting where news and influences propagate between every two areas. We generalize previous works by studying the problem when people in different areas have various behaviors.
We first prove, independent of the planner’s schedule, influences help (resp., hurt) the planner to propagate her idea if it is an appealing (resp., unappealing) idea. We also study the problem of designing the optimal non-adaptive spreading strategy. In the non-adaptive spreading strategy, the schedule is fixed at the beginning and is never changed. Whereas, in adaptive spreading strategy the planner decides about the next move based on the current state of the cascade. We demonstrate that it is hard to propose a non-adaptive spreading strategy in general. Nevertheless, we propose an algorithm to find the best non-adaptive spreading strategy when probabilities of different behaviors of people in various areas drawn i.i.d from an unknown distribution. Then, we consider the influence propagation phenomenon when the underlying influence network can be any arbitrary graph. We show it is #P-complete to compute the expected number of adopters for a given spreading strategy. However, we design a polynomial-time algorithm for the problem of computing the expected number of adopters for a given schedule in the full propagation setting. Last but not least, we give a polynomial-time algorithm for designing an optimal adaptive spreading strategy in the full propagation setting.
Supported in part by NSF CAREER award 1053605, NSF grant CCF-1161626, ONR YIP award N000141110662, and a DARPA/AFOSR grant FA9550-12-1-0423.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Kempe, D., Kleinberg, J., Tardos, É: Maximizing the spread of influence through a social network. In: KDD, pp. 137–146 (2003)
Kempe, D., Kleinberg, J., Tardos, É.: Influential nodes in a diffusion model for social networks. In: Caires, L., Italiano, G.F., Monteiro, L., Palamidessi, C., Yung, M. (eds.) ICALP 2005. LNCS, vol. 3580, pp. 1127–1138. Springer, Heidelberg (2005)
Mossel, E., Roch, S.: On the submodularity of influence in social networks. In: STOC, pp. 128–134 (2007)
Anari, N., Ehsani, S., Ghodsi, M., Haghpanah, N., Immorlica, N., Mahini, H., Mirrokni, V.S.: Equilibrium pricing with positive externalities (Extended abstract). In: Saberi, A. (ed.) WINE 2010. LNCS, vol. 6484, pp. 424–431. Springer, Heidelberg (2010)
Akhlaghpour, H., Ghodsi, M., Haghpanah, N., Mirrokni, V.S., Mahini, H., Nikzad, A.: Optimal iterative pricing over social networks (Extended abstract). In: Saberi, A. (ed.) WINE 2010. LNCS, vol. 6484, pp. 415–423. Springer, Heidelberg (2010)
Hartline, J., Mirrokni, V.S., Sundararajan, M.: Optimal marketing strategies over social networks. In: WWW, pp. 189–198 (2008)
Arthur, W.B.: Competing technologies, increasing returns, and lock-in by historical events. The Economic Journal 99(394), 116–131 (1989)
Chierichetti, F., Kleinberg, J., Panconesi, A.: How to schedule a cascade in an arbitrary graph. In: EC, pp. 355–368 (2012)
Banerjee, A.V.: A simple model of herd behavior. The Quarterly Journal of Economics 107(3), 797–817 (1992)
Bikhchandani, S., Hirshleifer, D., Welch, I.: A theory of fads, fashion, custom, and cultural change in informational cascades. Journal of Political Economy 100(5), 992–1026 (1992)
Granovetter, M.: Threshold models of collective behavior. American Journal of Sociology 83(6), 1420–1443 (1978)
Domingos, P., Richardson, M.: Mining the network value of customers. In: KDD, pp. 57–66 (2001)
Chen, W., Wang, Y., Yang, S.: Efficient influence maximization in social networks. In: KDD, pp. 199–208 (2009)
Arthur, D., Motwani, R., Sharma, A., Xu, Y.: Pricing strategies for viral marketing on social networks. In: Leonardi, S. (ed.) WINE 2009. LNCS, vol. 5929, pp. 101–112. Springer, Heidelberg (2009)
Goyal, S., Kearns, M.: Competitive contagion in networks. In: STOC, pp. 759–774 (2012)
Chen, W., Collins, A., Cummings, R., Ke, T., Liu, Z., Rincon, D., Sun, X., Wang, Y., Wei, W., Yuan, Y.: Influence maximization in social networks when negative opinions may emerge and propagate. In: ICDM, pp. 379–390 (2011)
Li, Y., Chen, W., Wang, Y., Zhang, Z.L.: Influence diffusion dynamics and influence maximization in social networks with friend and foe relationships. In: WSDM, pp. 657–666 (2013)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2013 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Hajiaghayi, M., Mahini, H., Sawant, A. (2013). Scheduling a Cascade with Opposing Influences. In: Vöcking, B. (eds) Algorithmic Game Theory. SAGT 2013. Lecture Notes in Computer Science, vol 8146. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-41392-6_17
Download citation
DOI: https://doi.org/10.1007/978-3-642-41392-6_17
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-41391-9
Online ISBN: 978-3-642-41392-6
eBook Packages: Computer ScienceComputer Science (R0)