Skip to main content
SpringerLink
Log in

Indirect Influence Manipulation with Partial Observability

  • Conference paper
  • First Online:
Multi-Agent-Based Simulation XIX (MABS 2018)

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 11463))

  • 485 Accesses

Abstract

The propagation of concepts through a population of agents can be modelled as a cascade of influence spread from an initial set of individuals. In real-world environments there may be many concepts spreading and interacting, and we may not be able to directly control the target concept we wish to manipulate, requiring indirect manipulation through a secondary controllable concept. Previous work on influence spread typically assumes that we have full knowledge of a network, which may not be the case. In this paper, we investigate indirect influence manipulation when we can only observe a sample of the full network. We propose a heuristic, known as Target Degree, for selecting seed nodes for a secondary controllable concept that uses the limited information available in a partially observable environment to indirectly manipulate the target concept. Target degree is shown to be effective in synthetic small-world networks and in real-world networks when the controllable concept is introduced after the target concept.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Notes

  1. 1.

    http://jung.sourceforge.net/.

  2. 2.

    These networks are samples of full social networks, but for the purposes of this paper we treat them as the complete network.

  3. 3.

    http://snap.stanford.edu/data/index.html.

References

  1. Archbold, J., Griffiths, N.: Maximising influence in non-blocking cascades of interacting concepts. In: Gaudou, B., Sichman, J.S. (eds.) MABS 2015. LNCS (LNAI), vol. 9568, pp. 173–187. Springer, Cham (2016). https://doi.org/10.1007/978-3-319-31447-1_12

    Chapter  Google Scholar 

  2. Archbold, J., Griffiths, N.: Limiting concept spread in environments with interacting concepts. In: Proceedings of the 16th Conference on Autonomous Agents and MultiAgent Systems, pp. 1332–1340 (2017)

    Google Scholar 

  3. 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, pp. 199–208 (2009)

    Google Scholar 

  4. Goldenberg, J., Libai, B., Muller, E.: Using complex systems analysis to advance marketing theory development. Acad. Mark. Sci. Rev. 9(3), 1–18 (2001)

    Google Scholar 

  5. Goyal, A., Lu, W., Lakshmanan, L.V.: Celf++: optimizing the greedy algorithm for influence maximization in social networks. In: Proceedings of the 20th ACM International Conference Companion on World Wide Web, pp. 47–48 (2011)

    Google Scholar 

  6. Goyal, S., Kearns, M.: Competitive contagion in networks. In: Proceedings of the 44th Annual ACM Symposium on Theory of Computing, pp. 759–774 (2012)

    Google Scholar 

  7. He, X., Song, G., Chen, W., Jiang, Q.: Influence blocking maximization in social networks under the competitive linear threshold model. In: Proceedings 12th SIAM International Conference on Data Mining, pp. 463–474 (2012)

    Google Scholar 

  8. Kempe, D., Kleinberg, J., Tardos, É.: Maximizing the spread of influence through a social network. In: Proceedings of the 9th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 137–146 (2003)

    Google Scholar 

  9. Li, S., Zhu, Y., Li, D., Kim, D., Huang, H.: Rumor restriction in online social networks. In: Proceedings of the 32nd IEEE International Performance Computing and Communications Conference, pp. 1–10 (2013)

    Google Scholar 

  10. Liontis, K., Pitoura, E.: Boosting nodes for improving the spread of influence. Preprint arXiv:1609.03478 (2016)

  11. Masuda, N.: Immunization of networks with community structure. New J. Phys. 11(12), 123018 (2009)

    Article  Google Scholar 

  12. Sanz, J., Xia, C.Y., Meloni, S., Moreno, Y.: Dynamics of interacting diseases. Phys. Rev. X 4(4), 041005 (2014)

    Google Scholar 

  13. Wilder, B., Yadav, A., Immorlica, N., Rice, E., Tambe, M.: Uncharted but not uninfluenced: influence maximization with an uncertain network. In: Proceedings of the 16th Conference on Autonomous Agents and MultiAgent Systems, pp. 1305–1313 (2017)

    Google Scholar 

  14. Yadav, A., Chan, H., Xin Jiang, A., Xu, H., Rice, E., Tambe, M.: Using social networks to aid homeless shelters: dynamic influence maximization under uncertainty. In: Proceedings of the 2016 International Conference on Autonomous Agents & Multiagent Systems, pp. 740–748 (2016)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. University of Warwick, Coventry, UK

    James Archbold & Nathan Griffiths

Authors
  1. James Archbold
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Nathan Griffiths
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to James Archbold .

Editor information

Editors and Affiliations

  1. Malmö University, Malmö, Sweden

    Paul Davidsson

  2. Stockholm University, Kista, Sweden

    Harko Verhagen

Rights and permissions

Reprints and permissions

Copyright information

© 2019 Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Archbold, J., Griffiths, N. (2019). Indirect Influence Manipulation with Partial Observability. In: Davidsson, P., Verhagen, H. (eds) Multi-Agent-Based Simulation XIX. MABS 2018. Lecture Notes in Computer Science(), vol 11463. Springer, Cham. https://doi.org/10.1007/978-3-030-22270-3_3

Download citation

  • DOI: https://doi.org/10.1007/978-3-030-22270-3_3

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-030-22269-7

  • Online ISBN: 978-3-030-22270-3

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation