Prof. Chris Cannings

University of Sheffield, UK




1968 Ph.D., University of London

1964 B.Sc., Mathematics, University of London

Publications (selected)

  1. Broom M & Cannings C. (2015) Graphic Deviations. Discrete Maths., 338, 701-711.
  2. Cannings C (2015) Combinatorial aspects of Parker's model. Dynamic Games and Applications,5,263-274.
  3. Cannings,C.(2013) The Stationary Distributions of a Class of Markov Chains. Applied Mathematics,4,769-773.
  4. Southwell R & Cannings C.(2013) Best Response Games on Regular Graphs Applied Mathematics,4,950-962.
  5. Southwell R & Cannings C. (2013) Exploring the space of substitution systems. Complex Systems, 22, 1-34.
  6. Cannings C & Cannings R. (2013) Absence of pure Nash equilibria in a class of Co-ordination Games. Statistics, Optimisation and Information Computing,1,1-7.
  7. Southwell R, Jianwei Huang & Cannings C.(2013) Complex Networks from Simple Rules. Complex Systems, 22, 151-173.
  8. Broom M & Cannings C. (2013) Evolution of a Network with strategic link formation governed by indivdual preferences. J. Theoret. Biol.335, 160-168.
  9. Cannings C & J Jordan. (2013) Random walks and preferential attachment. Electronic Communications in Probability, 18, 1-5.
  10. Mitavski B., Rowe J & Cannings C. (2012) A version of Geiringer-like theorems for decision making in the environments with randomness and incomplete information. Int. J. Intel. Comp. & Cyber.,5,36-90.
  11. Southwell R., Cannings C. (2010) Some models of reproducing graphs: I Pure Reproduction. Applied Maths., 1, 137-145.
  12. Southwell R., Cannings C. (2010) Some models of reproducing graphs: II Age capped vertices. Applied Maths., 1, 251-233.
  13. Southwell R., Cannings C. (2010) Some models of reproducing graphs: III Game based reproduction. Applied Maths., 1, 335-343.
  14. Broom M and Cannings C. (2010) Evolutionary Game Theory. In: En-cyclopaedia of the Life Sciences. John Wiley, Chichester.
  15. Broom M., Cannings C. (2010) Evolutionary Game Theory, Encyclopedia of the Life Sciences (to appear). [10]Southwell R., Cannings C., (2010) Some models of graph reproduction; 1 Pure Reproduction. (to appear) Applied Mathematics.
  16. Mitavskiy, B., Cannings, C. (2009) Estimating the ratios of the stationary distribution values for Markov chains modeling evolutionary algorithms. Evolutionary Computation,17,343-377.[4].
  17. Mitavskiy, B., Rowe, J., Cannings, C. (2009) Theoretical analysis of local search strategies to optimize communication subject to preserving the total number of links. Int.J.Intelligent Computing and Cybernetics, 2, 243-284, Outstanding Paper Award winner 2009[2].
  18. Cannings C. (2009) The majority game on regular and random nerworks. International Conference on Game Theory for Networks. GameNets, i-xvi.[1].
  19. Chrysafis O, Cannings C. (2009) Weighted self-similar networks under preferential attachment. Physica A, 388, 2965-2974 [3].
  20. Southwell R., Cannings C. (2009) Games on graphs that grow deterministically, International Conference on Game Theory for Networks. GameNets, 347-356.
  21. Rowe, J., Mitavskiy, B., Cannings, C. (2008) Propagation Time in Stochastic Communication Networks. Second IEEE International Conference on Digital Ecosystems and Technologies pages 426-431 (see also arXiv:math/0608561 ).
  22. Mitavskiy, B., Rowe, J., Cannings, C. (2008) Preliminary Theoretical Analysis of a Local Search Algorithm to Optimize Network Communication Subject to Preserving the Total Number of Links. IEEE Congress on Evolutionary Computing, 1484-1491.
  23. Boris Mitavskiy and Chris Cannings (2008) Evaluating Stationary Distribution of the Binary GA Markov Chain in Special Cases. Proceedings of the Schloss Dagstuhl Seminar in “Theory of Evolutionary Algorithms”.

Profile Details


Last updated: 2015-7-7