Abstract
This paper investigates the process of boosting the social networks players to propagate information or services via recruiting new players, in a model initially proposed by MIT team to solve the DARPA challenge. The huge growth of online networks presenting large-scale social structure that can be formulated as a game with set of connected players. To increase the probability of propagation in such systems, it is an essential to motivate the current players to recruit more players by incentives. The proposed model gives bonuses to the players who are on the winning chain based on their recruitment history. The extended model ensures fair allotment taking into account the budget of the task. Additionally, we proposed a model to speed up the process of recruitment by guiding the players based on their activities. An empirical study has been conducted to measure the performance of the proposed model.
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
Preview
Unable to display preview. Download preview PDF.
References
Arcaute, E., Kirsch, A., Kumar, R., Liben-Nowell, D., Vassilvitskii, S.: On threshold behavior in query incentive networks. In: Proceedings of the 8th ACM Conference on Electronic Commerce, pp. 66–74. ACM (2007)
Arthur, D., Motwani, R., Sharma, A., Xu, Y.: Pricing strategies for viral marketing on social networks. CoRR abs/0902.3485 (2009)
Babaioff, M., Dobzinski, S., Oren, S., Zohar, A.: On bitcoin and red balloons. Arxiv preprint arXiv:1111.2626 (2011)
Chen, W., Wang, Y., Yang, S.: Efficient influence maximization in social networks. In: Proceedings of the 15th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, KDD 2009, pp. 199–208. ACM, New York (2009), http://doi.acm.org/10.1145/1557019.1557047
Doan, A., Ramakrishnan, R., Halevy, A.: Crowdsourcing systems on the world-wide web. Communications of the ACM 54(4), 86–96 (2011)
Ford, C.: Twitter, facebook, and ten red balloons: Social network problem solving and homeland security. Homeland Security Affairs 7 (2011)
Kleinberg, J., Raghavan, P.: Query incentive networks. In: 46th Annual IEEE Symposium on Foundations of Computer Science, FOCS 2005, pp. 132–141. IEEE (2005)
Mahdi, K., Safar, M., Sarkhoh, I., Kassem, A.: Cycle-based versus degree-based classification of social networks. Journal of Digital Information Management 7(6) (2009)
Mohite, M., Narahari, Y.: Incentive compatible influence maximization in social networks and application to viral marketing. CoRR abs/1102.0918 (2011)
Pickard, G., Pan, W., Rahwan, I., Cebrian, M., Crane, R., Madan, A., Pentland, A.: Time-critical social mobilization. Science 334(6055), 509–512 (2011)
Xu, K., Xie, J., Li, V.: Locating experts via online social networks. In: 2010 IEEE International Conference on Communications (ICC), pp. 1–5. IEEE (2010)
Yuen, M., King, I., Leung, K.: A survey of crowdsourcing systems. In: SocialCom 2011: Proceedings of the Third IEEE International Conference on Social Computing (2011)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2012 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Mehdi, N.A. (2012). Recursive Incentives with Guided Recruiting Encouragement. In: Benlamri, R. (eds) Networked Digital Technologies. NDT 2012. Communications in Computer and Information Science, vol 294. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-30567-2_39
Download citation
DOI: https://doi.org/10.1007/978-3-642-30567-2_39
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-30566-5
Online ISBN: 978-3-642-30567-2
eBook Packages: Computer ScienceComputer Science (R0)