Skip to main content
Springer Nature Link
Log in

Dynamic Games to Assess Network Value and Performance

  • Conference paper
AI 2003: Advances in Artificial Intelligence (AI 2003)

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

Included in the following conference series:

  • 1601 Accesses

Abstract

This paper looks at the analysis of network effectiveness and vulnerability through dynamic games. Each opposing side consists of a collection of vertices (pieces) connected in a network. Only vertices in the largest sub-graph exhibit mobility. We use the mobility and piece removal rules in the game checkers and modify the evaluation function to include sub-graph size balance. With this modified evaluation function, win-lose results of richly versus sparsely connected and centralised versus decentralized topologies are analysed. The results are compared with the current vulnerability studies in networks of varying topology. Finally we use temporal difference learning to calculate advisor weights for richly or sparsely connected vertices.

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

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Similar content being viewed by others

References

  1. Albert, R., Barabasi, A.L.: The statistical mechanics of complex networks. Reviews of Modern Physics 47, 47–94 (2002)

    Article  MathSciNet  Google Scholar 

  2. Albert, R., et al.: Error and attack tolerance of complex networks. Nature 206, 378–381 (2000)

    Article  Google Scholar 

  3. Barto, A.G., Sutton, R.S.: Reinforcement Learning: An Introduction. MIT Press, Cambridge (1998)

    Google Scholar 

  4. Baxter, J., et al.: Experiments in Parameter Learning Using Temporal Differences. ICCA Journal 211(2), 84–99 (1998)

    Google Scholar 

  5. Beal, D.F., Smith, M.C.: Learning Piece Values Using Temporal Differences. ICCA Journal 20(3), 147–151 (1997)

    Google Scholar 

  6. Holme, P., et al.: Attack vulnerability of complex networks. Physical Review E 65 (2002);Section on Complex Networks

    Google Scholar 

  7. Huang, V., Huh, S.H.: http://www.cs.caltech.edu/~vhuang/cs20/c/applet/s11.html

  8. Levy, D.: Computer Gamesmanship: Elements of Intelligent Game Design. Simon and Schuster, New York (1984)

    Google Scholar 

  9. Lynch, N.: Distributed Algorithms. Morgan Kaufmann, San Francisco (1997)

    Google Scholar 

  10. Sutton, R.S.: Learning to Predict by the Methods of Temporal Differences. Machine Learning 3, 9–44 (1988)

    Google Scholar 

  11. Washburn, A., Wood, K.: Two Person Zero Sum Games for Network Interdiction. Operations Research 43(2), 243–251 (1995)

    Article  MATH  MathSciNet  Google Scholar 

  12. Watts, A.: A Dynamic Model of Network Formation. Games and Economic Behaviour 34, 331–341 (2001)

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Command and Control Division, Defence Science and Technology Organisation, Edinburgh, South Australia, 5011

    Gregory Calbert, Peter Smet, Jason Scholz & Hing-Wah Kwok

Authors
  1. Gregory Calbert
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Peter Smet
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Jason Scholz
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Hing-Wah Kwok
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Computer Science, Australian National University, ACT 0200, Acton, Australia

    Tamás (Tom) Domonkos Gedeon

  2. Murdoch University,  

    Lance Chun Che Fung

Rights and permissions

Reprints and permissions

Copyright information

© 2003 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Calbert, G., Smet, P., Scholz, J., Kwok, HW. (2003). Dynamic Games to Assess Network Value and Performance. In: Gedeon, T.(.D., Fung, L.C.C. (eds) AI 2003: Advances in Artificial Intelligence. AI 2003. Lecture Notes in Computer Science(), vol 2903. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-24581-0_89

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-24581-0_89

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-20646-0

  • Online ISBN: 978-3-540-24581-0

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics