<?xml version="1.0" encoding="UTF-8"?><!DOCTYPE article PUBLIC "-//NLM//DTD Journal Publishing DTD v3.0 20080202//EN" "http://dtd.nlm.nih.gov/publishing/3.0/journalpublishing3.dtd">
<article xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink" dtd-version="3.0" xml:lang="en" article-type="research article">
 <front>
  <journal-meta>
   <journal-id journal-id-type="publisher-id">
    tel
   </journal-id>
   <journal-title-group>
    <journal-title>
     Theoretical Economics Letters
    </journal-title>
   </journal-title-group>
   <issn pub-type="epub">
    2162-2078
   </issn>
   <issn publication-format="print">
    2162-2086
   </issn>
   <publisher>
    <publisher-name>
     Scientific Research Publishing
    </publisher-name>
   </publisher>
  </journal-meta>
  <article-meta>
   <article-id pub-id-type="doi">
    10.4236/tel.2024.143063
   </article-id>
   <article-id pub-id-type="publisher-id">
    tel-134293
   </article-id>
   <article-categories>
    <subj-group subj-group-type="heading">
     <subject>
      Articles
     </subject>
    </subj-group>
    <subj-group subj-group-type="Discipline-v2">
     <subject>
      Business 
     </subject>
     <subject>
       Economics
     </subject>
    </subj-group>
   </article-categories>
   <title-group>
    Images of Organizational Evolution
   </title-group>
   <contrib-group>
    <contrib contrib-type="author" xlink:type="simple">
     <name name-style="western">
      <surname>
       Issam
      </surname>
      <given-names>
       Tlemsani
      </given-names>
     </name> 
     <xref ref-type="aff" rid="aff1"> 
      <sup>1</sup>
     </xref>
    </contrib>
    <contrib contrib-type="author" xlink:type="simple">
     <name name-style="western">
      <surname>
       Robin
      </surname>
      <given-names>
       Matthews
      </given-names>
     </name> 
     <xref ref-type="aff" rid="aff2"> 
      <sup>2</sup>
     </xref>
    </contrib>
    <contrib contrib-type="author" xlink:type="simple">
     <name name-style="western">
      <surname>
       Mohamed Ashmel Mohamed
      </surname>
      <given-names>
       Hashim
      </given-names>
     </name> 
     <xref ref-type="aff" rid="aff3"> 
      <sup>3</sup>
     </xref>
    </contrib>
    <contrib contrib-type="author" xlink:type="simple">
     <name name-style="western">
      <surname>
       Mushtaq Hussain
      </surname>
      <given-names>
       Khan
      </given-names>
     </name> 
     <xref ref-type="aff" rid="aff3"> 
      <sup>3</sup>
     </xref>
    </contrib>
    <contrib contrib-type="author" xlink:type="simple">
     <name name-style="western">
      <surname>
       Osama
      </surname>
      <given-names>
       El-Temtamy
      </given-names>
     </name> 
     <xref ref-type="aff" rid="aff4"> 
      <sup>4</sup>
     </xref>
    </contrib>
   </contrib-group> 
   <aff id="aff1">
    <addr-line>
     aThe Center for International Business, London, UK
    </addr-line> 
   </aff> 
   <aff id="aff2">
    <addr-line>
     aKingston University Business School, London, UK
    </addr-line> 
   </aff> 
   <aff id="aff3">
    <addr-line>
     aCardiff School of Management, Cardiff Metropolitan University, Cardiff, UK
    </addr-line> 
   </aff> 
   <aff id="aff4">
    <addr-line>
     aDepartment of Accounting and Finance, Bissett School of Business, Calgary, Canada
    </addr-line> 
   </aff> 
   <pub-date pub-type="epub">
    <day>
     06
    </day> 
    <month>
     05
    </month>
    <year>
     2024
    </year>
   </pub-date> 
   <volume>
    14
   </volume> 
   <issue>
    03
   </issue>
   <fpage>
    1241
   </fpage>
   <lpage>
    1266
   </lpage>
   <history>
    <date date-type="received">
     <day>
      23,
     </day>
     <month>
      February
     </month>
     <year>
      2024
     </year>
    </date>
    <date date-type="published">
     <day>
      25,
     </day>
     <month>
      February
     </month>
     <year>
      2024
     </year> 
    </date> 
    <date date-type="accepted">
     <day>
      25,
     </day>
     <month>
      June
     </month>
     <year>
      2024
     </year> 
    </date>
   </history>
   <permissions>
    <copyright-statement>
     © Copyright 2014 by authors and Scientific Research Publishing Inc. 
    </copyright-statement>
    <copyright-year>
     2014
    </copyright-year>
    <license>
     <license-p>
      This work is licensed under the Creative Commons Attribution International License (CC BY). http://creativecommons.org/licenses/by/4.0/
     </license-p>
    </license>
   </permissions>
   <abstract>
    <b>Purpose:</b> This paper develops the notion of building a brand-new theory of organisational structure using internal capabilities and emphasizes the process of how those capabilities (synergies) are recognized, built, and prioritized. Exchangeable payoffs generated by synergies or stand-alone values are recapitulated by a firm matrix that applies to firms in both the public and private sectors. Evolving ideas from cooperative games, activity analysis, and conditions for a cost-effective framework are set out. This research adopts a mathematical form that can be transformed into a decision support system vector. 
    <b>Design/</b>
    <b>Methodology</b>
    <b>/</b>
    <b>Approach</b>
    <b>:</b> This study employs an epistemological metrics-driven analysis to investigate the co-evolution between firms and payoffs. Three key dimensions were considered in capturing this dynamic relationship. First, we advocate for a metrics-driven approach to co-evolution, emphasizing its crucial role in anticipating and realizing payoffs. Second, we demonstrate that a single-lens perspective offers only a partial explanation of co-evolutions, particularly regarding synergy and payoff dynamics. Third, we integrate a metrics-driven approach with the moderating effects of game theory practices and activity analysis. This synthesis allows for the application of quantitative research methods to explore, recognize, and classify the nature of co-evolutions. 
    <b>Findings:</b> The findings indicate that organizations have unique preferences in terms of amalgamating synergies for re-engineering payoffs. This process is achieved by exploiting organizational strategic-renewal action such as managerial actions/intentionality of the organizations seems to describe unique internal behavioural patterns, the firm’s timing, and the frequency of those synergised but renewed critical actions. 
    <b>Practical</b>
    <b> </b>
    <b>Implications:</b> This research can positively impact an organization’s efficiency, innovation, employee satisfaction, competitive positioning, adaptability, and overall organizational performance. 
    <b>Research</b>
    <b> </b>
    <b>Limitations:</b> The limitations of this research are: 1) limited perspective as relying solely on internal capabilities, considering external factors can provide a more holistic understanding and prevent potential blind spots, and 2) increased complexity especially as it involves cross-functional teams and matrix arrangements. Complexity can create coordination challenges, communication gaps, and decision-making bottlenecks. 
    <b>Originality:</b>
    <b> </b>This research innovatively introduces a new organizational structure theory focusing on internal capabilities. The integration of cooperative games, activity analysis, and a cost-effective framework offers a unique perspective.
   </abstract>
   <kwd-group> 
    <kwd>
     Strategy
    </kwd> 
    <kwd>
      Cooperative Games
    </kwd> 
    <kwd>
      Organization Matrix
    </kwd> 
    <kwd>
      Evolution
    </kwd> 
    <kwd>
      Activity Analysis
    </kwd>
   </kwd-group>
  </article-meta>
 </front>
 <body>
  <sec id="s1">
   <title>1. Introduction</title>
   <p>This research paper examines two related features of the organization matrix. First, it is an archetypal structure (definition of archetypal structure required). It can be defined at many different levels of an organization. It applies to many different types of organizations. It has parallels in many other disciplines. It is capable of many different representations. It also exists in several different ontological spaces (what is ontological space source to develop knowledge and development). Second, it forms the basis of an evolutionary model. Evolution happens through coalition formation on the organization matrix. Most important the model explains how organizations gravitate to a state of self-ordered criticality in which evolution takes place <xref ref-type="bibr" rid="scirp.134293-27">
     (Morgan et al., 2023;
    </xref> <xref ref-type="bibr" rid="scirp.134293-20">
     Kumar &amp; Srivastava, 2023;
    </xref> <xref ref-type="bibr" rid="scirp.134293-45">
     Wang et al., 2023a;
    </xref> <xref ref-type="bibr" rid="scirp.134293-1">
     Adamou et al., 2021;
    </xref> <xref ref-type="bibr" rid="scirp.134293-2">
     Alford, 2017;
    </xref> <xref ref-type="bibr" rid="scirp.134293-13">
     Hamel &amp; Prahalad, 1990;
    </xref> <xref ref-type="bibr" rid="scirp.134293-28">
     Newman, 2008;
    </xref> <xref ref-type="bibr" rid="scirp.134293-39">
     Tlemsani &amp; Matthews, 2010)
    </xref>. In this paper, we only consider a cursory discussion of the ontological dimensions, limited to the extent to which it throws some light on the nature of human intervention (creativity and entrepreneurship) in the evolution of organizations. Furthermore, <xref ref-type="fig" rid="fig1">
     Figure 1
    </xref> demonstrates the key insights of this study.</p>
   <p>The organization matrix fosters the relationship of independence and interdependence between activities. Alternatively, it can be seen as an info set or as an interrelated set of payouts. Activities can be mapped into payoffs (fitness space), which in turn can be considered as signals or information. As such the organization matrix becomes an information processing system, similar to a large interconnected neural network <xref ref-type="bibr" rid="scirp.134293-3">
     (Amit et al., 1985)
    </xref>. The theory is used to provide a comprehensive model that will be used to examine existing practices in the evolution of organizations through coalition formation.</p>
   <fig id="fig1" position="float">
    <label>Figure 1</label>
    <caption>
     <title>Figure 1. Key insights of this paper. Source: Authors.</title>
    </caption>
    <graphic mimetype="image" position="float" xlink:type="simple" xlink:href="https://html.scirp.org/file/1502968-rId16.jpeg?20240702082907" />
   </fig>
   <p>Formally, the organization matrix can be defined as a matrix of potential payoffs (or information) a (a = [a<sub>jk</sub>]) or a matrix of potential activities A (A = [A<sub>jk</sub>]). We may think of activities, [A<sub>jk</sub>], as existing at the genotype level and payoffs, [a<sub>jk</sub>], as being phenotypes. Diagonal activities [A<sub>jk</sub>] (or in the payoff matrix [a<sub>jk</sub>]), in the organization matrix, that is elements where j = k, represent stand-alone activities (or payoffs from them), and off-diagonal elements [A<sub>jk</sub>] or [a<sub>jk</sub>] where j ≠ k represent linked activities (or payoffs from linked activities); that is synergies, complementarities or network effects. In terms of payouts the firm matrix is defined as:</p>
   <p>
    <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
      <mstyle mathvariant="bold" mathsize="normal"> 
       <mi>
         a 
       </mi> 
      </mstyle> 
      <mo>
        ≡ 
      </mo> 
      <mrow> 
       <mo>
         [ 
       </mo> 
       <mrow> 
        <msub> 
         <mi>
           a 
         </mi> 
         <mrow> 
          <mi>
            j 
          </mi> 
          <mi>
            k 
          </mi> 
         </mrow> 
        </msub> 
       </mrow> 
       <mo>
         ] 
       </mo> 
      </mrow> 
      <mo>
        ≡ 
      </mo> 
      <mrow> 
       <mo>
         [ 
       </mo> 
       <mrow> 
        <mtable> 
         <mtr> 
          <mtd> 
           <mrow> 
            <msub> 
             <mi>
               a 
             </mi> 
             <mrow> 
              <mn>
                11 
              </mn> 
             </mrow> 
            </msub> 
           </mrow> 
          </mtd> 
          <mtd> 
           <mrow> 
            <msub> 
             <mi>
               a 
             </mi> 
             <mrow> 
              <mn>
                12 
              </mn> 
             </mrow> 
            </msub> 
           </mrow> 
          </mtd> 
          <mtd> 
           <mrow> 
            <msub> 
             <mi>
               a 
             </mi> 
             <mrow> 
              <mn>
                13 
              </mn> 
             </mrow> 
            </msub> 
           </mrow> 
          </mtd> 
          <mtd> 
           <mo>
             ⋯ 
           </mo> 
          </mtd> 
          <mtd> 
           <mrow> 
            <msub> 
             <mi>
               a 
             </mi> 
             <mrow> 
              <mn>
                1 
              </mn> 
              <mi>
                N 
              </mi> 
             </mrow> 
            </msub> 
           </mrow> 
          </mtd> 
         </mtr> 
         <mtr> 
          <mtd> 
           <mrow> 
            <msub> 
             <mi>
               a 
             </mi> 
             <mrow> 
              <mn>
                21 
              </mn> 
             </mrow> 
            </msub> 
           </mrow> 
          </mtd> 
          <mtd> 
           <mrow> 
            <msub> 
             <mi>
               a 
             </mi> 
             <mrow> 
              <mn>
                22 
              </mn> 
             </mrow> 
            </msub> 
           </mrow> 
          </mtd> 
          <mtd> 
           <mrow> 
            <msub> 
             <mi>
               a 
             </mi> 
             <mrow> 
              <mn>
                23 
              </mn> 
             </mrow> 
            </msub> 
           </mrow> 
          </mtd> 
          <mtd> 
           <mo>
             ⋯ 
           </mo> 
          </mtd> 
          <mtd> 
           <mrow> 
            <msub> 
             <mi>
               a 
             </mi> 
             <mrow> 
              <mn>
                2 
              </mn> 
              <mi>
                N 
              </mi> 
             </mrow> 
            </msub> 
           </mrow> 
          </mtd> 
         </mtr> 
         <mtr> 
          <mtd> 
           <mrow> 
            <msub> 
             <mi>
               a 
             </mi> 
             <mrow> 
              <mn>
                31 
              </mn> 
             </mrow> 
            </msub> 
           </mrow> 
          </mtd> 
          <mtd> 
           <mrow> 
            <msub> 
             <mi>
               a 
             </mi> 
             <mrow> 
              <mn>
                32 
              </mn> 
             </mrow> 
            </msub> 
           </mrow> 
          </mtd> 
          <mtd> 
           <mrow> 
            <msub> 
             <mi>
               a 
             </mi> 
             <mrow> 
              <mn>
                33 
              </mn> 
             </mrow> 
            </msub> 
           </mrow> 
          </mtd> 
          <mtd> 
           <mo>
             ⋯ 
           </mo> 
          </mtd> 
          <mtd> 
           <mrow> 
            <msub> 
             <mi>
               a 
             </mi> 
             <mrow> 
              <mn>
                3 
              </mn> 
              <mi>
                N 
              </mi> 
             </mrow> 
            </msub> 
           </mrow> 
          </mtd> 
         </mtr> 
         <mtr> 
          <mtd> 
           <mo>
             ⋮ 
           </mo> 
          </mtd> 
          <mtd> 
           <mo>
             ⋮ 
           </mo> 
          </mtd> 
          <mtd> 
           <mo>
             ⋮ 
           </mo> 
          </mtd> 
          <mtd> 
           <mo>
             ⋱ 
           </mo> 
          </mtd> 
          <mtd> 
           <mo>
             ⋮ 
           </mo> 
          </mtd> 
         </mtr> 
         <mtr> 
          <mtd> 
           <mrow> 
            <msub> 
             <mi>
               a 
             </mi> 
             <mrow> 
              <mi>
                N 
              </mi> 
              <mn>
                1 
              </mn> 
             </mrow> 
            </msub> 
           </mrow> 
          </mtd> 
          <mtd> 
           <mrow> 
            <msub> 
             <mi>
               a 
             </mi> 
             <mrow> 
              <mi>
                N 
              </mi> 
              <mn>
                2 
              </mn> 
             </mrow> 
            </msub> 
           </mrow> 
          </mtd> 
          <mtd> 
           <mrow> 
            <msub> 
             <mi>
               a 
             </mi> 
             <mrow> 
              <mi>
                N 
              </mi> 
              <mn>
                3 
              </mn> 
             </mrow> 
            </msub> 
           </mrow> 
          </mtd> 
          <mtd> 
           <mo>
             ⋯ 
           </mo> 
          </mtd> 
          <mtd> 
           <mrow> 
            <msub> 
             <mi>
               a 
             </mi> 
             <mrow> 
              <mi>
                N 
              </mi> 
              <mi>
                N 
              </mi> 
             </mrow> 
            </msub> 
           </mrow> 
          </mtd> 
         </mtr> 
        </mtable> 
       </mrow> 
       <mo>
         ] 
       </mo> 
      </mrow> 
     </mrow> 
    </math> (1)</p>
   <p>Equally, for activities, we may well write down the right matrix as:</p>
   <p>
    <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
      <mstyle mathvariant="bold" mathsize="normal"> 
       <mi>
         A 
       </mi> 
      </mstyle> 
      <mo>
        ≡ 
      </mo> 
      <mrow> 
       <mo>
         [ 
       </mo> 
       <mrow> 
        <msub> 
         <mi>
           A 
         </mi> 
         <mrow> 
          <mi>
            j 
          </mi> 
          <mi>
            k 
          </mi> 
         </mrow> 
        </msub> 
       </mrow> 
       <mo>
         ] 
       </mo> 
      </mrow> 
     </mrow> 
    </math> (2)</p>
   <p>The distinction between potential and realised payoffs is important <xref ref-type="bibr" rid="scirp.134293-44">
     (Vancleef et al., 2021;
    </xref> <xref ref-type="bibr" rid="scirp.134293-47">
     Wilkinson et al., 2021)
    </xref> noted that potential payoffs are a mapping of activities into payoff space by forming coalitions. Realised payoffs are determined by decisions, first, about which coalitions to form (a mapping from potential payoffs in the organization matrix itself into potential payoffs from coalitions) and second, about cooperative behaviour within coalitions, which transforms potential into realised payoffs. If we limit ourselves to binary decisions in coalitions, cooperate or not, (1, 0 decisions), we have 2<sup>N</sup><sup>(</sup><sup>N</sup><sup> </sup><sup>−</sup><sup> </sup><sup>1)</sup> possibilities in terms of payoffs (2<sup>N</sup> coalitions and N − 1 decisions as to whether to cooperate within them). In this case, potential payoffs are achieved by choices ( 
    <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
      <msub> 
       <mi>
         θ 
       </mi> 
       <mi>
         k 
       </mi> 
      </msub> 
      <mo>
        , 
      </mo> 
      <msub> 
       <mi>
         θ 
       </mi> 
       <mi>
         j 
       </mi> 
      </msub> 
      <mo>
        ∈ 
      </mo> 
      <mn>
        0 
      </mn> 
      <mo>
        , 
      </mo> 
      <mn>
        1 
      </mn> 
     </mrow> 
    </math>) where the connection between payoffs and choices provides an increase to the underlying equation:</p>
   <p>
    <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
      <msub> 
       <mrow> 
        <mrow> 
         <mo>
           [ 
         </mo> 
         <mrow> 
          <msub> 
           <mi>
             a 
           </mi> 
           <mrow> 
            <mi>
              k 
            </mi> 
            <mi>
              j 
            </mi> 
           </mrow> 
          </msub> 
         </mrow> 
         <mo>
           ] 
         </mo> 
        </mrow> 
       </mrow> 
       <mrow> 
        <mtext>
          potential 
        </mtext> 
       </mrow> 
      </msub> 
      <mo>
        ~ 
      </mo> 
      <mrow> 
       <mo>
         [ 
       </mo> 
       <mrow> 
        <msub> 
         <mi>
           θ 
         </mi> 
         <mi>
           k 
         </mi> 
        </msub> 
        <msub> 
         <mi>
           θ 
         </mi> 
         <mi>
           j 
         </mi> 
        </msub> 
       </mrow> 
       <mo>
         ] 
       </mo> 
      </mrow> 
     </mrow> 
    </math> (3)</p>
   <p>The illustration for accomplished payoffs as of the choices is:</p>
   <p>
    <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
      <mi>
        Z 
      </mi> 
      <mrow> 
       <mo>
         ( 
       </mo> 
       <mrow> 
        <mi>
          A 
        </mi> 
        <mo>
          , 
        </mo> 
        <mi>
          θ 
        </mi> 
        <mo>
          , 
        </mo> 
        <mi>
          t 
        </mi> 
       </mrow> 
       <mo>
         ) 
       </mo> 
      </mrow> 
      <mo>
        ≡ 
      </mo> 
      <msub> 
       <mrow> 
        <mrow> 
         <mo>
           [ 
         </mo> 
         <mrow> 
          <msub> 
           <mi>
             a 
           </mi> 
           <mrow> 
            <mi>
              k 
            </mi> 
            <mi>
              j 
            </mi> 
           </mrow> 
          </msub> 
         </mrow> 
         <mo>
           ] 
         </mo> 
        </mrow> 
       </mrow> 
       <mrow> 
        <mtext>
          realised 
        </mtext> 
       </mrow> 
      </msub> 
      <mo>
        = 
      </mo> 
      <mstyle displaystyle="true"> 
       <munder> 
        <mo>
          ∑ 
        </mo> 
        <mrow> 
         <mi>
           k 
         </mi> 
         <mo>
           , 
         </mo> 
         <mi>
           j 
         </mi> 
         <mo>
           ∈ 
         </mo> 
         <mi>
           N 
         </mi> 
        </mrow> 
       </munder> 
       <mrow> 
        <msub> 
         <mi>
           a 
         </mi> 
         <mrow> 
          <mi>
            k 
          </mi> 
          <mi>
            j 
          </mi> 
         </mrow> 
        </msub> 
        <msub> 
         <mi>
           θ 
         </mi> 
         <mi>
           k 
         </mi> 
        </msub> 
        <msub> 
         <mi>
           θ 
         </mi> 
         <mi>
           j 
         </mi> 
        </msub> 
       </mrow> 
      </mstyle> 
     </mrow> 
    </math> ( 
    <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
      <msub> 
       <mi>
         θ 
       </mi> 
       <mi>
         k 
       </mi> 
      </msub> 
      <mo>
        , 
      </mo> 
      <msub> 
       <mi>
         θ 
       </mi> 
       <mi>
         j 
       </mi> 
      </msub> 
      <mo>
        ∈ 
      </mo> 
      <mn>
        0 
      </mn> 
      <mo>
        , 
      </mo> 
      <mn>
        1 
      </mn> 
     </mrow> 
    </math>, 
    <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
      <mi>
        j 
      </mi> 
      <mo>
        , 
      </mo> 
      <mi>
        k 
      </mi> 
      <mo>
        = 
      </mo> 
      <mn>
        1 
      </mn> 
      <mo>
        , 
      </mo> 
      <mn>
        2 
      </mn> 
      <mo>
        , 
      </mo> 
      <mo>
        ⋯ 
      </mo> 
      <mo>
        , 
      </mo> 
      <mi>
        N 
      </mi> 
     </mrow> 
    </math>) (4)</p>
   <p>The organization matrix in (1) is a complex system consisting of large numbers of interacting variables. Together with decisions on the right-hand side of (3) and (4), it becomes a complex adaptive system <xref ref-type="bibr" rid="scirp.134293-8">
     (Barbrook, 2019;
    </xref> <xref ref-type="bibr" rid="scirp.134293-10">
     Collander, 2000)
    </xref>. Negotiating a coalitional game, where agents form expectations, anticipate and develop models to understand and influence how payoffs can be realised and distributed. The organization matrix can be represented in many different ways, for example, as a landscape, a network, a coalitional game, or a spin glass. It can also be thought of as an information network consisting of neurons interconnected by synaptic junctions of potential strength [aik]. In this case decisions (θ<sub>j</sub>, θ<sub>k</sub>) can take on two possible states (up, down ) indicating whether the neuron has fired an electrochemical signal or not. Therefore, coalition formation and search represent the transmission of information through activities or payoffs and organisational learning processes <xref ref-type="bibr" rid="scirp.134293-25">
     (Mohamed Hashim et al., 2022b, 2024)
    </xref>.</p>
   <p>As coalitions are built up a landscape of potential payoffs is formed conceptually the landscape is a mapping of all possible (2<sup>N</sup>) coalitions of activities into fitness or payoff space <xref ref-type="bibr" rid="scirp.134293-33">
     (Tanushree &amp; Chaubey, 2023)
    </xref>. The organization matrix can also be envisaged as a network, with nodes corresponding to diagonal elements and connections to synergies. The principal management task is to convert the potential payoffs into actual payoffs by making connections between nodes (converting off-diagonal potential payoffs into realised payoffs). With a suitable transformation, the organization matrix becomes a game with payoffs corresponding to costs and benefits from cooperation. The distinction between potential and realised payoffs is important: to a great extent, it defines the management role <xref ref-type="bibr" rid="scirp.134293-22">
     (Liu et al., 2023)
    </xref>. A second feature (in addition to its archetypal structure) of the matrix is its evolutionary properties through forming and reforming coalitions (changing coalition structure) on the organization matrix. This research paper aims to examine the following:</p>
   <p>1) The evolution of organizations through coalition formation.</p>
   <p>2) Changes at the many hierarchical levels of an organization (ranging from the micro-level, small teams within organizations, to entire organizations and economic systems).</p>
   <p>3) Organizational gravitation to an attractor of self-organized criticality, a situation where evolutionary possibilities exist<sup>1</sup>.</p>
   <p>The organizational environment E(t) acts as an outer dynamic, a kind of Darwinian selection process. The organizational or business environment consists of all the factors that influence an organization but which are beyond the organization’s control. Inner dynamics A<sub>jk</sub>(t) and θ<sub>j</sub>θ<sub>k</sub>(t) represented in (3) are illustrated on the abscissa of the strategy triangle in <xref ref-type="fig" rid="fig2">
     Figure 2
    </xref>. New activities are discovered over time, and decisions about coalitions and cooperation are revised to fit the changes in the business environment. Thus, <xref ref-type="fig" rid="fig2">
     Figure 2
    </xref> illustrates strategic decisions as a search process resulting in a trajectory of potential (and realised) payoffs over time. Evolution happens through the action of two sets of factors illustrated in <xref ref-type="fig" rid="fig2">
     Figure 2
    </xref>:</p>
   <p>
    <xref ref-type="bibr" rid="scirp.134293-"></xref>1) Outer dynamics: The environment of organizations E(t) interacting with decisions θ<sub>j</sub>θ<sub>k</sub>(t) and activities A<sub>jk</sub>(t).</p>
   <p>2) Inner dynamics: The fractal structure of the organization matrix is viewed as a hierarchy of activities interacting with decisions.</p>
   <fig id="fig2" position="float">
    <label>Figure 2</label>
    <caption>
     <title>Figure 2. Triangular model of strategic analysis: Source: Authors.</title>
    </caption>
    <graphic mimetype="image" position="float" xlink:type="simple" xlink:href="https://html.scirp.org/file/1502968-rId33.jpeg?20240702082907" />
   </fig>
   <p>As illustrated in <xref ref-type="fig" rid="fig2">
     Figure 2
    </xref>, the impact of the business environment on organizations is filtered through organizational grammar. Internally, both the scope of the search for new coalitions and the behaviour (cooperative or not) of agents in coalitions is conditioned by an organizational grammar, a set of rules or control parameters (formal, informal internal and external, operating at the social and personal level) existing at a point in time. Elements of grammar form a complex adaptive system, interacting both among themselves and with the other factors in the model illustrated in <xref ref-type="fig" rid="fig1">
     Figure 1
    </xref>.</p>
   <p>Organizational grammar, together with the fractal hierarchical structure and pressures from the environment push organizations towards the state of self-ordered criticality envisaged by <xref ref-type="bibr" rid="scirp.134293-32">
     (Shaymardanov et al., 2023;
    </xref> <xref ref-type="bibr" rid="scirp.134293-17">
     Hyunmin, 2023;
    </xref> <xref ref-type="bibr" rid="scirp.134293-5">
     Arstila, 2018;
    </xref> <xref ref-type="bibr" rid="scirp.134293-23">
     Mohamed Hashim et al., 2022a;
    </xref> <xref ref-type="bibr" rid="scirp.134293-6">
     Bak, 1997;
    </xref> <xref ref-type="bibr" rid="scirp.134293-7">
     Bak, Tang, &amp; Weisenfeld, 1988)
    </xref> in which evolution takes place. Evolution is seen as a continuous process, especially at microscopic levels of the organization matrix. Larger and larger changes become less and less frequent as we ascend the macroscopic scale, from projects to businesses, to organizations and whole social systems: but the relationship between the size of changes and frequency is statistical.</p>
   <p>The evolution of organizations through dynamics capability and coalition formation has several potential research contributions. Here are some key research contributions in this area:</p>
   <p>1) Understanding organizational change: Contributes to our understanding of how organizations evolve and change over time. By studying how coalitions form, dissolve, and reconfigure within organizations, researchers can gain insights into the dynamics of organizational change. This research helps identify the underlying mechanisms and processes that drive organizational evolution.</p>
   <p>2) Informing leadership and strategy: By investigating the factors that influence the formation and dynamics of coalitions, researchers can provide guidance for leaders on how to effectively manage coalitions, build alliances, and navigate complex organizational networks. This research can inform strategic choices, organizational design, and leadership development practices.</p>
   <p>These contributions contribute to a more comprehensive understanding of how organizations function and evolve in today’s complex and dynamic business environment. The research gaps in this subject matter are:</p>
   <p>1) One research gap could be exploring how coalitions evolve and change over time within organizations. This could involve studying the factors that influence coalition formation, how they dissolve or reconfigure, and the consequences of these changes on organizational outcomes.</p>
   <p>2) Coalition formation strategies: Research could focus on identifying and examining the strategies employed by organizations to form and manage coalitions effectively. This could include studying the role of leadership, communication, resource allocation, and organizational culture in facilitating successful coalition formation and evolution.</p>
   <p>3) Performance and outcomes: Exploring the relationship between coalition formation and organizational performance is another research gap. Investigating the impact of coalitions on various performance indicators, such as innovation, productivity, and financial outcomes, can provide insights into the effectiveness of coalition-based organizational evolution <xref ref-type="bibr" rid="scirp.134293-43">
     (Tlemsani et al., 2023c)
    </xref>.</p>
   <p>4) Success and failure of coalitions: A further research gap could be examining the success and failure of coalitions within organizations. This could involve analysing the factors that lead to the successful formation and maintenance of coalitions, as well as the reasons why some coalitions fail. Additionally, the research could investigate the impact of coalition success or failure on the overall evolution of organizations, including their adaptability to changing internal and external conditions.</p>
   <p>This research critically examines how the internal capabilities, the synergies and its integrations have a say on payoff. It analyses the empirical association between the firms’ competitive capabilities and the payoffs/values. The payoff results are interpreted by firm metrics using the data derived from both the public and private sectors. A metrics-driven epistemological analysis sheds light on the co-evolution and the payoff using three distinct dimensions. This combination allows for the application of quantitative research methods. The findings signal that organizations have unique inclinations in terms of amalgamating synergies for re-engineering payoffs.</p>
   <p>This research has significant implications for fostering adequate levels of organization efficiency, innovation, employee satisfaction, competitive positioning, adaptability, and overall organizational performance. Finally, the novelty of this research leads to a new organizational structure theory and an innovative perspective focusing on internal capabilities.</p>
  </sec><sec id="s2">
   <title>2. Activities and Payoffs</title>
   <p>The co-evolutionary theory argues that the concurrent operating procedure of the organization and selection (priority) of activities explains the process of renewal of co-evolution <xref ref-type="bibr" rid="scirp.134293-49">
     (Xiao et al., 2023;
    </xref> <xref ref-type="bibr" rid="scirp.134293-18">
     Joshua et al., 2023;
    </xref> <xref ref-type="bibr" rid="scirp.134293-34">
     Tlemsani, 2010, 2019)
    </xref>. There is a necessity to treat strategic actions aligned with the organizational competencies within the business environmental boundaries to build advantages. Thus, proposed propositions/strategic renewal definitions metrics, which empirically connect organizational synergies and payoffs amid practices of game theories and activity analysis and conditions.</p>
   <p>
    <xref ref-type="bibr" rid="scirp.134293-"></xref>We can see the organization matrix as a complex adaptive system with many interacting agents and activities <xref ref-type="bibr" rid="scirp.134293-46">
     (Wang et al., 2023b;
    </xref> <xref ref-type="bibr" rid="scirp.134293-21">
     Lang et al., 2021;
    </xref> <xref ref-type="bibr" rid="scirp.134293-48">
     Xiao et al., 2021;
    </xref> <xref ref-type="bibr" rid="scirp.134293-24">
     Mohamed Hashim et al., 2021;
    </xref> <xref ref-type="bibr" rid="scirp.134293-1">
     Adamou et al., 2021)
    </xref>. Returning to the theatre metaphor, interactions may be local, confined to sub-coalitions (marginal changes to the score, cloakroom arrangements, ticketing), or they may percolate throughout the whole theatre (changes in the cast, the programme, the entire genre, or discourse). They may be confined to the theatre or extend to the whole environment. Changes may emanate from activities and decisions anywhere within the theatre or stakeholder group (inner dynamics), or they may be triggered from the outside (outer dynamics). Change may be a variation upon earlier productions, or they have emergent properties, novelty, or new creations. Generally, we might expect marginal changes to be frequent, even continuous, and dramatic changes intermittent and infrequent <xref ref-type="bibr" rid="scirp.134293-36">
     (Tlemsani, 2020)
    </xref>. On the organization matrix, activities produced at one level are combined and transformed (consumed) and become inputs at another. They are in turn, combined and transformed at successive levels until they extend in scope to economy-wide institutions and organizations.</p>
   <p>Coalitions formed at one level of the organizational hierarchy become diagonal elements in the organization matrix at a higher level. Similarly, stand-alone activities (diagonal elements) at one level of the organization matrix are made up of collections (coalitions) of lower-level activities. Coalitions are in turn formed at this higher level and make up diagonal elements at a still higher level. Denoting 
    <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
      <mrow> 
       <mo>
         [ 
       </mo> 
       <mrow> 
        <msubsup> 
         <mi>
           C 
         </mi> 
         <mrow> 
          <mi>
            j 
          </mi> 
          <mi>
            k 
          </mi> 
         </mrow> 
         <mi>
           i 
         </mi> 
        </msubsup> 
       </mrow> 
       <mo>
         ] 
       </mo> 
      </mrow> 
     </mrow> 
    </math> as a coalition structure, we have a (set of) supply chain relationship <xref ref-type="bibr" rid="scirp.134293-50">
     (Yang et al., 2021;
    </xref> <xref ref-type="bibr" rid="scirp.134293-16">
     Hota, 2023;
    </xref> <xref ref-type="bibr" rid="scirp.134293-4">
     Anjali et al., 2023)
    </xref>:</p>
   <p>
    <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mtable columnalign="left"> 
      <mtr> 
       <mtd> 
        <mrow> 
         <mo>
           [ 
         </mo> 
         <mrow> 
          <msup> 
           <mi>
             A 
           </mi> 
           <mi>
             m 
           </mi> 
          </msup> 
         </mrow> 
         <mo>
           ] 
         </mo> 
        </mrow> 
        <mo>
          → 
        </mo> 
        <msub> 
         <mrow> 
          <mo>
            [ 
          </mo> 
          <mrow> 
           <msubsup> 
            <mi>
              C 
            </mi> 
            <mrow> 
             <mi>
               j 
             </mi> 
             <mi>
               k 
             </mi> 
            </mrow> 
            <mrow> 
             <mi>
               m 
             </mi> 
             <mo>
               − 
             </mo> 
             <mn>
               1 
             </mn> 
            </mrow> 
           </msubsup> 
          </mrow> 
          <mo>
            ] 
          </mo> 
         </mrow> 
         <mrow> 
          <mtext>
            only 
          </mtext> 
          <mtext>
              
          </mtext> 
          <mi>
            j 
          </mi> 
          <mo>
            = 
          </mo> 
          <mi>
            k 
          </mi> 
         </mrow> 
        </msub> 
        <mo>
          → 
        </mo> 
        <msub> 
         <mrow> 
          <mo>
            [ 
          </mo> 
          <mrow> 
           <msubsup> 
            <mi>
              A 
            </mi> 
            <mrow> 
             <mi>
               j 
             </mi> 
             <mi>
               k 
             </mi> 
            </mrow> 
            <mrow> 
             <mi>
               m 
             </mi> 
             <mo>
               − 
             </mo> 
             <mn>
               1 
             </mn> 
            </mrow> 
           </msubsup> 
          </mrow> 
          <mo>
            ] 
          </mo> 
         </mrow> 
         <mrow> 
          <mtext>
            all 
          </mtext> 
          <mtext>
              
          </mtext> 
          <mi>
            j 
          </mi> 
          <mi>
            k 
          </mi> 
         </mrow> 
        </msub> 
        <mo>
          → 
        </mo> 
        <msub> 
         <mrow> 
          <mo>
            [ 
          </mo> 
          <mrow> 
           <msubsup> 
            <mi>
              C 
            </mi> 
            <mrow> 
             <mi>
               l 
             </mi> 
             <mi>
               p 
             </mi> 
            </mrow> 
            <mrow> 
             <mi>
               m 
             </mi> 
             <mo>
               − 
             </mo> 
             <mn>
               2 
             </mn> 
            </mrow> 
           </msubsup> 
          </mrow> 
          <mo>
            ] 
          </mo> 
         </mrow> 
         <mrow> 
          <mtext>
            only 
          </mtext> 
          <mtext>
              
          </mtext> 
          <mi>
            l 
          </mi> 
          <mo>
            = 
          </mo> 
          <mi>
            p 
          </mi> 
         </mrow> 
        </msub> 
        <mo>
          → 
        </mo> 
        <msub> 
         <mrow> 
          <mo>
            [ 
          </mo> 
          <mrow> 
           <msup> 
            <mi>
              A 
            </mi> 
            <mrow> 
             <mi>
               m 
             </mi> 
             <mo>
               − 
             </mo> 
             <mn>
               2 
             </mn> 
            </mrow> 
           </msup> 
           <msub> 
            <mrow></mrow> 
            <mrow> 
             <mi>
               l 
             </mi> 
             <mi>
               p 
             </mi> 
            </mrow> 
           </msub> 
          </mrow> 
          <mo>
            ] 
          </mo> 
         </mrow> 
         <mrow> 
          <mtext>
            all 
          </mtext> 
          <mtext>
              
          </mtext> 
          <mi>
            l 
          </mi> 
          <mi>
            p 
          </mi> 
         </mrow> 
        </msub> 
       </mtd> 
      </mtr> 
      <mtr> 
       <mtd> 
        <mo>
          → 
        </mo> 
        <mo>
          ⋯ 
        </mo> 
        <mo>
          → 
        </mo> 
        <msub> 
         <mrow> 
          <mo>
            [ 
          </mo> 
          <mrow> 
           <msubsup> 
            <mi>
              C 
            </mi> 
            <mrow> 
             <mi>
               r 
             </mi> 
             <mi>
               s 
             </mi> 
            </mrow> 
            <mn>
              2 
            </mn> 
           </msubsup> 
          </mrow> 
          <mo>
            ] 
          </mo> 
         </mrow> 
         <mrow> 
          <mtext>
            only 
          </mtext> 
          <mtext>
              
          </mtext> 
          <mi>
            r 
          </mi> 
          <mo>
            = 
          </mo> 
          <mi>
            s 
          </mi> 
         </mrow> 
        </msub> 
        <mo>
          → 
        </mo> 
        <msub> 
         <mrow> 
          <mo>
            [ 
          </mo> 
          <mrow> 
           <msubsup> 
            <mi>
              A 
            </mi> 
            <mrow> 
             <mi>
               r 
             </mi> 
             <mi>
               s 
             </mi> 
            </mrow> 
            <mn>
              2 
            </mn> 
           </msubsup> 
          </mrow> 
          <mo>
            ] 
          </mo> 
         </mrow> 
         <mrow> 
          <mi>
            a 
          </mi> 
          <mi>
            l 
          </mi> 
          <mi>
            l 
          </mi> 
          <mtext> 
          </mtext> 
          <mi>
            r 
          </mi> 
          <mi>
            s 
          </mi> 
         </mrow> 
        </msub> 
        <mo>
          → 
        </mo> 
        <msub> 
         <mrow> 
          <mo>
            [ 
          </mo> 
          <mrow> 
           <msup> 
            <mi>
              C 
            </mi> 
            <mn>
              1 
            </mn> 
           </msup> 
          </mrow> 
          <mo>
            ] 
          </mo> 
         </mrow> 
         <mrow> 
          <mtext>
            only 
          </mtext> 
          <mtext>
              
          </mtext> 
          <mi>
            t 
          </mi> 
          <mo>
            = 
          </mo> 
          <mi>
            v 
          </mi> 
         </mrow> 
        </msub> 
        <mo>
          → 
        </mo> 
        <msub> 
         <mrow> 
          <mo>
            [ 
          </mo> 
          <mrow> 
           <msup> 
            <mi>
              A 
            </mi> 
            <mn>
              1 
            </mn> 
           </msup> 
          </mrow> 
          <mo>
            ] 
          </mo> 
         </mrow> 
         <mrow> 
          <mtext>
            all 
          </mtext> 
          <mtext>
              
          </mtext> 
          <mi>
            t 
          </mi> 
          <mi>
            v 
          </mi> 
         </mrow> 
        </msub> 
       </mtd> 
      </mtr> 
      <mtr> 
       <mtd> 
        <mtext>
          and 
        </mtext> 
        <mtext>
            
        </mtext> 
        <mtext>
          generally 
        </mtext> 
        <mo>
          , 
        </mo> 
        <mtext>
            
        </mtext> 
        <mi>
          m 
        </mi> 
        <mo>
          ≥ 
        </mo> 
        <mi>
          m 
        </mi> 
        <mo>
          − 
        </mo> 
        <mtext>
          1 
        </mtext> 
        <mo>
          ≥ 
        </mo> 
        <mo>
          ⋯ 
        </mo> 
        <mo>
          ≥ 
        </mo> 
        <mtext>
          1 
        </mtext> 
       </mtd> 
      </mtr> 
     </mtable> 
    </math> (5)<sup>2</sup></p>
   <p>Leaner regression of coalitions formed at the organisational hierarchical level is mentioned above and discusses the coalitions of basic activities A<sup>m</sup> are formed at successively higher and higher levels of the organization matrix. This is illustrated in (5). The matrix of fundamental activities A<sup>i</sup> is partitioned into coalitions 
    <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
      <msubsup> 
       <mi>
         C 
       </mi> 
       <mrow> 
        <mi>
          j 
        </mi> 
        <mi>
          k 
        </mi> 
       </mrow> 
       <mrow> 
        <mi>
          m 
        </mi> 
        <mo>
          − 
        </mo> 
        <mn>
          1 
        </mn> 
       </mrow> 
      </msubsup> 
     </mrow> 
    </math>. New coalition possibilities may emerge (off-diagonal elements as 
    <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
      <msubsup> 
       <mi>
         A 
       </mi> 
       <mrow> 
        <mi>
          j 
        </mi> 
        <mi>
          k 
        </mi> 
       </mrow> 
       <mrow> 
        <mi>
          m 
        </mi> 
        <mo>
          − 
        </mo> 
        <mn>
          1 
        </mn> 
       </mrow> 
      </msubsup> 
     </mrow> 
    </math>). These may be combined into the coalition 
    <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
      <msubsup> 
       <mi>
         C 
       </mi> 
       <mrow> 
        <mi>
          l 
        </mi> 
        <mi>
          p 
        </mi> 
       </mrow> 
       <mrow> 
        <mi>
          m 
        </mi> 
        <mo>
          − 
        </mo> 
        <mn>
          2 
        </mn> 
       </mrow> 
      </msubsup> 
     </mrow> 
    </math>. If we represent the chain in (5) as payoffs from activities, diagonal elements represent the surplus (or value-added) by lower-level coalitions. Off-diagonal elements represent gains to be had from further coalition building. It is useful to consider payoffs as the sum of value added at successive coalition levels.</p>
   <p>As noted above, payoffs represent the potential energy of activities, and they remain simply a possibility till they are activated by decisions. Once created, they can be supplied in several methods to stakeholders (decision-making agents). One such solution to the distribution problem is the Shapley value, which is arrived at by attributing to every activity the value it adds (through synergy or complementarity) to its own coalition<sup>3</sup>. They are the surplus of benefits over costs (with respect to the entire stakeholder group) that are created by organizations. They include tangible and intangible benefits (and costs) that can be distributed to stakeholders in any number of ways. The interpretation of the surplus in terms of transferable payoffs extends the generality of the organization matrix: discussion of agency issues includes the entire stakeholder group. Unless organizations create a surplus for stakeholders, they cease to be viable and in an evolutionary system, they will be selected out sooner or later.</p>
   <p>Transformation of the organization matrix into a coalitional game can result in many different payoff structures. If off-diagonal elements are positive, then the coalitional game will be a positive sum, giving aggregate benefits from cooperation but payoff structures may be such to discourage cooperation thereby inhibiting the realisation of payoffs from coalition formation.</p>
   <p>Decisions about coalition formation on the organization matrix are taken by stakeholders who have competing objectives: a desire to increase payoffs in general (growth) and a desire to increase the share, the absolute amount (distribution) of payoffs accruing to themselves. So, the search is subject to mixed motivations <xref ref-type="bibr" rid="scirp.134293-41">
     (Tlemsani et al., 2023a)
    </xref>. Clearly, it may be in the interest of stakeholder groups to pursue strategies that benefit them at the expense of others. Decisions (θ<sub>j</sub>, θ<sub>k</sub>) can be symbolised by strings of zeros and ones, indicating stakeholders who participate (1’s) in particular coalitions and who do not (0’s). Corresponding to the tiers of the theatre, there are tiers (or hierarchies) of decisions to be made about participation within coalitions. Agents might, for example, decide to join a coalition but not participate in some of its activities. Agent X may hire Y as part of the orchestra (a joint decision). X’s participation as part of the orchestra is partly hard-wired (by the score) and partly volitional (rehearsing, practicing, and helping other members). In general cooperation within organizations is conditioned by (internal) grammar. Formal grammar (treaties, contracts, and agreements) are attempts to hardwire certain behaviour into organizations. Often informal aspects are significant.</p>
   <p>Typically, partnerships of all kinds, ranging from minor restructuring within an organization to alliances and mergers between them, are arranged by (senior) managers, but success in realising potential is contingent upon decisions within sub-coalitions(transformation/integration coalition). Often strategy is mistakenly distinguished from implementation because only top-level decisions are considered <xref ref-type="bibr" rid="scirp.134293-42">
     (Tlemsani et al., 2023b)
    </xref>. The realisation of potential payoffs is determined by sets of coalitions within coalitions and decisions within decisions. In illustration (5) for example, if we consider the organization matrix (at level m-2), 
    <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
      <msub> 
       <mrow> 
        <mrow> 
         <mo>
           [ 
         </mo> 
         <mrow> 
          <msubsup> 
           <mi>
             A 
           </mi> 
           <mrow> 
            <mi>
              l 
            </mi> 
            <mi>
              p 
            </mi> 
           </mrow> 
           <mrow> 
            <mi>
              m 
            </mi> 
            <mo>
              − 
            </mo> 
            <mtext>
              2 
            </mtext> 
           </mrow> 
          </msubsup> 
         </mrow> 
         <mo>
           ] 
         </mo> 
        </mrow> 
       </mrow> 
       <mrow> 
        <mtext>
          all 
        </mtext> 
        <mtext>
            
        </mtext> 
        <mi>
          l 
        </mi> 
        <mi>
          p 
        </mi> 
       </mrow> 
      </msub> 
     </mrow> 
    </math>, realisation of payoffs depends on what happens in the coalition 
    <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
      <msub> 
       <mrow> 
        <mrow> 
         <mo>
           [ 
         </mo> 
         <mrow> 
          <msubsup> 
           <mi>
             C 
           </mi> 
           <mrow> 
            <mi>
              l 
            </mi> 
            <mi>
              p 
            </mi> 
           </mrow> 
           <mrow> 
            <mi>
              m 
            </mi> 
            <mo>
              − 
            </mo> 
            <mn>
              2 
            </mn> 
           </mrow> 
          </msubsup> 
         </mrow> 
         <mo>
           ] 
         </mo> 
        </mrow> 
       </mrow> 
       <mrow> 
        <mtext>
          only 
        </mtext> 
        <mtext>
            
        </mtext> 
        <mi>
          l 
        </mi> 
        <mo>
          = 
        </mo> 
        <mi>
          p 
        </mi> 
       </mrow> 
      </msub> 
     </mrow> 
    </math> which contains the coalitions it is composed of, summarised by 
    <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
      <msub> 
       <mrow> 
        <mrow> 
         <mo>
           [ 
         </mo> 
         <mrow> 
          <msubsup> 
           <mi>
             C 
           </mi> 
           <mrow> 
            <mi>
              j 
            </mi> 
            <mi>
              k 
            </mi> 
           </mrow> 
           <mrow> 
            <mi>
              m 
            </mi> 
            <mo>
              − 
            </mo> 
            <mn>
              1 
            </mn> 
           </mrow> 
          </msubsup> 
         </mrow> 
         <mo>
           ] 
         </mo> 
        </mrow> 
       </mrow> 
       <mrow> 
        <mtext>
          only 
        </mtext> 
        <mtext>
            
        </mtext> 
        <mi>
          j 
        </mi> 
        <mo>
          = 
        </mo> 
        <mi>
          k 
        </mi> 
       </mrow> 
      </msub> 
     </mrow> 
    </math>: in turn, the latter contains, 
    <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
      <msub> 
       <mrow> 
        <mrow> 
         <mo>
           [ 
         </mo> 
         <mrow> 
          <msubsup> 
           <mi>
             C 
           </mi> 
           <mrow> 
            <mi>
              j 
            </mi> 
            <mi>
              k 
            </mi> 
           </mrow> 
           <mrow> 
            <mi>
              m 
            </mi> 
            <mo>
              − 
            </mo> 
            <mn>
              1 
            </mn> 
           </mrow> 
          </msubsup> 
         </mrow> 
         <mo>
           ] 
         </mo> 
        </mrow> 
       </mrow> 
       <mrow> 
        <mtext>
          only 
        </mtext> 
        <mtext>
            
        </mtext> 
        <mi>
          j 
        </mi> 
        <mo>
          = 
        </mo> 
        <mi>
          k 
        </mi> 
       </mrow> 
      </msub> 
     </mrow> 
    </math> and the elementary matrix [A<sup>m</sup>]. Expression (5) contains the instructions for building the fractal structure of the organization matrix.</p>
   <p>Activities and information constitute the underlying genotype, or information storage space and payoffs are the phenotypes the observable behavioural traits. As with genetic variations, the relationship between activities and payoffs is not static and therefore difficult to predict. One activity (or coalition) may affect several different types of payoff (pleiotropy) and a particular type of payoff may be affected by several activities simultaneously (polygeny) for example, businesses are made up of sets or sub-coalitions of functional activities, which in turn are made up of coalitions of departments, teams and formal and informal groups: each can be represented in matrix form as self-similar motifs of interdependence and independence.</p>
   <p>The strategy and structure of businesses are in turn affected by how they perform in terms of payoffs: some sub-coalitions may be expanded, others contracted, and new coalitions formed to adjust organizational targets in terms of markets, products or technologies. Similarly, payoffs interact with one another; for example, feedback occurs between market share, investment and growth and variables such as sales, revenue, and profit).</p>
  </sec><sec id="s3">
   <title>3. Coalitions and Coalition Structures</title>
   <p>We should distinguish between the organization matrix in general (non-partitioned) sense itself and coalitions, which are partitions of the matrix, made up of subsets of interdependent activities listed in an array on the organization matrix. Activities are merged into coalitions because of decisions characterized by dual strings (0’s and 1’s), suggesting both cooperation and non-cooperation within coalitions.</p>
   <p>Coalitions are essential to cope with the MACRO environmental changes and their influences on internal capabilities. Coalitions are formed by stakeholders who search the organization matrix to find new groupings of activities to develop new markets, products, new organizational forms, and structures. At the macro level coalitions take obvious forms: mergers, acquisitions, alliances, and partnerships. They extend backward, forward, and laterally in the supply chain. They may result in the formation of entirely new technologies, firms, and industries and the elimination of others. At the micro-level, coalitions develop new products, markets, and processes, resulting from the search of the organization matrix at the appropriate level for combinations of activities that will enable this to happen. Coalitions extend beyond the boundaries of the matrix as new activities are discovered.</p>
   <sec id="s3_1">
    <title>3.1. A Non-Hierarchical Organization Matrix</title>
    <p>Given an organization matrix defined in terms of activities, A (A = [A<sub>ik</sub>], 
     <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
       <mi>
         i 
       </mi> 
       <mo>
         , 
       </mo> 
       <mi>
         k 
       </mi> 
       <mo>
         = 
       </mo> 
       <mn>
         1 
       </mn> 
       <mo>
         , 
       </mo> 
       <mn>
         2 
       </mn> 
       <mo>
         , 
       </mo> 
       <mo>
         ⋯ 
       </mo> 
       <mo>
         , 
       </mo> 
       <mi>
         N 
       </mi> 
      </mrow> 
     </math>), decisions to form a coalition are expressed by a string (vector) of 1’s and 0’s. So, in an organization matrix of 10 potential activities, a string with 1 in the first, third, fourth, and tenth places (1:0:1:1:0:0:0:0:0:1) represents a four-member coalition made up of activities 1, 3, 4, and 10.</p>
    <p>Coalition structures are groups of coalitions. For example, consider an organization consisting of just four activities. If each activity operates as a set of four independent entities, the coalition structure consists of a string of coalitions (1000, 0100, 0010, 0001). If it consists of two coalitions each with two members the coalition structure may be (1100, 0011) or (0101, 1010). In the case of a four-member coalition the coalition and the coalition structure are formally identical (1111). The relationship between coalitions and coalition structures is summarized in <xref ref-type="table" rid="table1">
      Table 1
     </xref> for an organization matrix with four activities. In general, with N activities there are 2<sup>N</sup> possible coalitions: so when there are 4 activities, 16 possible coalitions exist, as shown in Column 3 of <xref ref-type="table" rid="table1">
      Table 1
     </xref>: associated coalition structures are listed in Column 4 of <xref ref-type="table" rid="table1">
      Table 1
     </xref>.</p>
    <table-wrap id="table1">
     <label>
      <xref ref-type="table" rid="table1">
       Table 1
      </xref></label>
     <caption>
      <title>
       <xref ref-type="bibr" rid="scirp.134293-"></xref>Table 1. Distribution of coalitions (N = 4). Source: Authors.</title>
     </caption>
     <table class="MsoTableGrid custom-table" border="0" cellspacing="0" cellpadding="0"> 
      <tr> 
       <td class="custom-bottom-td acenter" width="22.74%"><p style="text-align:center">Coalitions of size N-C and C</p></td> 
       <td class="custom-bottom-td acenter" width="41.73%"><p style="text-align:center">Number of coalitions</p></td> 
       <td class="custom-bottom-td acenter" width="16.43%"><p style="text-align:center">Coalitions</p></td> 
       <td class="custom-bottom-td acenter" width="19.10%"><p style="text-align:center">Coalition structures</p></td> 
      </tr> 
      <tr> 
       <td class="custom-top-td acenter" width="22.74%"><p style="text-align:center">4:0</p></td> 
       <td class="custom-top-td aleft" width="41.73%"><p style="text-align:left">One 4-member coalition</p></td> 
       <td class="custom-top-td acenter" width="16.43%"><p style="text-align:center">1111</p></td> 
       <td class="custom-top-td acenter" width="19.10%"><p style="text-align:center">4:0</p></td> 
      </tr> 
      <tr> 
       <td class="acenter" width="22.74%"><p style="text-align:center">3:1</p></td> 
       <td class="aleft" width="41.73%"><p style="text-align:left">Four 3-member coalitions can be combined with the null coalition or with a one-member coalition</p></td> 
       <td class="acenter" width="16.43%"><p style="text-align:center">1110</p><p style="text-align:center">1101</p><p style="text-align:center">1011</p><p style="text-align:center">0111</p></td> 
       <td class="acenter" width="19.10%"><p style="text-align:center">3:0</p><p style="text-align:center">3:1</p></td> 
      </tr> 
      <tr> 
       <td class="acenter" width="22.74%"><p style="text-align:center">2:2</p></td> 
       <td class="aleft" width="41.73%"><p style="text-align:left">Six 2-member coalitions, that can be combined with a one-member coalition a two-member coalition or two null-member coalitions</p></td> 
       <td class="acenter" width="16.43%"><p style="text-align:center">1100</p><p style="text-align:center">1010</p><p style="text-align:center">1001</p><p style="text-align:center">0110</p><p style="text-align:center">0101</p><p style="text-align:center">0011</p></td> 
       <td class="acenter" width="19.10%"><p style="text-align:center">2:0:0:0</p><p style="text-align:center">2:1:1</p><p style="text-align:center">2:2</p></td> 
      </tr> 
      <tr> 
       <td class="acenter" width="22.74%"><p style="text-align:center">1:3</p></td> 
       <td class="aleft" width="41.73%"><p style="text-align:left">Four 1-member coalitions can be combined with null coalitions, with three one-member coalitions, two one-member coalitions or one-member coalitions</p></td> 
       <td class="acenter" width="16.43%"><p style="text-align:center">1000</p><p style="text-align:center">0100</p><p style="text-align:center">0010</p><p style="text-align:center">0001</p></td> 
       <td class="acenter" width="19.10%"><p style="text-align:center">1:0:0:0</p><p style="text-align:center">1:1:0:0</p><p style="text-align:center">1:1:1:0</p><p style="text-align:center">1:1:1:1</p></td> 
      </tr> 
      <tr> 
       <td class="acenter" width="22.74%"><p style="text-align:center">0:4</p></td> 
       <td class="aleft" width="41.73%"><p style="text-align:left">One 0-member coalition</p></td> 
       <td class="acenter" width="16.43%"><p style="text-align:center">0000</p></td> 
       <td class="acenter" width="19.10%"><p style="text-align:center">0:0:0:0</p></td> 
      </tr> 
     </table>
    </table-wrap>
    <p>Coalition is a general term that takes on a meaning corresponding to the level of generality we are focusing on, examples of a coalition are groups that consist of business divisions that make up a firm, unit activities that make up a value/supply chain, firms in an industry, activities that make up a business. At the hierarchical level immediately above, coalitions become the diagonal elements of the (higher level) organization matrix. A project can be seen as a coalition structure of assets, a firm as a coalition structure of projects, an industry as a coalition structure of firms and so on. According to the context, a coalition (or coalition structure) of activities can refer to many different entities ranging from the microscopic level to the global economy (teams, projects, divisions, firms, industries, and sectors).</p>
    <p>Coalitions are formed as a result of decisions that activate payoffs. Decisions may be cooperative (represented by 1’s in a string) or non-co-operative (0’s in the string). The representation of coalitions and coalition structures as a string is similar to the formulation of genetic algorithms <xref ref-type="bibr" rid="scirp.134293-15">
      (Holland et al., 1986)
     </xref>. The two processes associated with genetic algorithms, mutation and recombination are inherent in the formation of coalitions. Mutation consists of changing a single element in the coalition string. Recombination consists of combining coalitions. The coalition structure of four independent coalitions (1000, 0100, 0010, 0001) may undergo mutation by dropping activity 2 (0100) entirely giving the structure (1000, 0000, 0010, 0001). Likewise, the coalitions in coalition structure (1010, 0101) may be recombined to form the grand coalition (1111).</p>
   </sec>
   <sec id="s3_2">
    <title>3.2. A Hierarchical Organization Matrix</title>
    <p>As shown in <xref ref-type="fig" rid="fig3">
      Figure 3
     </xref>, a coalition is a multi-level grouping of activities, its structure is defined at a particular level of the hierarchy of the organization matrix. A coalition is defined by a decision string (a bit string of 0’s and 1’s) denoting which of the C<sub>i</sub> activities in the multi-level matrix are included in the coalition. If there are M possible hierarchical levels, then the total number of activities included in a coalition is C<sub>i</sub> and</p>
    <p>
     <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
       <msub> 
        <mi>
          C 
        </mi> 
        <mi>
          i 
        </mi> 
       </msub> 
       <mo>
         = 
       </mo> 
       <msub> 
        <mi>
          n 
        </mi> 
        <mn>
          1 
        </mn> 
       </msub> 
       <mo>
         + 
       </mo> 
       <msub> 
        <mi>
          n 
        </mi> 
        <mn>
          2 
        </mn> 
       </msub> 
       <mo>
         + 
       </mo> 
       <mo>
         ⋯ 
       </mo> 
       <mo>
         + 
       </mo> 
       <msub> 
        <mi>
          n 
        </mi> 
        <mi>
          m 
        </mi> 
       </msub> 
      </mrow> 
     </math> ( 
     <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
       <msub> 
        <mi>
          n 
        </mi> 
        <mi>
          i 
        </mi> 
       </msub> 
       <mo>
         ≥ 
       </mo> 
       <mn>
         0 
       </mn> 
      </mrow> 
     </math> all 
     <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
       <mi>
         i 
       </mi> 
       <mo>
         = 
       </mo> 
       <mn>
         1 
       </mn> 
       <mo>
         , 
       </mo> 
       <mn>
         2 
       </mn> 
       <mo>
         , 
       </mo> 
       <mo>
         ⋯ 
       </mo> 
       <mo>
         , 
       </mo> 
       <mi>
         m 
       </mi> 
      </mrow> 
     </math>) (6)</p>
    <p>In (5), coalitions of activities formed at one level of the coalition (diagonal elements at the next level of the hierarchy) are counted as separate activities. As noted below generally:</p>
    <p>
     <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
       <msub> 
        <mi>
          n 
        </mi> 
        <mn>
          1 
        </mn> 
       </msub> 
       <mo>
         ≥ 
       </mo> 
       <msub> 
        <mi>
          n 
        </mi> 
        <mn>
          2 
        </mn> 
       </msub> 
       <mo>
         ≥ 
       </mo> 
       <mo>
         ⋯ 
       </mo> 
       <mo>
         ≥ 
       </mo> 
       <msub> 
        <mi>
          n 
        </mi> 
        <mi>
          m 
        </mi> 
       </msub> 
      </mrow> 
     </math><sup>4</sup>.</p>
    <p>If we think of the organization matrix as a multi-level entity with M levels each one containing N<sub>i</sub> activities, we can illustrate it in the following way. There are ∑N<sub>i</sub> activities in all. Label each of the levels in ascending order as L<sup>i</sup><sup> </sup>( 
     <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
       <mi>
         i 
       </mi> 
       <mo>
         = 
       </mo> 
       <mn>
         1 
       </mn> 
       <mo>
         , 
       </mo> 
       <mn>
         2 
       </mn> 
       <mo>
         , 
       </mo> 
       <mo>
         ⋯ 
       </mo> 
       <mo>
         , 
       </mo> 
       <mi>
         m 
       </mi> 
      </mrow> 
     </math>). The various levels of the organization matrix are related. Diagonal elements of the organization matrix at one level (level i) are coalitions of a lower level ( 
     <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
       <mi>
         i 
       </mi> 
       <mo>
         = 
       </mo> 
       <mn>
         1 
       </mn> 
       <mo>
         , 
       </mo> 
       <mn>
         2 
       </mn> 
       <mo>
         , 
       </mo> 
       <mo>
         ⋯ 
       </mo> 
       <mo>
         , 
       </mo> 
       <mi>
         i 
       </mi> 
       <mo>
         − 
       </mo> 
       <mn>
         1 
       </mn> 
      </mrow> 
     </math>). Off diagonal elements of the organization matrix at the i-1 level are candidate activities for the formation of higher level (K level) coalitions. Diagonal activities at any one of the m levels represent coalitions of lower-level activities. Similarly, off-diagonal activities appearing at the m level offer further potential synergies: and so on. Thus, organizations are coalitions of businesses, business units are coalitions of projects, projects are coalitions of value chains, and value chains are coalitions of teams.</p>
    <p>The explicit introduction of coalitions into the model implies a modification of the formal definition of the organization matrix itself. Diagonal elements represent coalitions formed at lower levels of the matrix. So, we have, for any of the M levels of the organization matrix, a relationship between diagonal elements at level i ( 
     <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
       <msubsup> 
        <mi>
          A 
        </mi> 
        <mrow> 
         <mi>
           q 
         </mi> 
         <mi>
           r 
         </mi> 
        </mrow> 
        <mi>
          i 
        </mi> 
       </msubsup> 
      </mrow> 
     </math>) and lower-level coalitions 
     <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
       <msubsup> 
        <mi>
          C 
        </mi> 
        <mrow> 
         <mi>
           p 
         </mi> 
         <mi>
           p 
         </mi> 
        </mrow> 
        <mrow> 
         <mi>
           i 
         </mi> 
         <mo>
           − 
         </mo> 
         <mn>
           1 
         </mn> 
        </mrow> 
       </msubsup> 
      </mrow> 
     </math>.</p>
    <p>
     <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
       <msubsup> 
        <mi>
          A 
        </mi> 
        <mrow> 
         <mi>
           q 
         </mi> 
         <mi>
           r 
         </mi> 
        </mrow> 
        <mi>
          i 
        </mi> 
       </msubsup> 
       <mo>
         = 
       </mo> 
       <msubsup> 
        <mi>
          C 
        </mi> 
        <mrow> 
         <mi>
           p 
         </mi> 
         <mi>
           p 
         </mi> 
        </mrow> 
        <mrow> 
         <mi>
           i 
         </mi> 
         <mo>
           − 
         </mo> 
         <mn>
           1 
         </mn> 
        </mrow> 
       </msubsup> 
      </mrow> 
     </math> (7)</p>
    <p>Coalitions at level i can be formed by linking activities for which q ≠ r. We can rewrite (7) in terms of the payoffs to a coalition:</p>
    <p>
     <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
       <mi>
         Z 
       </mi> 
       <mrow> 
        <mo>
          ( 
        </mo> 
        <mrow> 
         <mi>
           C 
         </mi> 
         <mo>
           , 
         </mo> 
         <mi>
           θ 
         </mi> 
         <mo>
           , 
         </mo> 
         <mi>
           t 
         </mi> 
        </mrow> 
        <mo>
          ) 
        </mo> 
       </mrow> 
       <mo>
         = 
       </mo> 
       <mstyle displaystyle="true"> 
        <msub> 
         <mo>
           ∑ 
         </mo> 
         <mrow> 
          <mi>
            j 
          </mi> 
          <mo>
            , 
          </mo> 
          <mi>
            k 
          </mi> 
          <mo>
            ∈ 
          </mo> 
          <mi>
            C 
          </mi> 
         </mrow> 
        </msub> 
        <mrow> 
         <msub> 
          <mi>
            a 
          </mi> 
          <mrow> 
           <mi>
             j 
           </mi> 
           <mi>
             k 
           </mi> 
          </mrow> 
         </msub> 
         <msub> 
          <mi>
            θ 
          </mi> 
          <mi>
            j 
          </mi> 
         </msub> 
         <msub> 
          <mi>
            θ 
          </mi> 
          <mi>
            k 
          </mi> 
         </msub> 
         <mrow> 
          <mo>
            ( 
          </mo> 
          <mi>
            t 
          </mi> 
          <mo>
            ) 
          </mo> 
         </mrow> 
        </mrow> 
       </mstyle> 
      </mrow> 
     </math> (7a)</p>
    <fig id="fig3" position="float">
     <label>Figure 3</label>
     <caption>
      <title>Figure 3. A hierarchical organization matrix. Source: Authors.</title>
     </caption>
     <graphic mimetype="image" position="float" xlink:type="simple" xlink:href="https://html.scirp.org/file/1502968-rId77.jpeg?20240702082908" />
    </fig>
   </sec>
  </sec><sec id="s4">
   <title>4. Methodology</title>
   <p>The overall methodology deployed in this research is epistemological metrics-driven analysis. Exploring existing theories: such as the classical, neoclassical, contingency, systems, and resource-based theories. Understand their principles, strengths, and weaknesses. This will help to identify gaps and opportunities for a new theory. Then, evaluating the internal capabilities of organizations across different dimensions, such as human resources, technology, knowledge management, decision-making processes, and communication channels. Understand how these capabilities contribute to organizational effectiveness and performance. In addition, identifying common patterns between internal capabilities and organizational outcomes. Considering how different combinations of capabilities may lead to different structures, efficiencies, and competitive advantages. Identifying key factors that influence organizational structure and effectiveness. Finally, we developed a conceptual framework that outlines the relationship between internal capabilities and organizational structure. Clearly articulating the underlying assumptions and mechanisms through which capabilities influence organisation structure.</p>
   <p>Organizational payoffs are assessed using nine quantitative metrics, which span across sections consecutively, 3, 4, 5, and numerically capture the association of firms (see <xref ref-type="table" rid="table2">
     Table 2
    </xref>).</p>
   <table-wrap id="table2">
    <label>
     <xref ref-type="table" rid="table2">
      Table 2
     </xref></label>
    <caption>
     <title>
      <xref ref-type="bibr" rid="scirp.134293-"></xref>Table 2. Summary of organizational payoff metrics: Source: Authors.</title>
    </caption>
    <table class="MsoTableGrid custom-table" border="0" cellspacing="0" cellpadding="0"> 
     <tr> 
      <td class="custom-bottom-td acenter" width="12.91%"><p style="text-align:center">Metrics #</p></td> 
      <td class="custom-bottom-td acenter" width="26.66%"><p style="text-align:center">Type of metrics</p></td> 
      <td class="custom-bottom-td acenter" width="25.07%"><p style="text-align:center">Description</p></td> 
      <td class="custom-bottom-td acenter" width="35.36%"><p style="text-align:center">Outcomes</p></td> 
     </tr> 
     <tr> 
      <td class="custom-top-td acenter" width="12.91%"><p style="text-align:center">1</p></td> 
      <td class="custom-top-td aleft" width="26.66%"><p style="text-align:left">Payoff</p></td> 
      <td class="custom-top-td aleft" width="25.07%"><p style="text-align:left">Potential payoff</p></td> 
      <td class="custom-top-td aleft" width="35.36%"><p style="text-align:left">Pay-outs</p></td> 
     </tr> 
     <tr> 
      <td class="acenter" width="12.91%"><p style="text-align:center">2</p></td> 
      <td class="aleft" width="26.66%"><p style="text-align:left">Realised payoffs</p></td> 
      <td class="aleft" width="25.07%"><p style="text-align:left">Realised payoffs determined by organizational decision</p></td> 
      <td class="aleft" width="35.36%"><p style="text-align:left">Mapping of activities into payoff space by forming coalitions</p></td> 
     </tr> 
     <tr> 
      <td class="acenter" width="12.91%"><p style="text-align:center">3</p></td> 
      <td class="aleft" width="26.66%"><p style="text-align:left">Possibilities in payoffs</p></td> 
      <td class="aleft" width="25.07%"><p style="text-align:left"></p></td> 
      <td class="aleft" width="35.36%"><p style="text-align:left">Potential payoffs are achieved by choices ( 
        <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
          <msub> 
           <mi>
             θ 
           </mi> 
           <mi>
             k 
           </mi> 
          </msub> 
          <mo>
            , 
          </mo> 
          <msub> 
           <mi>
             θ 
           </mi> 
           <mi>
             j 
           </mi> 
          </msub> 
          <mo>
            ∈ 
          </mo> 
          <mn>
            0 
          </mn> 
          <mo>
            , 
          </mo> 
          <mn>
            1 
          </mn> 
         </mrow> 
        </math>) where the connection between payoffs and choices provides an increase to the underlying equation</p></td> 
     </tr> 
     <tr> 
      <td class="acenter" width="12.91%"><p style="text-align:center">4</p></td> 
      <td class="aleft" width="26.66%"><p style="text-align:left">The illustration for accomplished payoffs</p></td> 
      <td class="aleft" width="25.07%"><p style="text-align:left"></p></td> 
      <td class="aleft" width="35.36%"><p style="text-align:left">Negotiating a coalitional game, where agents form expectations, anticipate and develop models to understand and influence how payoffs can be realised and distributed.</p></td> 
     </tr> 
     <tr> 
      <td class="acenter" width="12.91%"><p style="text-align:center">5</p></td> 
      <td class="aleft" width="26.66%"><p style="text-align:left">Coalition structure</p></td> 
      <td class="aleft" width="25.07%"><p style="text-align:left">Coalition structure analysis</p></td> 
      <td class="aleft" width="35.36%"><p style="text-align:left">Leaner regression of coalitions</p></td> 
     </tr> 
     <tr> 
      <td class="acenter" width="12.91%"><p style="text-align:center">6</p></td> 
      <td class="aleft" width="26.66%"><p style="text-align:left">A coalition is a multi-level grouping of activities.</p></td> 
      <td class="aleft" width="25.07%"><p style="text-align:left"></p></td> 
      <td class="aleft" width="35.36%"><p style="text-align:left"></p></td> 
     </tr> 
     <tr> 
      <td class="acenter" width="12.91%"><p style="text-align:center">7</p></td> 
      <td class="aleft" width="26.66%"><p style="text-align:left">Critical states in organizations</p></td> 
      <td class="aleft" width="25.07%"><p style="text-align:left">Probability of the probability of an I-level coalition</p></td> 
      <td class="aleft" width="35.36%"><p style="text-align:left"></p></td> 
     </tr> 
     <tr> 
      <td class="acenter" width="12.91%"><p style="text-align:center">8</p></td> 
      <td class="aleft" width="26.66%"><p style="text-align:left">Equivalently the probability of a coalition structure</p></td> 
      <td class="aleft" width="25.07%"><p style="text-align:left"></p></td> 
      <td class="aleft" width="35.36%"><p style="text-align:left"></p></td> 
     </tr> 
     <tr> 
      <td class="acenter" width="12.91%"><p style="text-align:center">9</p></td> 
      <td class="aleft" width="26.66%"><p style="text-align:left">Expressing the number of activities involved in a change in the organization matrix</p></td> 
      <td class="aleft" width="25.07%"><p style="text-align:left"></p></td> 
      <td class="aleft" width="35.36%"><p style="text-align:left"></p></td> 
     </tr> 
    </table>
   </table-wrap>
  </sec><sec id="s5">
   <title>5. Strategy as Search</title>
   <p>Strategic decision-making uses the method of continuous evolutionary search for payoffs on the organization matrix: the outcomes of the search are reflected in changing coalition structures <xref ref-type="bibr" rid="scirp.134293-14">
     (Hannah et al., 2021)
    </xref>. Many search algorithms can be conveyed in terms of the organization matrix. <xref ref-type="table" rid="table3">
     Table 3
    </xref> illustrates a rough taxonomy of search procedures. Ergodic searches wander through throughout phase space. The focus may be on the matrix itself or on decisions. Ergodic search is such that each one of the 2<sup>N</sup> possible coalitions is equally likely: or we might think of ergodic search as making every decision associated with a coalition equally likely, giving 2<sup>N</sup><sup>(</sup><sup>N</sup><sup> </sup><sup>−</sup><sup> </sup><sup>1)</sup> configuration. Alternatively, we may think in terms of restricted search. This is in fact the case with economic models and with models used in strategic analysis. A restricted search may take the form of placing restrictions on the form of the organization matrix (decomposition) by introducing organizational grammar.</p>
   <table-wrap id="table3">
    <label>
     <xref ref-type="table" rid="table3">
      Table 3
     </xref></label>
    <caption>
     <title>
      <xref ref-type="bibr" rid="scirp.134293-"></xref>Table 3. Varieties of search. Source: Authors.</title>
    </caption>
    <table class="MsoTableGrid custom-table" border="0" cellspacing="0" cellpadding="0"> 
     <tr> 
      <td class="custom-bottom-td acenter" width="29.05%"><p style="text-align:center"></p></td> 
      <td class="custom-bottom-td acenter" width="40.12%"><p style="text-align:center">Ergodic search</p></td> 
      <td class="custom-bottom-td acenter" width="38.55%"><p style="text-align:center">Non-ergodic search</p></td> 
     </tr> 
     <tr> 
      <td class="custom-top-td acenter" width="29.05%"><p style="text-align:center">Matrix [A<sub>ik</sub>]</p></td> 
      <td class="custom-top-td acenter" width="40.12%"><p style="text-align:center">Statistical mechanics 1</p></td> 
      <td class="custom-top-td acenter" width="38.55%"><p style="text-align:center">Decomposition 2</p></td> 
     </tr> 
     <tr> 
      <td class="acenter" width="29.05%"><p style="text-align:center">Decisions (θ<sub>i</sub>θ<sub>k</sub>)</p></td> 
      <td class="acenter" width="40.12%"><p style="text-align:center">Spin glass 3</p></td> 
      <td class="acenter" width="38.55%"><p style="text-align:center">Grammar 4</p></td> 
     </tr> 
    </table>
   </table-wrap>
   <sec id="s5_1">
    <title>5.1. Alternative Search Procedures</title>
    <p>
     <xref ref-type="table" rid="table3">
      Table 3
     </xref> sets out a taxonomy of 4 search procedures and these are discussed as follows:</p>
   </sec>
   <sec id="s5_2">
    <title>5.2. Evolution on the Organization Matrix</title>
    <p>In general, evolution of organizations is through the formation of coalitions on the matrix. Searching the organization matrix can be powered by the external environment (outer dynamics) and by self-adaptation, the capacity of an organization to evolve partly through processes internal to itself (inner dynamics). The two dynamics are illustrated in <xref ref-type="fig" rid="fig2">
      Figure 2
     </xref>. Grammar operates on the transmission of E(t) on [A<sub>ik</sub>] and [θ<sub>i</sub>θ<sub>k</sub>] (external to a coalition) and on the transmission between on [A<sub>ik</sub>] and [θ<sub>i</sub>θ<sub>k</sub>] (internal to the coalition).</p>
    <p>The fractal structure of the organization matrix permits high connectivity and separation of time scales, which allows for the transformation of a coalition structure on all possible hierarchical dimensions or on just a few of them. The coalition structure of the organization matrix forms an interconnected set through which change emanating from external dynamics can provoke coalition restructuring of varying lengths and time scales. Some changes transform the entire structure: major revolutions that completely repartition the organization matrix on many scales: some are limited to segments of the hierarchy (either high or low levels): and others are confined to tiny niches. Major floods emerge from tiny streams (which is why the Chinese authorities fear Felong Gong). Some events have spectacular potential, the life of some mute inglorious Milton, but are confined to an almost imperceptible niche, the short and simple annals of the poor. Spectacular changes, more often than not, leave parts of the matrix untouched, as Yeats put it Ireland may be free, and you still break stones. But apocalypses do occur.</p>
    <p>Environmental factors at successive levels of the organization matrix exert pressure (outer dynamics). Consider an arbitrary level of the organization matrix, the business unit level for example. Inner dynamics take the form of relaxation procedures. Organizational grammar ensures that inner relaxation processes are slower than the outer pressure. We have a split of time range between the inner and the outer: otherwise, organizations would be dust in the wind. Grammar provides inertia, and forms building blocks, those bin coalitions, often temporarily, insecurely, so that the fractal structure of the organization matrix is incompletely permeable, a set that is connected only infrequently. It becomes a connected set when pressure is allowed to build up on every level of the matrix. In that case, change will permeate the business and the organization of society <xref ref-type="bibr" rid="scirp.134293-11">
      (Flier, Bosch, &amp; Volberda, 2003)
     </xref>.</p>
    <p>When pressure builds up at all heights of the hierarchy of the organization matrix, all coalitions in the structure approach a state of self-organized criticality. Self-organization occurs in the sense that, as disequilibrium systems, organizations have the capacity to create structures and forms in the lack of influence or exploitation by an outside agent <xref ref-type="bibr" rid="scirp.134293-37">
      (Tlemsani, 2022)
     </xref>. Criticality occurs in that the coalition structure enters a transition state, such that disturbances will propagate through the entire system (rather than, as in non-critical states, being confined to a niche or a segment).</p>
    <p>Change at lower levels takes place more or less continuously, perhaps imperceptibly except to those directly affected (minor changes in work patterns, in everyday life, in arrangements for example). Small-scale evolutions take place all the time. Larger and larger scale evolutions take place when higher levels of the organization matrix, together with successively lower levels are all pushed to a critical state. Large macro evolutions result in the collapse of entire political and economic systems <xref ref-type="bibr" rid="scirp.134293-38">
      (Tlemsani &amp; Al Suwaidi, 2016)
     </xref>. Comparatively smaller changes result in the disappearance of industries and firms and the emergence of new ones. We cannot provide a precise mathematical description of the scale of evolution on the organization matrix that permits us to predict the size and timing of changes. But we can attach probabilities and explain the triggering process.</p>
   </sec>
   <sec id="s5_3">
    <title>5.3. Changes in Coalition Structure</title>
    <p>To understand the process of change in coalition structure, it is necessary to transform the organization matrix into game theoretic terms: into the format of a coalitional game. Coalition formation is defined as a set of binary decisions on A (A = [A<sub>ik</sub>]). It is convenient to combine off-diagonal (synergy) elements, writing 
     <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
       <msubsup> 
        <mi>
          a 
        </mi> 
        <mrow> 
         <mi>
           j 
         </mi> 
         <mi>
           k 
         </mi> 
        </mrow> 
        <mo>
          ∗ 
        </mo> 
       </msubsup> 
       <mo>
         = 
       </mo> 
       <msub> 
        <mi>
          a 
        </mi> 
        <mrow> 
         <mi>
           j 
         </mi> 
         <mi>
           k 
         </mi> 
        </mrow> 
       </msub> 
       <mo>
         + 
       </mo> 
       <msub> 
        <mi>
          a 
        </mi> 
        <mrow> 
         <mi>
           k 
         </mi> 
         <mi>
           j 
         </mi> 
        </mrow> 
       </msub> 
      </mrow> 
     </math> for (all j, k for I ≠ k in an augmented organization matrix 
     <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
       <mrow> 
        <mo>
          [ 
        </mo> 
        <mrow> 
         <msubsup> 
          <mi>
            a 
          </mi> 
          <mrow> 
           <mi>
             j 
           </mi> 
           <mi>
             k 
           </mi> 
          </mrow> 
          <mo>
            ∗ 
          </mo> 
         </msubsup> 
        </mrow> 
        <mo>
          ] 
        </mo> 
       </mrow> 
      </mrow> 
     </math> (and 
     <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
       <msub> 
        <mi>
          a 
        </mi> 
        <mrow> 
         <mi>
           j 
         </mi> 
         <mi>
           k 
         </mi> 
        </mrow> 
       </msub> 
       <mo>
         = 
       </mo> 
       <msubsup> 
        <mi>
          a 
        </mi> 
        <mrow> 
         <mi>
           j 
         </mi> 
         <mi>
           k 
         </mi> 
        </mrow> 
        <mo>
          ∗ 
        </mo> 
       </msubsup> 
      </mrow> 
     </math> where j = k).</p>
    <p>
     <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
       <msup> 
        <mstyle mathvariant="bold" mathsize="normal"> 
         <mi>
           a 
         </mi> 
        </mstyle> 
        <mo>
          ∗ 
        </mo> 
       </msup> 
       <mo>
         ≡ 
       </mo> 
       <mrow> 
        <mo>
          [ 
        </mo> 
        <mrow> 
         <msubsup> 
          <mi>
            a 
          </mi> 
          <mrow> 
           <mi>
             j 
           </mi> 
           <mi>
             k 
           </mi> 
          </mrow> 
          <mo>
            ∗ 
          </mo> 
         </msubsup> 
        </mrow> 
        <mo>
          ] 
        </mo> 
       </mrow> 
       <mo>
         ≡ 
       </mo> 
       <mrow> 
        <mo>
          [ 
        </mo> 
        <mrow> 
         <mtable> 
          <mtr> 
           <mtd> 
            <mrow> 
             <msub> 
              <mi>
                a 
              </mi> 
              <mrow> 
               <mn>
                 11 
               </mn> 
              </mrow> 
             </msub> 
            </mrow> 
           </mtd> 
           <mtd> 
            <mrow> 
             <msubsup> 
              <mi>
                a 
              </mi> 
              <mrow> 
               <mn>
                 12 
               </mn> 
              </mrow> 
              <mo>
                ∗ 
              </mo> 
             </msubsup> 
            </mrow> 
           </mtd> 
           <mtd> 
            <mrow> 
             <msubsup> 
              <mi>
                a 
              </mi> 
              <mrow> 
               <mn>
                 13 
               </mn> 
              </mrow> 
              <mo>
                ∗ 
              </mo> 
             </msubsup> 
            </mrow> 
           </mtd> 
           <mtd> 
            <mo>
              ⋯ 
            </mo> 
           </mtd> 
           <mtd> 
            <mrow> 
             <msubsup> 
              <mi>
                a 
              </mi> 
              <mrow> 
               <mn>
                 1 
               </mn> 
               <mi>
                 N 
               </mi> 
              </mrow> 
              <mo>
                ∗ 
              </mo> 
             </msubsup> 
            </mrow> 
           </mtd> 
          </mtr> 
          <mtr> 
           <mtd> 
            <mn>
              0 
            </mn> 
           </mtd> 
           <mtd> 
            <mrow> 
             <msub> 
              <mi>
                a 
              </mi> 
              <mrow> 
               <mn>
                 22 
               </mn> 
              </mrow> 
             </msub> 
            </mrow> 
           </mtd> 
           <mtd> 
            <mrow> 
             <msubsup> 
              <mi>
                a 
              </mi> 
              <mrow> 
               <mn>
                 23 
               </mn> 
              </mrow> 
              <mo>
                ∗ 
              </mo> 
             </msubsup> 
            </mrow> 
           </mtd> 
           <mtd> 
            <mo>
              ⋯ 
            </mo> 
           </mtd> 
           <mtd> 
            <mrow> 
             <msubsup> 
              <mi>
                a 
              </mi> 
              <mrow> 
               <mn>
                 2 
               </mn> 
               <mi>
                 N 
               </mi> 
              </mrow> 
              <mo>
                ∗ 
              </mo> 
             </msubsup> 
            </mrow> 
           </mtd> 
          </mtr> 
          <mtr> 
           <mtd> 
            <mn>
              0 
            </mn> 
           </mtd> 
           <mtd> 
            <mn>
              0 
            </mn> 
           </mtd> 
           <mtd> 
            <mrow> 
             <msub> 
              <mi>
                a 
              </mi> 
              <mrow> 
               <mn>
                 33 
               </mn> 
              </mrow> 
             </msub> 
            </mrow> 
           </mtd> 
           <mtd> 
            <mo>
              ⋯ 
            </mo> 
           </mtd> 
           <mtd> 
            <mrow> 
             <msubsup> 
              <mi>
                a 
              </mi> 
              <mrow> 
               <mn>
                 3 
               </mn> 
               <mi>
                 N 
               </mi> 
              </mrow> 
              <mo>
                ∗ 
              </mo> 
             </msubsup> 
            </mrow> 
           </mtd> 
          </mtr> 
          <mtr> 
           <mtd> 
            <mo>
              ⋮ 
            </mo> 
           </mtd> 
           <mtd> 
            <mo>
              ⋮ 
            </mo> 
           </mtd> 
           <mtd> 
            <mo>
              ⋮ 
            </mo> 
           </mtd> 
           <mtd> 
            <mo>
              ⋱ 
            </mo> 
           </mtd> 
           <mtd> 
            <mo>
              ⋮ 
            </mo> 
           </mtd> 
          </mtr> 
          <mtr> 
           <mtd> 
            <mn>
              0 
            </mn> 
           </mtd> 
           <mtd> 
            <mn>
              0 
            </mn> 
           </mtd> 
           <mtd> 
            <mn>
              0 
            </mn> 
           </mtd> 
           <mtd> 
            <mo>
              ⋯ 
            </mo> 
           </mtd> 
           <mtd> 
            <mrow> 
             <msub> 
              <mi>
                a 
              </mi> 
              <mrow> 
               <mi>
                 N 
               </mi> 
               <mi>
                 N 
               </mi> 
              </mrow> 
             </msub> 
            </mrow> 
           </mtd> 
          </mtr> 
         </mtable> 
        </mrow> 
        <mo>
          ] 
        </mo> 
       </mrow> 
      </mrow> 
     </math> (8)</p>
    <p>Now, define (net) payoffs in (1a) as the differences between benefits and costs: that is potential payoffs ( 
     <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
       <msubsup> 
        <mi>
          a 
        </mi> 
        <mrow> 
         <mi>
           j 
         </mi> 
         <mi>
           k 
         </mi> 
        </mrow> 
        <mo>
          ∗ 
        </mo> 
       </msubsup> 
      </mrow> 
     </math>) may exist as a result of synergies or complementarities from coalition formation, but realising them involves costs (c<sub>jk</sub>), as well as benefits (r<sub>jk</sub>), to agents j and k. If positive (net) payoffs 
     <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
       <msubsup> 
        <mi>
          a 
        </mi> 
        <mrow> 
         <mi>
           j 
         </mi> 
         <mi>
           k 
         </mi> 
        </mrow> 
        <mo>
          ∗ 
        </mo> 
       </msubsup> 
      </mrow> 
     </math> potentially exist from information sharing, for example, realised (net) payoffs are the sum of the costs and benefits of sharing the information: costs and benefits which must be distributed between j and k. Thus, (7a) can be rewritten as:</p>
    <p>
     <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
       <mi>
         Z 
       </mi> 
       <mrow> 
        <mo>
          ( 
        </mo> 
        <mrow> 
         <mi>
           C 
         </mi> 
         <mo>
           , 
         </mo> 
         <mi>
           θ 
         </mi> 
         <mo>
           , 
         </mo> 
         <mi>
           t 
         </mi> 
        </mrow> 
        <mo>
          ) 
        </mo> 
       </mrow> 
       <mo>
         = 
       </mo> 
       <msub> 
        <mi>
          Σ 
        </mi> 
        <mrow> 
         <mi>
           i 
         </mi> 
         <mi>
           k 
         </mi> 
        </mrow> 
       </msub> 
       <mrow> 
        <mo>
          ( 
        </mo> 
        <mrow> 
         <msub> 
          <mi>
            r 
          </mi> 
          <mrow> 
           <mi>
             j 
           </mi> 
           <mi>
             k 
           </mi> 
          </mrow> 
         </msub> 
         <mo>
           − 
         </mo> 
         <msub> 
          <mi>
            c 
          </mi> 
          <mrow> 
           <mi>
             j 
           </mi> 
           <mi>
             k 
           </mi> 
          </mrow> 
         </msub> 
        </mrow> 
        <mo>
          ) 
        </mo> 
       </mrow> 
       <msub> 
        <mi>
          θ 
        </mi> 
        <mi>
          j 
        </mi> 
       </msub> 
       <msub> 
        <mi>
          θ 
        </mi> 
        <mi>
          k 
        </mi> 
       </msub> 
       <mrow> 
        <mo>
          ( 
        </mo> 
        <mi>
          t 
        </mi> 
        <mo>
          ) 
        </mo> 
       </mrow> 
      </mrow> 
     </math>, 
     <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
       <msub> 
        <mi>
          θ 
        </mi> 
        <mi>
          j 
        </mi> 
       </msub> 
       <msub> 
        <mi>
          θ 
        </mi> 
        <mi>
          k 
        </mi> 
       </msub> 
       <mo>
         ∈ 
       </mo> 
       <mn>
         0 
       </mn> 
       <mo>
         , 
       </mo> 
       <mn>
         1 
       </mn> 
      </mrow> 
     </math> (9)</p>
    <p>If positive net payoffs exist, this is a reason for joining or for maintaining the coalition: if payoffs are negative, then it is grounds for quitting. Equation (7b) maps out a set of coalitional games. The formation of a particular coalition structure is the result of perceptions about net payoffs (a*). Changes in coalition structure emanate from outer dynamics: changes in perceptions of payoffs (costs and benefits) associated with a coalition are triggered by changes in the business environment E(t). Inner dynamics together with organizational grammar is a source of inertia in an organization <xref ref-type="bibr" rid="scirp.134293-40">
      (Tlemsani &amp; Matthews, 2021)
     </xref>. Not every change in the cost-benefit structure of payoffs will trigger a change in coalitions or coalition structures. The weaker the inertia, the more likely and the more continuous the change.</p>
   </sec>
   <sec id="s5_4">
    <title>5.4. Evolution at Many Hierarchical Levels</title>
    <p>The explanation in the previous section is general. It holds for any level of the organizational hierarchy: ranging from the smallest team to the largest organization or institution and to the evolution of the system itself.</p>
    <p>An analogy exists with Bak’s sandpile experiment when we consider successive levels of a coalition structure as successively higher and higher levels of the sandpile. At a critical state of the sandpile slides or avalanches begin. The avalanches are caused by communication between the grains of sand: additional grains communicate their momentum (roll) to other grains, which also start to roll. Most of the time the moving sand causes only local disturbances, and nothing very dramatic happens to the pile. There is no global communication. Sometimes bigger avalanches occur, and there is greater communication of the disturbances. Sometimes, but only rarely the moving sand causes huge avalanches: there is a communication of the disturbance throughout the whole pile.</p>
    <p>We experience day-to-day change, of some kind or other, at the micro level continuously. Wide-ranging changes are more rarely experienced. One explanation for this is probabilistic. At lower levels of the hierarchy, there are more coalitions than at higher levels. As we ascend the hierarchy of activities, the number of coalitions shrinks in the sense that successively higher-level coalitions are coalitions of coalitions so there are fewer of them. This intuition needs to be formalised.</p>
   </sec>
   <sec id="s5_5">
    <title>5.5. Critical States in Organizations</title>
    <p>Suppose that the organization matrix is a multi-level entity with M levels, each one containing of N<sub>i</sub> activities ( 
     <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
       <msub> 
        <mi>
          n 
        </mi> 
        <mn>
          1 
        </mn> 
       </msub> 
       <mo>
         , 
       </mo> 
       <msub> 
        <mi>
          n 
        </mi> 
        <mn>
          2 
        </mn> 
       </msub> 
       <mo>
         , 
       </mo> 
       <mo>
         ⋯ 
       </mo> 
       <mo>
         , 
       </mo> 
       <msub> 
        <mi>
          n 
        </mi> 
        <mi>
          m 
        </mi> 
       </msub> 
      </mrow> 
     </math>) and having N<sub>i</sub> = N activities in all. Label activity A<sup>1</sup> (i = 1) as the top level of the organization matrix (with an associated coalition structure or coalition C<sup>1</sup>) and A<sup>m</sup> as the lowest level activity (or coalition structure C<sup>m</sup>). Suppose the probability of a coalition at any level is P<sup>i</sup>(C<sup>i</sup>). Thus, the probability of an i-level coalition is P<sup>i</sup>(C<sup>i</sup>) = n<sub>i</sub>/N. So, we have:</p>
    <p>
     <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
       <msup> 
        <mi>
          P 
        </mi> 
        <mn>
          1 
        </mn> 
       </msup> 
       <mrow> 
        <mo>
          ( 
        </mo> 
        <mrow> 
         <msup> 
          <mi>
            C 
          </mi> 
          <mn>
            1 
          </mn> 
         </msup> 
        </mrow> 
        <mo>
          ) 
        </mo> 
       </mrow> 
       <mo>
         = 
       </mo> 
       <mrow> 
        <mrow> 
         <msub> 
          <mi>
            n 
          </mi> 
          <mn>
            1 
          </mn> 
         </msub> 
        </mrow> 
        <mo>
          / 
        </mo> 
        <mi>
          N 
        </mi> 
       </mrow> 
       <mo>
         , 
       </mo> 
       <msup> 
        <mi>
          P 
        </mi> 
        <mn>
          2 
        </mn> 
       </msup> 
       <mrow> 
        <mo>
          ( 
        </mo> 
        <mrow> 
         <msup> 
          <mi>
            C 
          </mi> 
          <mn>
            2 
          </mn> 
         </msup> 
        </mrow> 
        <mo>
          ) 
        </mo> 
       </mrow> 
       <mo>
         = 
       </mo> 
       <mrow> 
        <mrow> 
         <msub> 
          <mi>
            n 
          </mi> 
          <mn>
            2 
          </mn> 
         </msub> 
        </mrow> 
        <mo>
          / 
        </mo> 
        <mi>
          N 
        </mi> 
       </mrow> 
       <mo>
         , 
       </mo> 
       <mo>
         ⋯ 
       </mo> 
       <mo>
         , 
       </mo> 
       <msup> 
        <mi>
          P 
        </mi> 
        <mrow> 
         <mi>
           m 
         </mi> 
         <mo>
           − 
         </mo> 
         <mn>
           1 
         </mn> 
        </mrow> 
       </msup> 
       <mrow> 
        <mo>
          ( 
        </mo> 
        <mrow> 
         <msup> 
          <mi>
            C 
          </mi> 
          <mrow> 
           <mi>
             m 
           </mi> 
           <mo>
             − 
           </mo> 
           <mn>
             1 
           </mn> 
          </mrow> 
         </msup> 
        </mrow> 
        <mo>
          ) 
        </mo> 
       </mrow> 
       <mo>
         = 
       </mo> 
       <mrow> 
        <mrow> 
         <msub> 
          <mi>
            n 
          </mi> 
          <mrow> 
           <mi>
             m 
           </mi> 
           <mo>
             − 
           </mo> 
           <mn>
             1 
           </mn> 
          </mrow> 
         </msub> 
        </mrow> 
        <mo>
          / 
        </mo> 
        <mi>
          N 
        </mi> 
       </mrow> 
       <mo>
         , 
       </mo> 
       <msup> 
        <mi>
          P 
        </mi> 
        <mi>
          m 
        </mi> 
       </msup> 
       <mrow> 
        <mo>
          ( 
        </mo> 
        <mrow> 
         <msup> 
          <mi>
            C 
          </mi> 
          <mi>
            m 
          </mi> 
         </msup> 
        </mrow> 
        <mo>
          ) 
        </mo> 
       </mrow> 
       <mo>
         = 
       </mo> 
       <mrow> 
        <mrow> 
         <msub> 
          <mi>
            n 
          </mi> 
          <mi>
            m 
          </mi> 
         </msub> 
        </mrow> 
        <mo>
          / 
        </mo> 
        <mi>
          N 
        </mi> 
       </mrow> 
      </mrow> 
     </math> (10)</p>
    <p>It is also true by definition that:</p>
    <p>
     <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
       <msub> 
        <mi>
          n 
        </mi> 
        <mi>
          m 
        </mi> 
       </msub> 
       <mo>
         ≥ 
       </mo> 
       <msub> 
        <mi>
          n 
        </mi> 
        <mrow> 
         <mi>
           m 
         </mi> 
         <mo>
           − 
         </mo> 
         <mn>
           1 
         </mn> 
        </mrow> 
       </msub> 
       <mo>
         ≥ 
       </mo> 
       <msub> 
        <mi>
          n 
        </mi> 
        <mrow> 
         <mi>
           m 
         </mi> 
         <mo>
           − 
         </mo> 
         <mn>
           2 
         </mn> 
        </mrow> 
       </msub> 
       <mo>
         ≥ 
       </mo> 
       <mo>
         ⋯ 
       </mo> 
       <mo>
         ≥ 
       </mo> 
       <msub> 
        <mi>
          n 
        </mi> 
        <mn>
          2 
        </mn> 
       </msub> 
       <mo>
         ≥ 
       </mo> 
       <msub> 
        <mi>
          n 
        </mi> 
        <mn>
          1 
        </mn> 
       </msub> 
      </mrow> 
     </math>. 
     <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
       <msup> 
        <mi>
          P 
        </mi> 
        <mi>
          m 
        </mi> 
       </msup> 
       <mrow> 
        <mo>
          ( 
        </mo> 
        <mrow> 
         <msup> 
          <mi>
            C 
          </mi> 
          <mi>
            m 
          </mi> 
         </msup> 
        </mrow> 
        <mo>
          ) 
        </mo> 
       </mrow> 
       <mo>
         ≥ 
       </mo> 
       <msup> 
        <mi>
          P 
        </mi> 
        <mrow> 
         <mi>
           m 
         </mi> 
         <mo>
           − 
         </mo> 
         <mn>
           1 
         </mn> 
        </mrow> 
       </msup> 
       <mrow> 
        <mo>
          ( 
        </mo> 
        <mrow> 
         <msup> 
          <mi>
            C 
          </mi> 
          <mrow> 
           <mi>
             m 
           </mi> 
           <mo>
             − 
           </mo> 
           <mn>
             1 
           </mn> 
          </mrow> 
         </msup> 
        </mrow> 
        <mo>
          ) 
        </mo> 
       </mrow> 
       <mo>
         ≥ 
       </mo> 
       <mo>
         ⋯ 
       </mo> 
       <mo>
         ≥ 
       </mo> 
       <msup> 
        <mi>
          P 
        </mi> 
        <mn>
          2 
        </mn> 
       </msup> 
       <mrow> 
        <mo>
          ( 
        </mo> 
        <mrow> 
         <msup> 
          <mi>
            C 
          </mi> 
          <mn>
            2 
          </mn> 
         </msup> 
        </mrow> 
        <mo>
          ) 
        </mo> 
       </mrow> 
       <mo>
         ≥ 
       </mo> 
       <msup> 
        <mi>
          P 
        </mi> 
        <mn>
          1 
        </mn> 
       </msup> 
       <mrow> 
        <mo>
          ( 
        </mo> 
        <mrow> 
         <msup> 
          <mi>
            C 
          </mi> 
          <mn>
            1 
          </mn> 
         </msup> 
        </mrow> 
        <mo>
          ) 
        </mo> 
       </mrow> 
      </mrow> 
     </math></p>
    <fig id="fig4" position="float">
     <label>Figure 4</label>
     <caption>
      <title>Figure 4. The relationship between size and the frequency of change in coalition structure. Source: Authors.</title>
     </caption>
     <graphic mimetype="image" position="float" xlink:type="simple" xlink:href="https://html.scirp.org/file/1502968-rId105.jpeg?20240702082909" />
    </fig>
    <p>and generally:</p>
    <p>
     <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
       <msup> 
        <mi>
          P 
        </mi> 
        <mrow> 
         <mi>
           i 
         </mi> 
         <mo>
           + 
         </mo> 
         <mn>
           1 
         </mn> 
        </mrow> 
       </msup> 
       <mrow> 
        <mo>
          ( 
        </mo> 
        <mrow> 
         <msup> 
          <mi>
            C 
          </mi> 
          <mrow> 
           <mi>
             i 
           </mi> 
           <mo>
             + 
           </mo> 
           <mn>
             1 
           </mn> 
          </mrow> 
         </msup> 
        </mrow> 
        <mo>
          ) 
        </mo> 
       </mrow> 
       <mo>
         ≥ 
       </mo> 
       <msup> 
        <mi>
          P 
        </mi> 
        <mi>
          i 
        </mi> 
       </msup> 
       <mrow> 
        <mo>
          ( 
        </mo> 
        <mrow> 
         <msup> 
          <mi>
            C 
          </mi> 
          <mi>
            i 
          </mi> 
         </msup> 
        </mrow> 
        <mo>
          ) 
        </mo> 
       </mrow> 
      </mrow> 
     </math> (11)</p>
    <p>Equivalently, the probability of a coalition structure occurring at a particular level is the cumulative probability of coalitions occurring at lower levels. Then:</p>
    <p>
     <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
       <msup> 
        <mi>
          P 
        </mi> 
        <mi>
          i 
        </mi> 
       </msup> 
       <mrow> 
        <mo>
          ( 
        </mo> 
        <mrow> 
         <msup> 
          <mi>
            C 
          </mi> 
          <mi>
            i 
          </mi> 
         </msup> 
        </mrow> 
        <mo>
          ) 
        </mo> 
       </mrow> 
       <mo>
         = 
       </mo> 
       <mrow> 
        <mrow> 
         <msub> 
          <mi>
            Π 
          </mi> 
          <mrow> 
           <mi>
             i 
           </mi> 
           <mo>
             + 
           </mo> 
           <mn>
             1 
           </mn> 
          </mrow> 
         </msub> 
         <mrow> 
          <mo>
            ( 
          </mo> 
          <mrow> 
           <msub> 
            <mi>
              n 
            </mi> 
            <mrow> 
             <mi>
               i 
             </mi> 
             <mo>
               + 
             </mo> 
             <mn>
               1 
             </mn> 
            </mrow> 
           </msub> 
          </mrow> 
          <mo>
            ) 
          </mo> 
         </mrow> 
        </mrow> 
        <mo>
          / 
        </mo> 
        <mi>
          N 
        </mi> 
       </mrow> 
      </mrow> 
     </math> (12)</p>
    <p>where P<sup>i</sup>(C<sup>i</sup>) in (11) and (12) is the relative frequency of changes in coalition structure.</p>
    <p>Expressing the number of activities involved in a change on the organization matrix when a change in coalition structure takes place as S and k ( 
     <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
       <mi>
         k 
       </mi> 
       <mo>
         = 
       </mo> 
       <mn>
         1 
       </mn> 
       <mo>
         , 
       </mo> 
       <mn>
         2 
       </mn> 
       <mo>
         , 
       </mo> 
       <mo>
         ⋯ 
       </mo> 
       <mo>
         , 
       </mo> 
       <mi>
         N 
       </mi> 
      </mrow> 
     </math>), we now have an opposite logarithmic connection between the size of a change S and k and the frequency of the change P<sup>i</sup>(C<sup>i</sup>). This has been illustrated in <xref ref-type="fig" rid="fig4">
      Figure 4
     </xref> demonstrating the relationship between the frequency change and the size of coalition change.</p>
    <p>Broadly speaking, Equation (11) states that the probability of a change in coalition structure is greater for lower tiers of the organization matrix than for higher tiers. Equation (12) expresses the probability of a change in coalition structure at a particular level of the matrix as the product of probabilities of change at lower levels. Since lower levels of the organization matrix contain: 1) more potential coalitions and 2) coalitions with ever smaller numbers of activities, then Equation (11) and more general Equation (12) are expressions for self-ordered criticality in organizations. Using the probability of coalitions of different sizes in a coalition structure, they explain:</p>
    <p>1) The nature of self-ordered criticality in organizations.</p>
    <p>2) The reason why self-ordered criticality is an attractor.</p>
    <p>The relationship in <xref ref-type="fig" rid="fig4">
      Figure 4
     </xref> is statistical: low-level changes are more frequent, and high-level changes are less frequent in much the same way as small earthquakes are more frequent than larger ones. The frequency relationship operates over the long run, but we are unable to predict whether in the near future, we will experience small changes with customary frequency or whether we will perceive a large quake: a revolution, a 9/11, a change in an entire system, punctuating the apparent equilibrium.</p>
   </sec>
  </sec><sec id="s6">
   <title>6. Findings and Further Discussion</title>
   <p>The surplus necessary for organizations (or societies) to survive and grow is formed by connecting activities. The main responsibility of decision makers is: 1) to create coalitions among activities that have the possibility to generate a surplus over cost (payoffs), 2) to identify potential payoffs on the organization matrix, 3) to produce connections on the organization matrix between activities so that possible payoffs can be realised and 4) to discover new possibilities. We have come to identify these roles with the terms’ manager and management which really describe status (position, authority, and power to control the distribution of the surplus), rather than function in relation to these roles. Although occasionally status and function coincide, the term strategic decision-maker is preferred.</p>
   <p>The four roles form part of strategic decision-making. We have focussed so far on the first three: evolution and emergence by forming and reforming coalitions, diffusion of evolutionary processes through the entire hierarchy so organizations reach a state of self-ordered criticality where evolution is possible and can be described probabilistically by (11) and (12).</p>
   <p>The discussion has so far assumed the existence of potential payoffs there to be realised. How can we explain the existence of potential payoffs? In addition to the hierarchic levels of the matrix, we can think of the organization matrix ontologically: activities and payoffs occur at distinct levels of being. Two levels have been discussed so far: those that exist in realised space (R), and those that are known to exist in potential (P) but not yet realised. Potential activities or payoffs appear on the left-hand side (1) and (2). The expression for realised payoffs is (3). Potential payoffs emerge from the space (). On this basis, this paper attempts to provide an empirical notion to estimate the potential payoff. However, developing more accurate and realistic measures requires further empirical analysis.</p>
   <p>There is a need for the organisation to bridge the gap between the estimated payoff position (potential payoff) and the realised payoff position (its ontological position). That is a growing organisational challenge. On this notion, the ontological position can be seen as a fictional gallery. All that can be present in the gallery is already in it: call in () as the territory However, the secret assets in the gallery in () just come out to awareness as guests turning groups or singly (coalitions) between rooms in the gallery. To differentiate (), we label the completed set (R), contents that are to hand and seen as items or recalled from the past. Guests to the gallery also have information from booklets, learning from prior experience of what is in nearby spaces and psychological images. We call (P) the potential domain: it is not yet completed, but guests are aware of it. It is possible in the idea that it could be accomplished. We might describe the mapping:</p>
   <p>
    <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
      <mrow> 
       <mo>
         ( 
       </mo> 
       <mi>
         P 
       </mi> 
       <mo>
         ) 
       </mo> 
      </mrow> 
      <mo>
        → 
      </mo> 
      <mrow> 
       <mo>
         ( 
       </mo> 
       <mi>
         R 
       </mi> 
       <mo>
         ) 
       </mo> 
      </mrow> 
     </mrow> 
    </math> (13)</p>
   <p>in March’s terms as exploitation. This expression is the counterpart of (7) new discoveries expressed by the mapping:</p>
   <p>
    <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
      <mrow> 
       <mo>
         ( 
       </mo> 
       <mi>
         Π 
       </mi> 
       <mo>
         ) 
       </mo> 
      </mrow> 
      <mo>
        → 
      </mo> 
      <mrow> 
       <mo>
         ( 
       </mo> 
       <mi>
         P 
       </mi> 
       <mo>
         ) 
       </mo> 
      </mrow> 
     </mrow> 
    </math> (14)</p>
   <p>The domain () is an important part of outer dynamics with respect to the entire organization matrix. The discovery process, imagination, creativity and entrepreneurship, realised as restless technological change is an important dynamic of capitalism in the Schumpeterian system.</p>
   <p>The fictional gallery resembles Plato’s concept of forms and the Jungian theory of archetypes. The organization matrix itself has an archetype: a fractal structure of independence and interdependence. The ontological dimension of the organization matrix, in particular () throws some light on the nature of human intervention (imagination, creativity and entrepreneurship) in the evolution of organizations.</p>
   <p>The second concern of this research is the extent that strategic decision-making can be considered conscious. Decision making to a great extent is about searching for solutions in a complex environment, designing search algorithms in situations where no overall minimax solution exists or can exist, concerned with hard combinatorial problems. One argument implicit in this paper is that organizations will draw to a greater and greater extent upon advances in the major sciences concerned with developing search algorithms. Although there is a vast array of alternatives or scenarios, simulations of search problems often reveal that they fall into many fewer distinct patterns. To the extent that many management problems consist of sifting through alternative coalition structures, they are in principle programmable <xref ref-type="bibr" rid="scirp.134293-29">
     (Nooteboom, 2014)
    </xref>.</p>
   <p>The empirical disposition of the organisational matrix/vectors should be selectively utilized as a part of the organisational decision support system while estimating/designing the organisational structure. As stated in the diagram (arrow diagram across organisational hierarchies), the underlying composition of estimating organisational structure must be developed as a combination of the coalition, payoffs, and active association. As stated, the idea of estimating organisational structure using payoff is derived from using a phenomenological view. We anticipate this ideology can be further extended using artificial intelligent technological capabilities (complex algorithms based on regressions/vector formulas) to estimate the organisational structure with accuracy and accuracy.</p>
   <p>The definition of what constitutes the mind and consciousness in this paper is consistent with <xref ref-type="bibr" rid="scirp.134293-9">
     Chalmers’ (1996)
    </xref> viewpoints. The materialist or functionalist position is accepted up to a point. Strategic decision-making and search can be simulated by strong AI <xref ref-type="bibr" rid="scirp.134293-31">
     (Searle, 1997)
    </xref> up to a point. A form of dualism is accepted in this paper: between decisions based on creative imagination and decisions that can conceivably be programmed or simulated by strong AI. The qualification that may be attached to emergence is important. The view we take is not that consciousness exists but there is a possibility of consciousness. It emerges only with certain conditions are met.</p>
  </sec><sec id="s7">
   <title>7. Conclusion</title>
   <p>This research indicates that the co-evolution approach is productive in overcoming incomplete explanations of the single-lens dimension. However, our study captured at least three key dimensions while investigating the co-evolution between the firms and payoffs. First, we proposed the approach of metrics-driven approach to co-evolution. Such a metrics-driven initiative is crucial for anticipated/realised payoff. Second, we have proved that the single-lens perspective/dimension only provides a partial explanation of the co-evolutions (synergy/payoff). Third, a metrics-driven approach/interpretation can be integrated with the moderation effects of game-theory practices/activity analysis. Thus, these metrics can be applied in quantitative research to explore, recognize and determine the nature of co-evolutions and their classification.</p>
   <p>Choices around corporate structure have been treated in the context of a cooperative game (N&amp;Z) with movable payoffs in the form of economic rents. Efficiency conditions have been exposed to vary in an integrated structure, in which the coalition of all activities is convex, and a subdivided organization, in which the core is vacant. The pathway of an organization matrix oscillates among a formation of positive elements signalling rent or competitive advantage, the effects of competition and variations in the external and internal setting erode a zero value as the position. The role of the centre, by adaptation and learning, is frequently to reconstruct competitive advantage: restructuring the coalitional structure is a significant strategic variable for so doing.</p>
   <p>Some restructuring in organizations is provoked by competitive pressures, generating zeros in the organization matrix, but the degree to which it is accepted by high-rent firms in the public, and even the charitable sector, indicates a progressively ruthless economy. Present concerns, like concentrating on core businesses, reengineering and inner markets, confirm the authority of top management to dispose of assets, including human resources, a metonymy for human beings, at will, and these strategies expand the authority of top managers to reallocate the surplus produced by organizations to their stockholders, themselves and financial arbitrageurs.</p>
   <p>Research limitations are that the strategic payoff is calculated using the numbers/metric approach but not in terms of their magnitude. Thus, the marginal improvements of those activities over time are not captured or not reported. Thus, future researchers may focus on further exploring to what extent the generated metrics can be applied to specific industries or introducing ratio approaches. Further, how an existing co-evolution state/phenomenon can be disrupted by a new entrance either from the same or closely related industry may reveal very interesting insights.</p>
  </sec><sec id="s8">
   <title>NOTES</title>
   <p><sup>1</sup>The explanation (3) resembles that of <xref ref-type="bibr" rid="scirp.134293-6">
     Bak (1997)
    </xref> and <xref ref-type="bibr" rid="scirp.134293-30">
     Prigorgine (1980)
    </xref>. It is related to the idea of managing on the edge of chaos, taken to be a self-adaptive state <xref ref-type="bibr" rid="scirp.134293-19">
     (Kauffman, 1993)
    </xref>. The edge of chaos is often presented as a metaphor in management. The idea of self-adaptation is of course closely related to that of dynamic or core capabilities.</p>
   <p><sup>2</sup>Expression (5) components can be seen as alternative definitions of value chain(s).</p>
   <p><sup>3</sup>That many distributions of payoffs are possible is illustrated by the fact that any weighted average λ<sub>i</sub> (with Σλ<sub>i</sub> = 1) of the Shapley weighting constitutes a feasible distribution.</p>
   <p><sup>4</sup>And since higher-level coalitions (activities) effectively contain lower-level activities (coalitions) we have 
    <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
      <msub> 
       <mi>
         n 
       </mi> 
       <mi>
         m 
       </mi> 
      </msub> 
      <mo>
        ⊇ 
      </mo> 
      <msub> 
       <mi>
         n 
       </mi> 
       <mrow> 
        <mi>
          m 
        </mi> 
        <mo>
          − 
        </mo> 
        <mn>
          1 
        </mn> 
       </mrow> 
      </msub> 
      <mo>
        ⊇ 
      </mo> 
      <msub> 
       <mi>
         n 
       </mi> 
       <mrow> 
        <mi>
          m 
        </mi> 
        <mo>
          − 
        </mo> 
        <mn>
          2 
        </mn> 
       </mrow> 
      </msub> 
      <mo>
        ⊇ 
      </mo> 
      <mo>
        ⋯ 
      </mo> 
      <mo>
        ⊇ 
      </mo> 
      <msub> 
       <mi>
         n 
       </mi> 
       <mn>
         1 
       </mn> 
      </msub> 
     </mrow> 
    </math>.</p>
   <p><sup>5</sup>According to the ergodic hypothesis, the search will traverse all possible coalitions and the equilibrium structure is given as N! (N2! N/2!)<sup>−</sup><sup>1</sup>: <xref ref-type="bibr" rid="scirp.134293-12">
     Georgescu-Roegen (1970)
    </xref> critiques the ergodic hypothesis.</p>
   <p><sup>6</sup>In Kauffman’s systems, evolution takes place at the edge of chaos, the cusp between order and chaos at K = 3. His explanation of the system’s gravitation to the cusp is unrealistic—especially in organizations with many related activities.</p>
  </sec>
 </body><back>
  <ref-list>
   <title>References</title>
   <ref id="scirp.134293-ref1">
    <label>1</label>
    <mixed-citation publication-type="other" xlink:type="simple">
     Adamou, M., Kyriakidou, N.&amp;Connolly, J. (2021). Evolution of Public-Private Partnership: The UK Perspective through a Case Study Approach. International Journal of Organizational Analysis, 29, 1455-1466. &gt;https://doi.org/10.1108/IJOA-08-2020-2397
    </mixed-citation>
   </ref>
   <ref id="scirp.134293-ref2">
    <label>2</label>
    <mixed-citation publication-type="other" xlink:type="simple">
     Alford, C. (2017). Two Approaches for Combining Theories of Change and System Maps. In Too Deep. &gt;https://blog.kumu.io/two-approaches-for-combining-theories-of-change-and-system-maps-5b556091c880
    </mixed-citation>
   </ref>
   <ref id="scirp.134293-ref3">
    <label>3</label>
    <mixed-citation publication-type="other" xlink:type="simple">
     Amit, D. J., Daniel J., Gutfreund H.,&amp;Sompolinsky H. (1985). Storing Infinite Numbers of Patterns in a Spin-Glass Model of Neural Networks. Physical Review Letters, 55, 1530-1533. &gt;https://doi.org/10.1103/PhysRevLett.55.1530
    </mixed-citation>
   </ref>
   <ref id="scirp.134293-ref4">
    <label>4</label>
    <mixed-citation publication-type="other" xlink:type="simple">
     Anjali, S., Weng, M. L., Sumi, J., Satish, K.,&amp;Ciasullo, M. V. (2023). The State of the Art of Strategic Leadership. Journal of Business Research, 158, Article ID: 113676. &gt;https://doi.org/10.1016/j.jbusres.2023.113676
    </mixed-citation>
   </ref>
   <ref id="scirp.134293-ref5">
    <label>5</label>
    <mixed-citation publication-type="other" xlink:type="simple">
     Arstila, V. (2018). Temporal Experiences without the Specious Present. Australasian Journal of Philosophy, 96, 287-302. &gt;https://doi.org/10.1080/00048402.2017.1337211
    </mixed-citation>
   </ref>
   <ref id="scirp.134293-ref6">
    <label>6</label>
    <mixed-citation publication-type="other" xlink:type="simple">
     Bak, P. (1997). How Nature Works: The Science of Self Organized Criticality. Oxford University Press. &gt;https://doi.org/10.1007/978-1-4757-5426-1_2
    </mixed-citation>
   </ref>
   <ref id="scirp.134293-ref7">
    <label>7</label>
    <mixed-citation publication-type="other" xlink:type="simple">
     Bak, P., Tang, C.,&amp;Wiesefeld, K. (1988). Self-Organised Criticality. Physical Review, 38, 364-374. &gt;https://doi.org/10.1103/PhysRevA.38.364
    </mixed-citation>
   </ref>
   <ref id="scirp.134293-ref8">
    <label>8</label>
    <mixed-citation publication-type="other" xlink:type="simple">
     Barbrook, J. P. (2019). Negotiating Complexity in Evaluation Planning: A Participatory Systems Map of the Energy Trilemma. CECAN EPPN. &gt;https://www.cecan.ac.uk/resources 
    </mixed-citation>
   </ref>
   <ref id="scirp.134293-ref9">
    <label>9</label>
    <mixed-citation publication-type="other" xlink:type="simple">
     Chalmers, D. (1996). The Conscious Mind. Oxford University Press. 
    </mixed-citation>
   </ref>
   <ref id="scirp.134293-ref10">
    <label>10</label>
    <mixed-citation publication-type="other" xlink:type="simple">
     Collander, D. (2000). Complexity and the History of Economic Thought. Routledge.
    </mixed-citation>
   </ref>
   <ref id="scirp.134293-ref11">
    <label>11</label>
    <mixed-citation publication-type="other" xlink:type="simple">
     Flier, B., Bosch, F.,&amp;Volberda, H. W. (2003). Co-Evolution in Strategic Renewal Behaviour of British, Dutch and French Financial Incumbents: Interaction of Environmental Selection, Institutional Effects and Managerial Intentionality. Journal of Management Studies, 40, 2163-2187. &gt;https://doi.org/10.1046/j.1467-6486.2003.00416.x
    </mixed-citation>
   </ref>
   <ref id="scirp.134293-ref12">
    <label>12</label>
    <mixed-citation publication-type="other" xlink:type="simple">
     Georgescu-Roegen, N. (1970). The Entropy Law and the Economic Process. Harvard University Press. &gt;https://doi.org/10.4159/harvard.9780674281653
    </mixed-citation>
   </ref>
   <ref id="scirp.134293-ref13">
    <label>13</label>
    <mixed-citation publication-type="other" xlink:type="simple">
     Hamel, G.,&amp;Prahalad, C. K. (1990). The Core Competence of the Corporation. Harvard Business School Press.
    </mixed-citation>
   </ref>
   <ref id="scirp.134293-ref14">
    <label>14</label>
    <mixed-citation publication-type="other" xlink:type="simple">
     Hannah, D. P., Tidhar, R.,&amp;Eisenhardt, K. M. (2021). Analytic Models in Strategy, Organizations, and Management Research: A Guide for Consumers. Strategic Management Journal, 42, 329-360. &gt;https://doi.org/10.1002/smj.3223
    </mixed-citation>
   </ref>
   <ref id="scirp.134293-ref15">
    <label>15</label>
    <mixed-citation publication-type="other" xlink:type="simple">
     Holland, J. H., Holyoak, K. J., Nisbett, R. E.,&amp;Thagard, P. R. (1986). Induction: Processes of Inference, Learning and Discovery. MIT Press. &gt;https://doi.org/10.2307/2183914
    </mixed-citation>
   </ref>
   <ref id="scirp.134293-ref16">
    <label>16</label>
    <mixed-citation publication-type="other" xlink:type="simple">
     Hota, P. K. (2023). Tracing the Intellectual Evolution of Social Entrepreneurship Research: Past Advances, Current Trends, and Future Directions. Journal of Business Ethics, 182, 637-659. &gt;https://doi.org/10.1007/s10551-021-04962-6
    </mixed-citation>
   </ref>
   <ref id="scirp.134293-ref17">
    <label>17</label>
    <mixed-citation publication-type="other" xlink:type="simple">
     Hyunmin, L. (2023). Strategic Similarity in the Co-Evolution of Technological and Business Diversification for Firm Growth: Evidence from Smart-Manufacturing Related Firms. Technological Forecasting and Social Change, 189, Article ID: 122356. &gt;https://doi.org/10.1016/j.techfore.2023.122356
    </mixed-citation>
   </ref>
   <ref id="scirp.134293-ref18">
    <label>18</label>
    <mixed-citation publication-type="other" xlink:type="simple">
     Joshua, S., Bendickson, T. D., Chandler, B. E. J.,&amp;Erik, C. T. (2023). Sourcing Human Capital for Organizational Effectiveness: Sourcing Strategy, Determinants, and Alignment. International Journal of Human Resource Management, 34, 987-1014. &gt;https://doi.org/10.1080/09585192.2021.2016888
    </mixed-citation>
   </ref>
   <ref id="scirp.134293-ref19">
    <label>19</label>
    <mixed-citation publication-type="other" xlink:type="simple">
     Kauffman, S. A. (1993). The Origins of Order, Self-Organisation and Selection in Evolution. Oxford University Press. &gt;https://doi.org/10.1093/oso/9780195079517.001.0001
    </mixed-citation>
   </ref>
   <ref id="scirp.134293-ref20">
    <label>20</label>
    <mixed-citation publication-type="other" xlink:type="simple">
     Kumar, V.,&amp;Srivastava, A. (2023). Mapping the Evolution of Research Themes in Business Ethics: A Co-Word Network Analysis. VINE Journal of Information and Knowledge Management Systems, 53, 491-522. &gt;https://doi.org/10.1108/VJIKMS-10-2020-0199
    </mixed-citation>
   </ref>
   <ref id="scirp.134293-ref21">
    <label>21</label>
    <mixed-citation publication-type="other" xlink:type="simple">
     Lang, X. L., Di, Z., Chen, J., Shi, J.,&amp;Yang, C. (2021). Evolutionary Game Analysis on Behavior Strategies of Multiple Stakeholders in Maritime Shore Power System. Ocean&amp;Coastal Management, 202, Article ID: 105508. &gt;https://doi.org/10.1016/j.ocecoaman.2020.105508
    </mixed-citation>
   </ref>
   <ref id="scirp.134293-ref22">
    <label>22</label>
    <mixed-citation publication-type="other" xlink:type="simple">
     Liu, H., Wu, K.,&amp;Huang, K. (2023). Optimization of Large-Scale UAV Cluster Confrontation Game Based on Integrated Evolution Strategy. Cluster Computing, 27, 515-529. &gt;https://doi.org/10.1007/s10586-022-03961-0
    </mixed-citation>
   </ref>
   <ref id="scirp.134293-ref23">
    <label>23</label>
    <mixed-citation publication-type="other" xlink:type="simple">
     Mohamed Hashim, M. A., Tlemsani, I.,&amp;Duncan Matthews, R. (2022a). A Sustainable University: Digital Transformation and Beyond. Education and Information Technologies, 27, 8961-8996. &gt;https://doi.org/10.1007/s10639-022-10968-y
    </mixed-citation>
   </ref>
   <ref id="scirp.134293-ref24">
    <label>24</label>
    <mixed-citation publication-type="other" xlink:type="simple">
     Mohamed Hashim, M. A., Tlemsani, I.,&amp;Matthews, R. (2021). Higher Education Strategy in Digital Transformation. Education and Information Technologies, 27, 3171-3195. &gt;https://doi.org/10.1007/s10639-021-10739-1
    </mixed-citation>
   </ref>
   <ref id="scirp.134293-ref25">
    <label>25</label>
    <mixed-citation publication-type="other" xlink:type="simple">
     Mohamed Hashim, M. A., Tlemsani, I., Matthews, R., Mason-Jones, R.,&amp;Ndrecaj, V. (2022b). Emergent Strategy in Higher Education: Postmodern Digital and the Future? Administrative Sciences, 12, Article 196. &gt;https://doi.org/10.3390/admsci12040196
    </mixed-citation>
   </ref>
   <ref id="scirp.134293-ref26">
    <label>26</label>
    <mixed-citation publication-type="other" xlink:type="simple">
     Mohamed Hashim, M. A., Tlemsani, I., Matthews, R., Mason-Jones, R.,&amp;Ndrecaj, V. (2024). Higher Education via the Lens of Industry 5.0: Strategy and Perspective. Social Sciences&amp;Humanities Open, 9, Article ID: 100828. &gt;https://doi.org/10.1016/j.ssaho.2024.100828
    </mixed-citation>
   </ref>
   <ref id="scirp.134293-ref27">
    <label>27</label>
    <mixed-citation publication-type="other" xlink:type="simple">
     Morgan, T., Clifton, C. S.,&amp;Yoto, V. Y. (2023). Economic Sanctions: Evolution, Consequences, and Challenges. Journal of Economic Perspectives, 37, 3-30. &gt;https://doi.org/10.1257/jep.37.1.3
    </mixed-citation>
   </ref>
   <ref id="scirp.134293-ref28">
    <label>28</label>
    <mixed-citation publication-type="other" xlink:type="simple">
     Newman, M. (2008). The Physics of Networks. Physics Today, 61, 33-38. &gt;https://doi.org/10.1063/1.3027989
    </mixed-citation>
   </ref>
   <ref id="scirp.134293-ref29">
    <label>29</label>
    <mixed-citation publication-type="other" xlink:type="simple">
     Nooteboom, B. (2014). In What Sense Do Firms Evolve? Jahrbücher für Nationalökonomie und Statistik, 234, 185-209. &gt;https://doi.org/10.1515/jbnst-2014-2-306
    </mixed-citation>
   </ref>
   <ref id="scirp.134293-ref30">
    <label>30</label>
    <mixed-citation publication-type="other" xlink:type="simple">
     Prigorgine, I. (1980). From Being to Becoming. Freeman.
    </mixed-citation>
   </ref>
   <ref id="scirp.134293-ref31">
    <label>31</label>
    <mixed-citation publication-type="other" xlink:type="simple">
     Searle, J. R. (1997). The Mystery of Consciousness. Granta Books.
    </mixed-citation>
   </ref>
   <ref id="scirp.134293-ref32">
    <label>32</label>
    <mixed-citation publication-type="other" xlink:type="simple">
     Shaymardanov, M., Heikkinen, S.,&amp;Lämsä, A. M. (2023). Social Networks of Women in Organizations: Evolution of Research and Future Research Agenda. South Asian Journal of Business and Management Cases, 12, 97-112. &gt;https://doi.org/10.1177/22779779231154647
    </mixed-citation>
   </ref>
   <ref id="scirp.134293-ref33">
    <label>33</label>
    <mixed-citation publication-type="other" xlink:type="simple">
     Tanushree, S. C. K.,&amp;Chaubey, A. (2023). Evolution of Organizational Agility Research: A Retrospective View. Benchmarking: An International Journal, 31, 1181-1224. &gt;https://doi.org/10.1108/BIJ-02-2023-0086
    </mixed-citation>
   </ref>
   <ref id="scirp.134293-ref34">
    <label>34</label>
    <mixed-citation publication-type="other" xlink:type="simple">
     Tlemsani, I. (2010). Co-Evolution and Reconcilability of Islam and the West: The Context of Global Banking. Journal of Education, Business and Society: Contemporary Middle Eastern Issues, 3, 262-276. &gt;https://doi.org/10.1108/17537981011089569
    </mixed-citation>
   </ref>
   <ref id="scirp.134293-ref35">
    <label>35</label>
    <mixed-citation publication-type="other" xlink:type="simple">
     Tlemsani, I. (2019). Comparative Study of the Islamic Interbank Benchmark Verses Conventional Rates. Journal of Islamic Marketing, 11, 1351-1365, &gt;https://doi.org/10.1108/JIMA-03-2019-0053
    </mixed-citation>
   </ref>
   <ref id="scirp.134293-ref36">
    <label>36</label>
    <mixed-citation publication-type="other" xlink:type="simple">
     Tlemsani, I. (2020). Stock Returns Indicator: Case of Tadawul. International Journal of Monetary Economics and Finance, 13, 1-15. &gt;https://doi.org/10.1504/IJMEF.2020.10024445
    </mixed-citation>
   </ref>
   <ref id="scirp.134293-ref37">
    <label>37</label>
    <mixed-citation publication-type="other" xlink:type="simple">
     Tlemsani, I. (2022). Conventional vs Islamic Debt-Equity Portfolio Swaps. International Journal of Managerial and Financial Accounting, 14, 20-34. &gt;https://doi.org/10.1504/IJMFA.2022.120938
    </mixed-citation>
   </ref>
   <ref id="scirp.134293-ref38">
    <label>38</label>
    <mixed-citation publication-type="other" xlink:type="simple">
     Tlemsani, I.,&amp;Al Suwaidi, H. (2016). Comparative Analysis of Islamic and Conventional Banks in the UAE during the Financial Crisis. Asian Economic and Financial Review, 6, 298-309. &gt;https://doi.org/10.18488/journal.aefr/2016.6.6/102.6.298.309
    </mixed-citation>
   </ref>
   <ref id="scirp.134293-ref39">
    <label>39</label>
    <mixed-citation publication-type="other" xlink:type="simple">
     Tlemsani, I.,&amp;Matthews, R. (2010). The Financial Tower of Babel: Roots of Crisis. International Journal of Islamic and Middle Eastern Finance&amp;Management, 3, 334-350. &gt;https://doi.org/10.1108/17538391011093270
    </mixed-citation>
   </ref>
   <ref id="scirp.134293-ref40">
    <label>40</label>
    <mixed-citation publication-type="other" xlink:type="simple">
     Tlemsani, I.,&amp;Matthews, R. (2021). Games Theory and Strategic Alliances: Applications to British Russian Partnership. Higher Education, Skills and Work-Based Learning, 12, 689-704. &gt;https://doi.org/10.1108/HESWBL-02-2021-0036
    </mixed-citation>
   </ref>
   <ref id="scirp.134293-ref41">
    <label>41</label>
    <mixed-citation publication-type="other" xlink:type="simple">
     Tlemsani, I., Matthews, R.,&amp;Mohamed Hashim, M. A. (2023a). Revisiting Zakat with a Distribution of Weighted Shapley Value. International Journal of Islamic and Middle Eastern Finance&amp;Management, 16, 1141-1158. &gt;https://doi.org/10.1108/IMEFM-11-2022-0430
    </mixed-citation>
   </ref>
   <ref id="scirp.134293-ref42">
    <label>42</label>
    <mixed-citation publication-type="other" xlink:type="simple">
     Tlemsani, I., Mohamed Hashim, M. A.,&amp;Matthews, R. (2023b). Portfolio Replication: Islamic vs Conventional. Journal of Islamic Accounting and Business Research, 14, 1-20. &gt;https://doi.org/10.1108/JIABR-09-2021-0261
    </mixed-citation>
   </ref>
   <ref id="scirp.134293-ref43">
    <label>43</label>
    <mixed-citation publication-type="other" xlink:type="simple">
     Tlemsani, I., Mohamed Hashim, M. A.,&amp;Matthews, R. (2023c). The Impact of IFRS Adoption on Saudi Arabia. Journal of Islamic Accounting and Business Research, 14, 519-533. &gt;https://doi.org/10.1108/JIABR-11-2022-0304
    </mixed-citation>
   </ref>
   <ref id="scirp.134293-ref44">
    <label>44</label>
    <mixed-citation publication-type="other" xlink:type="simple">
     Vancleef, K., Demeyere, N.,&amp;Sun, L. (2021). Shortening the Leuven Perceptual Organisation Screening Test with Item Response Theory and Confirmatory Factor Analysis. &gt;https://doi.org/10.31234/osf.io/8vsm3
    </mixed-citation>
   </ref>
   <ref id="scirp.134293-ref45">
    <label>45</label>
    <mixed-citation publication-type="other" xlink:type="simple">
     Wang, Y., Liu, Z.,&amp;Wang, G.-G. (2023a). Improved Differential Evolution Using Two-Stage Mutation Strategy for Multimodal Multi-Objective Optimization. Swarm and Evolutionary Computation, 78, Article ID: 101232. &gt;https://doi.org/10.1016/j.swevo.2023.101232
    </mixed-citation>
   </ref>
   <ref id="scirp.134293-ref46">
    <label>46</label>
    <mixed-citation publication-type="other" xlink:type="simple">
     Wang, Z., Lan, H.,&amp;Zhang, M. (2023b). Organizational Evolution of Project Management Teams over the Whole Lifecycle of Megaprojects: Case Study of the Hong Kong Zhuhai Macao Bridge. Frontiers of Engineering Management, 10, 439-454. &gt;https://doi.org/10.1007/s42524-022-0211-7
    </mixed-citation>
   </ref>
   <ref id="scirp.134293-ref47">
    <label>47</label>
    <mixed-citation publication-type="other" xlink:type="simple">
     Wilkinson, H., Hills, D., Penn, A.,&amp;Barbook, P. (2021). Building a System-Based Theory of Change Using Participatory Systems Mapping. Evaluation, 27, 80-101. &gt;https://doi.org/10.1177/1356389020980493
    </mixed-citation>
   </ref>
   <ref id="scirp.134293-ref48">
    <label>48</label>
    <mixed-citation publication-type="other" xlink:type="simple">
     Xiao, H., Wang, Y.,&amp;Fang, O. (2021). On the Convexity of Independent Set Games. Discrete Applied Mathematics, 291, 271-276. &gt;https://doi.org/10.1016/j.dam.2020.09.025
    </mixed-citation>
   </ref>
   <ref id="scirp.134293-ref49">
    <label>49</label>
    <mixed-citation publication-type="other" xlink:type="simple">
     Xiao, X., Yin, J., Chen, L. et al. (2023). Evolutionary Game-Theoretic Modeling of Massive Distributed Renewable Energy Deployment towards Low-Carbon Distribution Networks. Journal of Modern Power Systems and Clean Energy, 11, 1519-1528. &gt;https://doi.org/10.35833/MPCE.2022.000434
    </mixed-citation>
   </ref>
   <ref id="scirp.134293-ref50">
    <label>50</label>
    <mixed-citation publication-type="other" xlink:type="simple">
     Yang, W., Si, Y., Zhang, J., Liu, S.,&amp;Appolloni, A. (2021). Coordination Mechanism of Dual-Channel Supply Chains Considering Retailer Innovation Inputs. Sustainability, 13, Article 813. &gt;https://doi.org/10.3390/su13020813
    </mixed-citation>
   </ref>
  </ref-list>
 </back>
</article>