DBA STRATEGY INTO ACTION November

Slides:



Advertisements
Similar presentations
Objectives Know why companies use distribution channels and understand the functions that these channels perform. Learn how channel members interact and.
Advertisements

1 Representing Graphs. 2 Adjacency Matrix Suppose we have a graph G with n nodes. The adjacency matrix is the n x n matrix A=[a ij ] with: a ij = 1 if.
Global topological properties of biological networks.
What is an Information System? Input of DataResourcesProcessing Data Data Control of System Performance Storage of Data Resources Output of InformationProducts.
Degree A F H G B E D C. Adjacent A F H G B E D C.
Dagmara Galik, Group C.  Three information systems are involved in supply chain management: supplier relationship management, or SRM, (a business process.
Objectives Know why companies use distribution channels and understand the functions that these channels perform. Learn how channel members interact and.
Distribution Channels
PRODUCTION AND OPERATIONS MANAGEMENT
CHAPTER 8 Strategy Formulation: Functional Strategy & Strategic Choice
Marketing Channels: Delivering Customer Value
Chapter 10 10/18/ :45 PM1. Supply Chains And The Value Delivery Network Supply chain Downstream Marketing channels or distribution channels, such.
Project Management (1) Chapter 16, Part 1. Overview of Management 326 Operations and Operations Strategy Products, Processes, & Quality Operations Planning.
Global Manufacturing and Supply Chain Management
March 3, 2009 Network Analysis Valerie Cardenas Nicolson Assistant Adjunct Professor Department of Radiology and Biomedical Imaging.
The Business Research Company Technology. Technology Industry Taxonomy TBRC Business Research. All Rights Reseserved 2 Technology Computer Hardware &
Hiroki Sayama NECSI Summer School 2008 Week 2: Complex Systems Modeling and Networks Network Models Hiroki Sayama
outer dynamics Robin Matthews Professor of International Business
Marketing Channels Delivering Customer Value
Variations on strategic analysis and discourse Doctor of Business Administration London School of Commerce Adapted May 2017 PROFESSOR ROBIN MATTHEWS.
Complex adaptive systems can self organise spontaneously
DBA Strategic Road Maps March 2018
Doctor of Business Administration (SIA) revised August
STRATEGIC MODELS AND MANAGEMENT revised May 2017
THE ENNEAGRAM MODEL STATES AND PROCESSES JUNE 2018 (revised)
PROFESSOR ROBIN MATTHEWS KINGSTON UNIVERSITY BUSINESS SCHOOL LONDON
MSc. Project management RANEPA MOSCOW October 2017
SOFT SYSTEMS AND THE META MODEL SEPTEMBER 2018 perspectives abridged
STRATEGIC MODELS AND MANAGEMENT SIA SESSION 2 November
PROFESSOR ROBIN MATTHEWS KINGSTON UNIVERSITY BUSINESS SCHOOL LONDON
! Review for euler graphs WIN a FREE HW PASS or bonus point for FRIDAY’s quiz!!!!!!
NEO LIBERALISM public sector contract private sector consortium,
Policies and problems February 19th 2012 revised march 2018
TOPICS IN MACROECONOMICS RANEPA MARCH 2018
Department of Computer Science University of York
soft systems and the enneagram methodology
DBA networks and systems
Network Science: A Short Introduction i3 Workshop
Structure Account Analysis Own Position Business Development
TOPICS RELATED TO CHANGE August 2018
soft systems and the enneagram methodology
Doctor of Business Administration revision revised July
PROFESSOR ROBIN MATTHEWS KINGSTON UNIVERSITY BUSINESS SCHOOL LONDON
Peer-to-Peer and Social Networks
Doctor of Business Administration STC August
Doctor of Business Administration meta model revised July
Degree Distributions.
PROFESSOR ROBIN MATTHEWS KINGSTON UNIVERSITY BUSINESS SCHOOL LONDON
project management complexity hard systems and soft systems
Supply-Chain Management
Doctor of Business Administration STC August
May 2nd 2018 prof Robin Matthews
Section 8.3: Degree Distribution
PROFESSOR ROBIN MATTHEWS KINGSTON UNIVERSITY BUSINESS SCHOOL LONDON
Doctor of Business Administration August
Professor of International Business
KINGSTON UNIVERSITY BUSINESS SCHOOL LONDON
Presentation April (revised from February 2017 )
DBA STRATEGY INTO ACTION lecture and tutorial 1
soft systems and the enneagram methodology
Graphs G = (V, E) V are the vertices; E are the edges.
! Review for euler graphs WIN a FREE HW PASS or bonus point for FRIDAY’s quiz!!!!!!
NETWORKS.
Degree Distribution Ralucca Gera,
May 2nd 2018 prof Robin Matthews
DBA STRATEGY INTO ACTION 2
Doctor of Business Administration STC August
Project management strategy December Introductory session Taking stock
Light dark mandala.
SIA revised may 2017 introduction to the meta model
Presentation transcript:

DBA STRATEGY INTO ACTION November 23 2017 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