Project management strategy December 4 2017 Introductory session Taking stock PROFESSOR ROBIN MATTHEWS KINGSTON UNIVERSITY BUSINESS SCHOOL LONDON ACADEMY OF NATIONAL ECONOMY MOSCOW MOSI YOSHKAR-OLA ECONOMIC STRATEGIES PRESIDENT OF THE LEAGUE OF CORPORATE STRATEGY AND ACCOUNTING http/www.robindcmatthews.com http://www.tcib.org.uk/about.html http://kpp-russia.ru robindcmatthews.com
(current system state) T Past Future upside System state possible futures possible causes probable futures Probable causes possible causes possible futures Now (current system state) T downside robindcmatthews.com
THE FUTURE (outer dynamics) 1. What is the future outlook and 2 THE FUTURE (outer dynamics) 1.What is the future outlook and 2. What are the risks for business? Use the diagram below in your presentation robindcmatthews.com
robindcmatthews.com
robindcmatthews.com
robindcmatthews.com
PRODUCTS AND SERVICES (VALUE ADDED IN SUPPLY CHAIN) SUPPLIERS RETAILERS FINAL CUSTOMERS DISTRIBUTORS FIRM’S VALUE CHAIN VLUED VLUE PRODUCTS AND SERVICES (VALUE ADDED IN SUPPLY CHAIN) robindcmatthews.com
energy company robindcmatthews.com
robindcmatthews.com
https://hbr.org/2007/01/how-leaders-create-and-use-networks robindcmatthews.com https://hbr.org/2007/01/how-leaders-create-and-use-networks
META MODEL PAYOFFS INNER DYNAMICS DYNAMICS GRAMMAR OUTER DYNAMICSOUTER Mandala robindcmatthews.com
robindcmatthews.com
robindcmatthews.com
Haldane (2009) robindcmatthews.com
Adjacency matrix F Adjacency matrix E2 E1 robindcmatthews.com
k = degree of a node; the number of connected edges P(k) ≈ Ck – α 𝑃(𝑘) = 𝐶 𝑘 𝛼 The internet k = degree of a node; the number of connected edges robindcmatthews.com
Small world networks highly clustered, short path lengths Degree of a node is the number of edges (k) connecting it to other nodes. High degree nodes have many connections (high k); low degree nodes have few (low k) P(k) probability of degree k follows a power law P(k) ≈ k – α.. P(k) ≈ Ck – α.. robindcmatthews.com