Abstract
Both customers and companies have a great interest to optimize the diffusion time. The contents generators always try to disseminate their information in the minimum time in order to benefit the most of the received reward. In our paper, we suppose that each node in the social network is interested to diffuse its content with the goal of optimizing its delivery time and selling its information to the receivers. Each content generator must target its adapted neighbors, who will play the role of relay and will allow the arrival of the information to its destination before the expiry of its time. The objective of our work is to disseminate the content through neighbors characterized by a high connectivity and a high quality of relationships in terms of being interested to share the same type of information. We model our problem as a stochastic learning game, where each player tries to maximize its utility function by selecting the optimal action depending on the state of the system and on the action taken by the competitor.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Kempe, D., Kleinberg, J.M., Tardos, E.: Maximizing the spread of influence through a social network. In: Proceedings of the Ninth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, KDD, pp. 137–146. ACM (2003)
Kempe, D., Kleinberg, J.M., Tardos, E.: 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)
Even-Dar, E., Shapira, A.: A note on maximizing the spread of influence in social networks. In: Deng, X., Graham, F.C. (eds.) WINE 2007. LNCS, vol. 4858, pp. 281–286. Springer, Heidelberg (2007)
Kim, H., Yoneki, E.: Influential neighbours selection for information diffusion in online social networks. In: 21st International Conference on Computer Communications and Networks (ICCCN), Munich, Germany, pp. 1–7 (2012)
Jung, K., Heo, W., Chen, W.: Irie: scalable and robust influence maximization in social networks. In: Proceedings of 12th International Conference on Data Mining (ICDM 2012), pp. 918–923. IEEE Computer Society, Washington, DC (2012)
Haddad, M., Altman, E.: The interplay between caching and popularity. In: NetGCOOP: International Conference on NETwork Games, COntrol and OPtimization, pp. 1–4. IEEE (2011)
Altman, E.: A stochastic game approach for competition over popularity in social networks. Dynamic Games and Applications, Online publication, September 2012
Rodriguez, M.G., Leskovec, J., Krause, A.: Inferring networks of diffusion and influence. In: Proceedings of the 16th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, KDD 2010, pp. 1019–1028. ACM, New York (2010)
Even-Dar, E., Shapira, A.: A note on maximizing the spread of influence in social networks. Inf. Process. Lett. 111(4), 184–187 (2011)
Altman, E.: A semi-dynamic model for competition over popularity and over advertisement space in social networks. In: VALUETOOLS, pp. 273–279. IEEE (2012)
Chen, W., Lu, W., Zhang, N.: Time-critical influence maximization in social networks with time-delayed diffusion process. arXiv preprint arXiv:1204.3074 (2012)
Ok, J., Jin, Y., Shin, J., Yi, Y.: On maximizing diffusion speed in social networks: impact of random seeding and clustering. In: The 2014 ACM International Conference on Measurement and Modeling of Computer Systems, SIGMETRICS 2014, pp. 301–313. ACM, New York (2014)
Shapley, L.S.: Stochastic games. Proc. Nat. Acad. Sci. U.S.A. 39(10), 1095 (1953)
Watkins, C.J.: Learning from Delayed Rewards. Diss. University of Cambridge (1989)
Bowling, M., Veloso, M.: Rational and convergent learning in stochastic games. In: Proceedings of the 17th International Joint Conference on Artificial Intelligence - IJCAI 2001, vol. 2, pp. 1021–1026. Morgan Kaufmann Publishers Inc., San Francisco (2001)
Littman, M.L.: Markov games as a framework for multi-agent reinforcement learning. In: ICML 1994, pp. 157–163 (1994)
Littman, M.L., Szepesvári, C., Littman, M.L.: A generalized reinforcement-learning model: convergence and applications. In: ICML, pp. 310–318 (1996)
Bowling, M., Veloso, M.: An analysis of stochastic game theory for multiagent reinforcement learning. No. CMU-CS-00-165. Carnegie-Mellon Univ. Pittsburgh PA School of Computer Science (2000)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2015 Springer International Publishing Switzerland
About this paper
Cite this paper
Mekouar, S., El-Hammani, S., Ibrahimi, K., Bouyakhf, EH. (2015). Optimizing Diffusion Time of the Content Through the Social Networks: Stochastic Learning Game. In: Bouajjani, A., Fauconnier, H. (eds) Networked Systems . NETYS 2015. Lecture Notes in Computer Science(), vol 9466. Springer, Cham. https://doi.org/10.1007/978-3-319-26850-7_25
Download citation
DOI: https://doi.org/10.1007/978-3-319-26850-7_25
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-26849-1
Online ISBN: 978-3-319-26850-7
eBook Packages: Computer ScienceComputer Science (R0)