Next Article in Journal
Novel Numerical Investigation of Reaction Diffusion Equation Arising in Oil Price Modeling
Previous Article in Journal
The Explicit Form of the Unitary Representation of the Poincaré Group for Vector-Valued Wave Functions (Massive and Massless), with Applications to Photon Localization and Position Operators
Previous Article in Special Issue
Portfolio Construction: A Network Approach
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Review

Dynamics of Social Influence and Knowledge in Networks: Sociophysics Models and Applications in Social Trading, Behavioral Finance and Business

by
Dimitris Tsintsaris
,
Milan Tsompanoglou
and
Evangelos Ioannidis
*
School of Economics, Aristotle University of Thessaloniki, 54124 Thessaloniki, Greece
*
Author to whom correspondence should be addressed.
Mathematics 2024, 12(8), 1141; https://doi.org/10.3390/math12081141
Submission received: 8 March 2024 / Revised: 2 April 2024 / Accepted: 8 April 2024 / Published: 10 April 2024
(This article belongs to the Special Issue Complex Network Modeling: Theory and Applications, 2nd Edition)

Abstract

:
In this paper we offer a comprehensive review of Sociophysics, focusing on relevant models as well as selected applications in social trading, behavioral finance and business. We discuss three key aspects of social diffusion dynamics, namely Opinion Dynamics (OD), Group Decision-Making (GDM) and Knowledge Dynamics (KD). In the OD case, we highlight special classes of social agents, such as informed agents, contrarians and extremists. As regards GDM, we present state-of-the-art models on various kinds of decision-making processes. In the KD case, we discuss processes of knowledge diffusion and creation via the presence of self-innovating agents. The primary question we wish to address is: to what extent does Sociophysics correspond to social reality? For that purpose, for each social diffusion model category, we present notable Sociophysics applications for real-world socioeconomic phenomena and, additionally, we provide a much-needed critique of the existing Sociophysics literature, so as to raise awareness of certain issues that currently undermine the effective application of Sociophysics, mainly in terms of modelling assumptions and mathematical formulation, on the investigation of key social processes.

1. Overview of Sociophysics

Two-and-a-half millennia ago, Greek philosopher Democritus posited the existence of “atoms”, tiny indivisible material components, anticipating the emergence of the atomic theory in the 19th century. In ancient and modern forms of the Greek language, the term “atom” (ἄτομον) is interpreted as “indivisible, uncut”. The very same etymology is applied to the modern English term “individual” (derived from the Latin term individuus, again meaning indivisible), denoting a person. Moreover, in Modern Greek the term άτομο can be used interchangeably, either with a natural or a social connotation.
In a sense, the use of the same term to characterize two fundamentally different concepts (one referring to an inanimate object and the other to a living entity) might seem paradoxical, particularly under the scope of the Enlightenment notion of man as an essentially free creature, unconstrained by the influence of necessity expressed in universal natural laws. However, from the 17th century onwards, thinkers like Thomas Hobbes (1588–1679), David Hume (1711–1776), Henri de Saint-Simon (1760–1825) and others expressed a somewhat strange hope that the social sphere would someday become the domain of a new positive science. The idea of “social physics” appears in explicit form in the work of French philosopher August Comte (1798–1857), who postulated the existence of objective, unchanging laws regulating the collective behavior of social groups [1]. This idea really acquired traction only in the last quarter of the 20th century with the emergence of concepts like complex systems, self-organization and chaos. Săvoiu and Iorga Simăn [2] aptly define Sociophysics as follows: “Sociophysics can be described as the sum of activities of searching for fundamental laws and principles that characterize human behavior and result in collective social phenomena.”
Before and after the term “Sociophysics” emerged, various quantitative studies presented impressive and often counter-intuitive findings on social phenomena, such as racial segregation [3], opinion polarization [4,5], social imitation [6], workers’ strike processes [7], alliance formation [8] and cultural dissemination [9]. In this context, the behavior of individuals has been implicitly or explicitly compared to that of atoms or molecules floating in a medium, with patterns of repellence and attraction depending on their inherent attributes [10]. Accordingly, Agent-Based Modelling (ABM), Social Network Analysis (SNA) [11] and Network Science in general have been naturally integral to the Sociophysics discipline [12]. Therefore, the underlying principle of Sociophysics is the proposal that relatively simple rules defining the behavior of interacting individuals/agents (micro level) lead to the emergence of a very complex social structure (macro level).
Three of the most promising instantiations of Sociophysics research are Opinion Dynamics (OD), Group Decision Making (GDM) and Knowledge Dynamics (KD). OD, GDM and KD, through the application of ABM and SNA principles, describe how opinion (in the form of ideas, cultural norms, memes, etc.), consensus (i.e., a commonly accepted outlook on how to act) and knowledge (e.g., true information, innovations, empirically justified truths, etc.) are respectively diffused in various social networked environments. In the 21st century information society [13], one of the most prominent and impactful social spaces is the one constituted by the interactions between financial agents (e.g., entrepreneurs, firms, traders, etc.). Econophysics [14,15], the economics-based sub-category of Sociophysics, models the behavior of a not-so-rational homo οeconomicus and the influence that interactions between financial agents have on the determination of asset prices.
Taking the former thoroughly into account, three central questions on the field of Sociophysics and its application in the real social world emerge, namely the following:
Q1: what are the most important proposed Sociophysics models in the domains of OD, GDM and KD and in what way does each one of them aim to mathematically represent the occurrence of social interaction between agents and the emerging socioeconomic phenomena?
Q2: in what forms “bridges” between theoretical Sociophysics models and real-world applications in the domain of Economics and related subdomains such as Social Trading, Behavioral Finance and Business are erected?
Q3: given the great importance of Sociophysics, in what ways—known and unknown—does the field fail to accurately capture the inner workings of social reality?
This review paper aims to provide answers to the above three questions. We believe that our adoption of a wide-ranging scope, taking good care to clarify the distinctions between different categories of social diffusion, and mainly our concurrent attempt to showcase both the advantages (evident in real-world socioeconomic applications) and shortcomings of the Sociophysics field (e.g., misalignment between Sociophysics modelling assumptions and social reality) form a “big picture” that an analysis focused only on particular aspects of Sociophysics may miss. We believe that current analyses on Sociophysics fail to capture in toto the current status of the discipline, its successes and mainly its more elusive shortcomings, especially as regards its ontological distinction from Physics and the related current inadequacies in the correspondence between Sociophysics and social reality. We naturally wish to cover this particular gap by offering a critical view on Sociophysics and its applications.
Accordingly, this review has the following structure: Firstly, the existing literature on diffusion dynamics in social networks is comprehensively discussed. Therefore, important studies, models and selected applications in OD (Section 2), GDM (Section 3) and KD (Section 4) are presented (Q1) and for each model category certain noteworthy applications in Economics and related subfields are highlighted (Q2). Secondly, a critical evaluation of the existing relevant literature (Q3) is conducted (Section 5), so as to investigate how Sociophysics could further enhance its social relevance and solidify its status as a mathematics-based applied social science, whose findings may provide crucial insights on various aspects of social reality.

2. Opinion Dynamics (OD)

2.1. Linear Models

Over the previous decades, a growing body of literature on OD has offered mathematical model formulations simulating how opinion is diffused across social networks. A social network consists of N agents interacting through a set of connections/links [11]. In the simplest case (undirected network), between two communicating agents i and j there exists a single link with an influence weight w i j .
The earlier approaches (from the 1950s to the 1990s) on OD are predominantly linear in nature [16,17,18,19,20,21,22], in the sense that communication patterns and interaction structure remains fixed. Among these, of special importance are the DeGroot model [18,22] and the Friedkin-Jensen model (FJ) [20,21].
In the DeGroot model the evolution of the opinion of agent i , usually taking values in the interval [ 0 ,   1 ] , is given as a linear combination (in particular a weighted average, since j = 1 N w i j = 1 ) of the opinions of all other communicating agents:
o i t + 1 = j = 1 N w i j o j t .  
Hence, the opinion vector O for all agents at time step t + 1 will be updated accordingly: O ( t + 1 ) = W · O ( t ) . Thus, the opinion vector at a later time step τ is of the form: O ( t + τ ) = W τ · O ( t ) . According to [18], if at least one column of matrix W τ contains only positive elements, then consensus is eventually attainable.
The FJ model is a variant of the DeGroot model, in the sense that it takes into account agent i ’s stubbornness, s i , i.e., the tendency to adhere to his initial opinion. The degree of influence from the other agents is set at 1 s i . Opinion evolution can be written as:
  o i t + 1 = s i o i 0 + 1 s i j = 1 N w i j o j t .  
The above formula can be expressed in matrix form as O ( t + 1 ) = S · O ( 0 ) + ( I S ) · W · O ( t ) , where S is a N × N diagonal matrix containing the elements s i . In contrast to the DeGroot model, the regularity of matrix W τ does not necessarily entail convergence. Consensus is conditional on the stubbornness level of the agents.

2.2. Non-Linear Models

A rising number of non-linear approaches have also made their appearance in the literature. Non-linearity may emerge when influence weights and/or specific communication interactions are conditioned on agent opinions in previous time steps.
Non-linear models can be divided into three main categories: continuous, discrete and mixed. In continuous models, the opinion of the agents can take any value in a particular interval, e.g., 0 ,   1 or 1 ,   1 . In discrete models, the opinion of the agents can take only specific values, mostly of binary form (e.g., 0 / 1 , yes/no, support/opposition, buy/sell). Finally, in mixed models, the continuous opinions of the agents are expressed as discrete choices. For all the above cases, there are also multi-dimensional (vector) representations of agent opinions [23,24].

2.2.1. Continuous Models

Among the non-linear continuous models found in the OD literature, the most prominent ones belong to the Bounded Confidence class of models [25,26,27]. Bounded Confidence models operate under the assumption that social influence is possible only when the opinions o i ( t ) and o j ( t ) of two neighboring agents i and j are sufficiently close, below a certain tolerance threshold ε :
  o j t o i t < ε .  
The most well-known Bounded Confidence models are the Hegselmann-Krause (HK) model [28,29,30] and the Deffuant-Weisbuch (DW) model [31,32,33]. Their primary distinction lies in the communication assumption employed in each case: in the HK model, each agent communicates simultaneously with all sufficiently like-minded neighbors, while in the DW model communication is realized between two random like-minded neighbors at a time.
Hence, in the HK model, the opinion of agent i evolves in the following manner:
  o i t + 1 = 1 S i ε j S i ε o j t ,  
where S i ε = { j : o j t o i t < ε } is the set containing those neighbors j of agent i with a sufficiently close opinion to his own.
On the other hand, in the DW model, when two agents communicate and condition ( 3 ) is satisfied, a mutual opinion update takes place in the following fashion:
o i t + 1 = o i t + μ o j t o i t , o j t + 1 = o j t + μ o i t o j t ,  
with μ a parameter determining the rate of convergence between agents i and j . When the tolerance threshold ε is high enough, widespread opinion convergence is possible, whereas when ε is low, opinion clustering among groups of agents is observed.

2.2.2. Mixed Models

Sophisticated mixed models, such as the continuous opinion and discrete actions (CODA) model [34,35,36] have also been developed. In the prominent CODA model, an agent i internalizes his preference at time step t in the form of a continuous probability p i ( t ) and expresses to other agents his quantized binary opinion o i ( t ) = s i g n ( p i ( t ) 0.5 ), taking values 1 or 1 . Whenever an agent i is influenced by an agent j , his internalized preference, expressed in log-odds form as u i ( t ) = log p i ( t ) 1 p i ( t ) , shifts to u i t + 1 = u i t ± a i = u i t + o j ( t ) a i with a i the susceptibility parameter of agent i to the opinion o j ( t ) of his neighbor j . Consequently, p i ( t + 1 ) p i ( t ) and thus it is probable that, under the influence of his neighbor, agent i will change his professed opinion o i ( t + 1 ) o i ( t ) . In this manner, opinion diffusion can take place.

2.2.3. Discrete Models

As regards discrete OD modelling, much attention has been given to the voter model [37,38], the Sznajd model [39,40,41,42] and the majority rule model [43,44,45,46].
In the voter, model agents are placed in a square lattice. Agent opinion o i ( t ) is of strictly binary type, i.e., 0 or 1 . At each time step, an agent i will randomly adopt the opinion o j ( t ) of a neighbor j , i.e., o i t + 1 = o j ( t ) .
In the Sznajd model, agents are placed on a line. At each step, a pair of neighboring agents i and i + 1 is randomly selected. If their opinions are identical, then the adjacent agents i 1 and i + 2 will be jointly influenced as follows: o i 1 t + 1 = o i + 2 t + 1 = o i + 1 t = o i ( t ) . On the other hand, if their opinions differ, then each agent will influence only his other neighbor, i.e., o i 1 t + 1 = o i ( t ) and o i + 2 t + 1 = o i + 1 t .
The majority rule model concerns voting at different hierarchical levels. In the simplest case, at each hierarchical level the population is randomly clustered in groups of three agents. In each group, the three members vote between two candidates (type A or type B). The voting result at hierarchical level 1 influences the composition of the population at level 2. After clustering in groups of three at level 2, the same process is to be repeated until vote convergence is observed. The probability for a type A candidate to be elected at level n + 1 is as follows:
p A n + 1 = p A 3 n + 3 p A 2 n 1 p A n ,  
where p A ( n ) is the probability that a type A candidate was elected at level n .
It can be shown that when p A ( 0 ) < 1 2 , the probability sequence p A ( n ) converges to zero. Hence, the existence of A is eliminated. On the other hand, when p A ( 0 ) > 1 2 , the sequence converges to 1 and the prevalence of A is certain. The key finding is that, although the electoral process operates in a fully democratic manner, the condition p A ( 0 ) > p B ( 0 ) (or the reverse) is sufficient for a “totalitarian” result to eventually emerge. One of the two political positions (A or B) will be all but excluded, regardless of the amount of initial support for B or A.
Counter-intuitive findings, as the above, demonstrate the usefulness of Sociophysics for the disclosure of well-hidden “holes” in seemingly robust social or political processes that qualitative studies are often unable to detect. Certain “bottom-up” multi-stage electoral systems like the ones found in socialist or even liberal democratic states (e.g., the US presidential electoral system) operate in a manner which bears certain similarities to the one proposed in the majority rule model.

2.3. Special Classes of Social Agents

Certain continuous OD models focus on the impact of special classes of social agents on the opinion diffusion process in the network. Such agents operate in a particular manner that distinguish them from other agents they interact with. These special categories of agents (informed, contrarian and extremist) are discussed below.

2.3.1. Informed Agents

It has been noted that apart from the existence of key opinion leaders or influentials who spread their opinions to the rest of the population [47,48,49,50], the presence of a «critical mass of easily influenced individuals» is also essential for effective social influence [51]. From this critical mass a cascading effect begins, leading to widespread social influence.
Along these lines, a large segment of the available literature on OD focuses on the impact of informed agents, i.e., individuals with hidden agendas who act as secret advertisers of ideas and norms to the rest of the population. Prominent studies on informed agents [52,53] are grounded on findings derived from studies on animal population dynamics [54,55], suggesting that the collective behavior of social groups can be guided by a small fraction of purposeful agents.
For example, in [52], taking into account the bounded confidence assumption ( 3 ) , opinion diffusion from regular agent j to regular agent i is realized as follows: o i t + 1 = w i i ( t ) o i t + w j i ( t ) o j t , where w j i ( t ) denotes the interpersonal social influence of agent j on agent i and w i i ( t ) denotes the tendency of agent i to adhere to his opinion at time t . However, for an informed agent κ , a third parameter, w κ g ( t ), indicating hidden devotion to the pursuance of a pre-specified goal o g is added. Therefore, opinion diffusion from regular agent λ to informed agent κ is realized as follows:
  o κ t + 1 = w κ κ t ο κ t + w λ κ t ο λ t + w κ g t o g .  
In the general case, an informed agent may also become influenced by other agents. Still, the presence of an unchanging pre-set goal makes possible to steer public opinion using only a small set of informed agents in the social network, especially when these are well-connected individuals. Note that informed agents are not necessarily prominent members of society.
An even more fleshed out approach on the processes of social change induced by informed agents, or rather change agents, has been presented in [56]. Change agents mimic the opinions of their neighbors and, at the same time, attempt to divert them towards a preferred direction. They gradually shift their neighbors’ opinions towards a pre-set goal, so as to commence a cascading diffusion of social influence. Therefore, the strategy of “salami slicing” is incorporated into the opinion diffusion equation of a change agent.
Whereas opinion diffusion for regular agents is of a form similar to other DW-derived implementations, for a change agent κ , opinion update operates in the following manner:
  o κ t + 1 = o ¯ κ o u t t + s κ t o g o ¯ κ o u t t ,  
where o ¯ κ o u t t = 1 | S κ + | λ S κ + o λ ( t ) is the average opinion of all out-neighbors of κ to whom agent κ is connected with a positive outgoing (directed) link weight w κ λ . This set is denoted by S κ + = { λ :   w κ λ = w κ λ > 0 } . Additionally, s κ t is a time-dependent slicing parameter lying in the interval 0 ,   1 , indicating “thin” (gradual) shift of the change agent’s professed opinion. In this way, the change agent κ is able to induce opinion change to his out-neighbors, whose average opinion o ¯ κ o u t t is incorporated in the change agent’s public stance.

2.3.2. Contrarian Agents

Contrarians are agents who tend to disagree with the majority. According to [57], one way to model the influence of contrarians is to simply refine the majority rule model found in [43,44,45]. Contrarian agents are presumed to be found in the general population with a density a . In this way, they might induce a shift in electoral outcomes of lower-level groups. Therefore, ( 6 ) is modified accordingly:
  p A t + 1 = 1 a p A 3 t + 3 p A 2 t 1 p A t + a p B 3 t + 3 p B 2 t 1 p B t ,  
where p A ( n ) and p B n are the probabilities that a candidate of type A or B is elected at level n .
A positive outcome of the presence of contrarian agents is that the totalitarian outcome of the majority rule model is averted for small values of a . For example, a = 0.1 leads to opinion convergence of the form 0.85 to 0.15 in favor of outcome A, not 1 to 0 .

2.3.3. Extremist Agents

Extremists are agents whose opinion lies on the edges of the opinion interval [58,59,60,61]. For example, if agent opinions take values in the interval [ 1 ,   1 ] , then agent opinion for an extremist agent takes values very close or equal to 1 or 1 .
In [59], it is proposed that if extremist agents are present in a social network, their extremist views can eventually become widely accepted, provided that there exists opinion uncertainty among regular agents. Uncertainty is modeled assuming the existence of opinion segments s i = o i u i ,   o i + u i   , where o i indicates opinion and u i uncertainty. The segment overlap h j i between two agents i and j is: h j i = min o j + u j ,   o i + u i max ( o j u j ,   o i u i ) , whereas the non-overlapping part is 2 u j h j i .
Subtraction of the two quantities divided by u j gives the relative agreement term h j i u j 1 . Hence, on the condition that h j i > u j , opinion diffusion from an agent j to a neighbor agent i is possible and the DW Equation ( 5 ) for agent i take the form:
o i t + 1 = o i t + μ · h j i t u j t 1 o j t o i t ,   u i t + 1 = u i t + μ · h j i t u j t 1 u j t u i t ,  
where μ is a convergence parameter determining the speed of the diffusion process.
Due to the fact that an extremist agent j has narrower opinion uncertainty u j than a regular agent, the condition h j i > u j is usually fulfilled when regular agents interact with extremists. Hence, diffusion and, in some cases, prevalence of extremist opinions becomes possible.

2.4. Applications in Behavioral Finance/Social Trading

One of the most fruitful applications of OD is in the field of behavioral finance/social trading [62]. The application of OD in finance, aiming to model the behavior of financial social agents, has a rather strong empirical foundation due to the existence of sociological studies [63,64], suggesting that price formation is partially dependent on the social influence that financial agents (firms, traders, entrepreneurs, investors, finfluencers, etc.) exert on each other.
Financial agents act semi-rationally at best and, due to their unavoidable social embeddedness, they are heavily influenced by the preferences of their peers. Personal bias also seems to have a rather strong impact on individual behavior. Thus, it seems that financial agents do not always follow a rationalist modus operandi; behavioral short-termism is common [65]. However, despite their bounded rationality [66], agent behavior can still be mathematically modeled and simulated via the appropriate application of ABM principles. This is one of the most important benefits of the Sociophysics approach and its economics-oriented sub-field, Econophysics.

2.4.1. Discrete Models

Certain discrete OD models applied on behavioral finance are based on previous studies from the field. One notable example is found in [67], where a generalized version of the financial Brock-Hommes model [68], which assumes that all investors interact with each other, is applied on several different network topologies.
In [67], the opinion (investment behavior) of agent i at time t + 1 shifts according to the opinions of his neighbors on previous time t . The opinion o i t of agent i is binary with 0 indicating a “fundamentalist” behavior and 1 indicating a “chartist” behavior. A chartist is an investor who evaluates assets based on a technical analysis of historical price trends. The basic assumption is that all necessary information is already incorporated into the current price. A fundamentalist is an investor who evaluates assets based on α fundamental analysis. The goal of a fundamentalist is to determine whether an asset is overvalued, undervalued or fairly valued by the market, and then make investment decisions based on this analysis.
The probability p i c t + 1 that agent i will be of the chartist type at time t + 1 is as follows:
p i c t + 1 = o i t j S i o j t + o i t 1 j S i o j t + 1 o i t 1 j S i 1 o j t   P β c > f t + 1 .
The above formula can be summarized as follows:
p i c t + 1 =                 1                     w h e n   o i t = 1   a n d   o j t = 1   j S i                   0                     w h e n   o i t = 0   a n d   o j t = 0   j S i P β c > f t + 1   o t h e r w i s e
where S i is the set of neighbors of agent i , and P β c > f t + 1 is a logistic probability indicating the extent that the chartist position is preferable over the fundamentalist one:
  P β c > f t + 1 = 1 1 + e β U f t + 1 U c t + 1
Here, β is a parameter indicating intensity of choice due to idiosyncratic preferences and personality biases and U f t + 1 ,   U c ( t + 1 ) are utility indices resulting from a fundamentalist (f) or chartist (c) position, respectively, taking into account the asset performance in previous time steps.
According to ( 11 ) , p i c t + 1 = 1 when all neighbors j S i of agent i and i himself are of the chartist type, and p i c t + 1 = 0 when all neighbors j S i and i himself are of the fundamentalist type. When the opinions of neighbors are not all of the same type, then the probability that agent i is of the chartist type is: p i c t + 1 = P β c > f t + 1 .
In an another relevant study [69], a three-state probabilistic OD model is proposed in which opinion represents available options (buy, sell or do nothing) forming the set s = { 1 ,   2 ,   3 } . Agents are split into two categories, noise “traders” and noise “contrarians”. Noise traders tend to align with the local majority of their neighbors. Noise contrarians take into account all agents (not only their neighbors) and tend to adopt the opinion of the minority. The status of each agent (trader or contrarian) is unchanging in time. The probability that an agent (trader or contrarian) will not follow the above-described behavior is p . For example, assuming that the local majority of a noise trader at time t prefers the “buy” option ( 1 ), the probabilities at time t + 1 are as follows:
P o i t r a d e r t + 1 = 1 N i 1 > N i 2     N i 1 > N i 3 = 1 p ,   P o i t r a d e r t + 1 = 2 N i 1 > N i 2     N i 1 > N i 3 = p 2 ,   P o i t r a d e r t + 1 = 3 N i 1 > N i 2     N i 1 > N i 3 = p 2 ,
where
N i 1 = j : j S i   w i t h   o j t = 1 , N i 2 = j : j S i   w i t h   o j t = 2 ,   N i 3 = j : j S i   w i t h   o j t = 3 ,
the number of neighbors of agent i having the corresponding states 1 ,   2 and 3 . Due to its probabilistic character, the model is of a similar nature to other similar approaches on the majority rule model [70,71,72,73], first described in Section 2.2.3.

2.4.2. Continuous Models

As regards asset price dynamics, opinion (investment behavior) may take continuous values. For example, in [74] the expectation of agent i about the future price of an asset is influenced by the opinion of all other N agents, including himself:
  E i t = j = 1 N w i j o j t .  
The above linear formula is similar to the DeGroot opinion update in ( 1 ) . Each agent invests a relative amount of wealth w i t equal to the product of his price expectation E i t with his capital ratio c i ( t ) , denoting the capital share of agent i over the total capital invested in this specific asset. The asset price at time t is defined as:
  v t = i = 1 N w i t = i = 1 N E i t c i t .  
The opinion of agent i about the future asset price is a function of the price v t in the previous m i time steps, i.e., o i t + 1 = f v t ,   v t 1 , . , v t m i .
Νon-linear formulations have also been proposed. In a notable recent study [75], the OD Equation ( 5 ) is used for the description of asset price dynamics. The excess demand D μ ( t ) for an asset μ is defined as the sum of the distances between the opinion o i μ t [ 0 ,   1 ] of agent i about the price of asset μ and its normalized price p μ t [ 0 ,   1 ] . The normalized price is defined as p μ t = p μ t ξ p ξ t , where p μ t is the price of asset μ . Hence, the excess demand is D μ ( t ) = ε i o i μ t p μ t , where ε ~ N ( 0 , σ ) is a random noise element having a “quenching” influence on excess demand. Accordingly, price dynamics can be described in the following manner:
  p μ t + 1 =                         1                         i f   p μ t + D μ t > 1 p μ t + D μ t   i f   p μ t + D μ t 0 ,   1                         0                         i f   p μ t + D μ t < 0   .
In [76,77], another non-linear model is developed, in which network structure is considered to be evolving in time. Each agent i is characterized by the following two attributes: his opinion o i t representing his attitude on risk-taking and his reputation r i t as an investor among his peers. The reputation r i t depends on his wealth w i t and his charisma c i , as follows: r i t = 1 h w i t + h c i , with h [ 0 ,   1 ] a coefficient indicating irrationality. Wealth evolution is dependent on his previous wealth level w i t and his risk-taking attitude o i t as follows: w i t + 1 = f w i t , o i t . Opinion update, bearing similarities to both the HK ( 4 ) and the FJ model ( 2 ) , is written as
  o i t + 1 = s i o i 0 + 1 s i 1 S i t j S i t o j t ,   S i t > 0 o i 0 ,   S i t = 0  
where s i is the stubbornness of agent i and S i ( t ) = j : a j i t = 1 is the set of neighbors j of agent i at time t , with a j i t the corresponding time-dependent element of the adjacency matrix:
  a j i t = 1 ,   σ j i t > 0.5 0 ,   e l s e w h e r e  
where σ j i t is the activation function, determining whether the corresponding link a j i t becomes activated or deactivated. The dynamics of σ j i t depend on the reputation difference r j t r i t between agents j and i , as follows:
  φ d 2 σ j i d t 2 , d σ j i d t ,   σ j i t = 1 a j i t max 0 ,   1 a j i t r j t r i t .  
The reputation difference r j t r i t is analogous to the opinion difference found in ( 3 ) , used in the original HK model and other non-linear models. However, contrary to the original HK model, network structure evolves due to the presence of a co-evolution mechanism [78,79,80]. Specifically, the reputation of an agent increases due to wealth accumulation. This leads to shifts in network structure through the activation or deactivation of specific network links. This has an immediate effect on the formation of the opinions of the agents, which, in turn, influences wealth accumulation for each agent and so on.
Note that the formulation presented above aims to incorporate both: (a) the rational aspect of social influence, i.e., wealth w i t , considered to be the “hard power” element in the model, and (b) the irrational aspect of social influence, i.e., charisma c i , considered to be the “soft power” element, indicating the psychological tendency to be influenced by those who possess social status.

3. Group Decision Making (GDM)

In the field of Sociophysics, Group Decision Making (GDM) in a social network usually takes place between multiple collaborating agents of often diverse backgrounds, ideas, knowledge and authority, each having a different opinion on a specific subject [81,82,83,84]. Thus, GDM implies the existence of collective efforts aiming for the achievement of consensus in a non-competitive setting on the part of all network agents, all consciously committed in the decision-making process.
On the other hand, OD primarily focuses on processes of undeliberate shift in perceptions, with maybe only a minority of agents intently aiming for the promotion of specific desired opinions and ideas (e.g., informed/change agents) to unaware regular agents. In OD, even if consensus appears, in the form of opinion uniformity, as a macroscopic emergent phenomenon, this does not necessarily imply intentionality and commitment to the attainment of consensus on the part of the agents, as in the GDM case. Even if each agent is assumed to purposefully select whom they will interact with, according to specific selection criteria, pursuance of purpose remains, at most, an individual, not collective, endeavor. Thus, consensus in OD, when it emerges, is merely a byproduct of interactions. What might interest the researcher is the eventual opinion distribution (steady state) among the agents, i.e., uniformity, polarization or fragmentation of opinion. On the contrary, consensus in GDM is what is actively sought after. Here, what matters is the achievement of an eventual collective and negotiated opinion value and the conditions for its implementation. Note that in OD such equations referring to some steady state (such as ( 23 ) and ( 31 ) , below), are naturally absent, since opinion diffusion is a “purpose-free” process, which, as noted above, does not entail collective pursuance of purpose from the part of the agents.
However, despite their heavy contextual differences, heavy influence from OD to GDM in terms of methodology and mathematical formulation is nearly inevitable due to the fact that both involve the promotion of personal views. Thus, OD models are related to GDM models but only in terms of similar social diffusion equations. More specifically, an OD model can be converted to a GDM model if the element of consensus pursuance is added into the existing model architecture leading to further mathematical elaboration. Note that for this reason the distinction between OD and GDM may not be directly perceivable when looking only at certain parts of the mathematical formulation. Thus, the difference in the social context of interaction is not immediately apparent from the social diffusion equations used, which are, after all, frequently used in similar or identical form in GDM as well as OD. Nonetheless, the collaborative aspect of GDM is still apparent as it emerges from the way a proposed GDM model operates in its totality, taking into account all equations describing its modus operandi. This collaborative aspect is, of course, directly enforced by the developer of the model.
In order to showcase the distinctive features of GDM, prominent examples from the available literature are presented and discussed below.

3.1. Decision Making via Agent-to-Agent Influence

A significant number of GDM models [85,86,87] incorporate an agent-to-agent interaction mechanism for decision making. A notable model is the one found in [84], in which the bounded confidence assumption in ( 3 ) is adopted, although certain distinguishing elements are present.
The opinion o i t of agent i is taking values in the interval [ 0 ,   1 ] . Each pair of agents i and j is influenced by each other, depending on their opinion distance d i j t = o i t o j t , which takes values in [ 0 ,   1 ] . Three separate cases are distinguished:
  • When d i j t < φ , the agents are deemed to be in agreement and therefore there is no further need to influence each other.
  • When d i j t [ φ ,   ε ) , with consensus threshold φ [ 0 ,   ε ] , the agents continue to influence each other and they have to compromise. Only in this case opinion update for both agents takes place.
  • When d i j t ε , with confidence threshold ε [ 0 ,   1 ] , no influence takes place between the agents as they belong to a separate opinion cluster.
For an agent i at each time step t the set S i = { j : d i j t [ φ ,   ε ) } is determined. This set contains all agents j that agent i has to negotiate with. Among these agents, a particular agent κ is selected for interaction if d i κ t = max j S i { d i j t } . Resembling the DW formulation in ( 5 ) , between agents i and κ , opinion diffusion operates in the following manner:
o i t + 1 = μ i t o i t + 1 μ i t o κ t ,   o κ t + 1 = μ κ t o κ t + 1 μ κ t o i t ,  
where μ i t ,   μ κ t     [ 0 ,   1 ] are the time-dependent convergence parameters of agents i and κ :
  μ i t = 1 D E G κ t D E G i t + D E G κ t · s i , μ κ t = 1 D E G i t D E G i t + D E G κ t · s κ  
The degree centrality of agent i , indicating his credibility, is denoted by D E G i ( t ) . The reasoning for this, is the argument that the more one is followed, the more his opinion tends to be respected. Additionally,   s i and s k , are constants indicating stubbornness, taking values equal to 2 , 3 or 4 .
At time step t e q the network reaches an equilibrium as all opinion distances belong to the interval Δ = 0 ,   φ [ ε ,   1 ] . This means that S i = , for all agents i . The final aggregated opinion O e q is calculated as the weighted average of all final agent opinions giving the solution to the GDM problem:
  O e q = i = 1 N o i t e q · D E G i t e q i = 1 N D E G i t e q   .  

3.2. Decision Making via Clustering

When the population of the interacting agents is large, usually greater than 11 agents [88] or more [89,90], decision making can be realized in clusters of agents. For example, in [90], the agents are placed in Z distinct clusters G z , z = 1 , , Z with populations of G z agents. Each agent i has its own confidence threshold ε i . All agents are faced with a set of m decision alternatives, namely:   X = x 1 ,   x 2 , , x m . Each alternative x p has n attributes, i.e., x p = [ a p 1 ,   a p 2 , , a p n ] . Attributes are split into two categories: (a) benefit attributes and (b) cost attributes. It is desirable that benefit attributes take high values while cost attributes take low values.
The opinion of agent i on the attribute a p q of the alternative x p is denoted as o i p q t , taking values in the interval [ 0 ,   1 ] . Therefore, the agent i of cluster G γ is characterized by the opinion matrix O i [ γ ] ( t ) = o i [ γ ] p ( q ) ( t ) m × n and his prestige/reputation r i [ γ ] = ω ¯ i j G γ ω ¯ j   , where ω ¯ i is the mean value of two centralities, degree and closeness. The (relative) prestige/reputation of cluster G γ is as follows:
r γ = G γ 2 z = 1 Z G z 2 .  
Due to the presence of a clustering mechanism, consensus is gradually formed in hierarchical levels of interaction (micro-, meso- and macro-). The mathematical formulations for each level are summarized in Table 1. Consensus has to be first implemented in the cluster (meso) level. The opinion matrix of the cluster G γ is O γ ( t ) = i = 1 G γ r i γ · O i [ γ ] ( t ) = o [ γ ] p ( q ) ( t ) m × n . The difference between the opinion matrix O i [ γ ] ( t ) of agent i and the opinion matrix O γ ( t ) of the cluster G γ to which agent i belongs, is calculated via the Manhattan distance:
  d i γ = d O i γ t , O γ t = 1 m n p = 1 m q = 1 n o i γ p q t o γ p q t .  
The consensus level of agent i and the consensus level of the cluster G γ are given correspondingly: C O i [ γ ] ( t ) = 1 d O i [ γ ] ( t ) , O γ ( t ) = 1 d i γ and C O γ ( t ) = i = 1 G γ r i [ γ ] · C O i [ γ ] ( t ) . The group/network consensus level is defined as follows:
  C O t = z = 1 Z r z · C O z t .  
When C O ( t ) > φ , where φ is an arbitrary selected consensus threshold, the consensus reaching process is completed. Otherwise, the agents belonging to the cluster with the lowest consensus level, say G γ , need to properly readjust their opinions (Table 2). In this cluster G γ , the opinion update of agent i is the following:
  O i γ t + 1 = I i O i γ t + 1 I i · 1 S i E i j S i E i O j γ t ,  
where I i is the opinion inertia of agent i , incorporating his self-confidence, S i is the set of neighbors of agent i , while E i is the set of in-cluster agents having similar opinion to agent i . More specifically, E i is the set of agents of the cluster G γ between whom and agent i the Manhattan distance is smaller or equal than the confidence bound ε i of agent i :
  d i j γ = d O j γ t ,   O i γ t = 1 m n p = 1 p q = 1 q o j γ p q t o i γ p q t ε i .  
Due to the fact that confidence bounds ε i vary, an agent j may be included in the set E i of agent i but the opposite is not necessarily true. Note that distance measures apply only for the micro case and not for the meso (cluster level) and macro (group level) cases (Table 1). Nonetheless, further elaboration is possible, at least for the meso case, taking also into account inter-cluster distances for the formation of consensus, not only the reputation weights r z (see below).
In case S i E i = agent i updates his opinion via taking into account the opinion of a single agent κ :
O i γ t + 1 = I i O i γ t + 1 I i O κ γ t  
Depending on the subcase (see Table 2), agent κ can be: (a) the neighbor with the greatest consensus level in the cluster of agent i (when S i ), (b) the agent with the greatest consensus level in the cluster of agent i among agents with opinion distance satisfying the confidence bound of agent i (when ( S i = )     ( E i ) ) and (c) a hypothetical agent whose opinion distance from agent i is equal to ε i (when ( S i = )     ( E i = ) ).
Opinions matrices O z ( t ) of all clusters G 1 , G 2 , . ,   G Z are aggregated in the global opinion matrix O t = z = 1 Z r z O z t = o p ( q ) ( t ) m × n . When consensus has been globally achieved at time t e q , i.e.,   C t e q > φ , the evaluation E x p of alternative x p is computed as:
E x p = q = 1 n w p q o p q t e q
where w p ( q ) is weight of attribute q of alternative p and o p ( q ) t e q is the aggregated group/network opinion on this particular attribute–alternative pair. The final group/network decision is
  D = max p 1 , , m E x p

3.3. Decision Making via Consultation

Shared mental models [91,92] were initially proposed to describe shared cognition in dyads of agents. These models were afterwards expanded at the group/team level. Thus, so-called “team mental models” have been used to study collective shared understanding, beliefs and knowledge inside groups of agents. In this way, valuable insights can be extracted, concerning the way team members perceive and interpret knowledge, make decisions and collaborate with each other [92,93].
In [94], a consultation process in a group of agents is studied. The primary aim of the model is the optimization of a true utility function U p , to which no agent has access. The true utility function U ( p ) takes values in [ 0 ,   1 ] , where p = x 1 ,   x 2 ,   ,   x m is a plan of action defined on a m -dimensional problem space. Each dimension x p represents an “aspect” of the problem. Each plan p corresponds to an opinion set o p = p , U p . Each agent i has two types of memory, namely:
  • The Peer-derived memory M i p e e r = o i j ( δ ) ( N 1 ) × c which is derived from the opinion sets of the other N 1 agents. Each agent i has a limited memory capacity c . The elements of the peer-derived memory M i p e e r are the opinion sets o i j ( δ ) = p i j ( δ ) , U j p i j ( δ ) , where p i j ( δ ) is the δ -th plan of agent i derived from agent j and U j p i j ( δ ) is the utility assigned to the plan p i j ( δ ) , according to the individual utility function U j p of agent j (see below).
  • The Self-derived memory M i s e l f = o i i ( δ ) 1 × s which consists of s opinion sets. Each opinion set o i i ( δ ) = p i i ( δ ) , U p i i ( δ ) + ε consists of a plan, randomly derived from the m -dimensional problem space and U p i i ( δ ) + ε is the utility assigned by the true utility function U ( p ) to the plan p i i ( δ ) , adding a noise component ε [ η ,   η ] , with η [ 0 ,   1 ] .
At each time step (a consultation round), a discussion among the agents takes place and each agent adopts a certain number of other opinions from his peers. The memory capacity c constrains the number of opinions derived from colleagues that an agent can hold at the same time. Thus, older opinions are gradually replaced by newer ones following the First-in-First-out (FiFo) principle. Note that the self-derived opinion sets do not get affected by this “forgetting” process. For each agent i the individual utility function U i p is defined as
  U i p = j δ C L p i j δ , p · U j p i j δ ,  
where U j p i j ( δ ) is the utility value of agent i for the δ -th plan p i j δ derived from agent j , and D p i j δ , p = c l p i j δ , p j δ c l p i j δ , p is the normalized value of the inverse square distance (closeness) c l p i j δ , p = | p i j δ p | 2 between the plan p i j δ of agent i derived from agent j and a plan under consideration p .
Additionally, a tentative group plan p γ = [ x 1 γ ,   x 2 γ ,   ,   x m γ ] is discussed, while each agent i has his own personal plan p i m a x = [ x 1 i m a x ,   x 2 i m a x ,   ,   x m i m a x ] , which is the one with the maximum utility according to his individual utility function. At each time step, an agent κ is randomly selected to speak to the group and suggest a revision of the group plan. He presents an opinion o κ ξ s u g = p κ ξ s u g , U κ ( p κ ξ s u g ) , where p κ ξ s u g = [ x 1 γ ,   ,   x ξ κ m a x , ,   x m γ ] is a newly suggested plan. Here the ξ -th aspect x ξ [ γ ] of the current group plan p γ has been replaced by the newly suggested aspect x ξ ( κ ) m a x of the personal plan of agent κ , which he personally considers it important due to its maximization of the utility gain: Δ U κ , ξ = max λ 1,2 , , m U κ p κ λ s u g U κ p γ .
An agent i is convinced only if U i p κ ξ s u g > U i p i m a x . Then he updates his personal plan accordingly, thus p i n e w _ m a x = p κ ξ s u g . Afterwards, the revised individual plan p i n e w _ m a x might become further refined via a local search for an even better plan p in a sphere of radius r centered on p i n e w _ m a x , i.e., | p p i n e w _ m a x | < r . In this way, it is possible that further optimization of utility may be achieved.
If the condition U i p κ ξ s u g > U i p i m a x is not fulfilled, he still may accept the proposal with probability:
  P p i m a x p κ ξ s u g = exp p κ ξ s u g p i m a x 2 T i ,  
where T i is the “temperature” (openness) of agent i , indicating his tolerance for accepting new proposals of lower utility value than the utility value of his own personal plan.
Revision of the group plan p γ is implemented if the condition σ N 1 > θ is satisfied, where θ is the acceptance threshold and σ is the number of supporters, excluding the speaker. The algorithm is completed when the group finds a plan with a utility value equal to the maximum utility value of the true utility function.

3.4. Application in Economics

GDM has been sparsely applied on Economics [95,96]. For instance, in [95], a GDM model is proposed for simulating decision making among multiple stakeholders (agents) on the implementation of financial aid programs in rural China. The participating stakeholders-agents, such as development banks, local government institutions and credit suppliers, express their opinions in heterogeneous mathematical formulations.
As in the case of [84,90,94], a distinct decision-making mechanism is proposed via which agents collectively decide on a set of m alternatives X = { x 1 ,   x 2 ,   ,   x m } . Each agent can express his opinion in one of the following formats:
  • Preference Utility: The opinion o i of agent i is expressed as a utility vector o i = u i = u 1 ( i ) , u 2 ( i ) , ,   u m ( i ) containing utility values for each alternative x p with p = 1,2 , , m . The largest element indicates agent i ’s top preference. Relative utilities v p q ( i ) = u p ( i ) u q ( i ) with p , q = 1,2 , , m are encoded in a m × m matrix, indicating the preference of x p over x q as evaluated by agent i . All relative utilities are encoded in the opinion matrix O i = U i = v p q ( i ) m × m . The normalized opinion matrix is O i = U i = v p q ( i ) ξ = 1 m v ξ q ( i ) m × m .
  • Preference Ranking: The opinion o i of agent i is expressed as a ranking vector o i = r i = r 1 ( i ) , r 2 ( i ) , ,   r m ( i ) , whose elements is an ordinal variable, indicating the ranking of each alternative. If r p ( i ) = 1 then the alternative x p is agent i ’s top preference. The normalized opinion matrix is O i = R i = r p q ( i ) ξ = 1 m r ξ q ( i ) m × m , where r p q ( i ) = m r p ( i ) m r q ( i ) indicates the preference of x p over x q as evaluated by agent i .
  • Multiplicative Preference Relation: The opinion o i of agent i is expressed via a Pairwise Comparison Matrix O i = A i = a p q ( i ) m × m with elements taking values in the interval [ 1 9 ,   9 ] , satisfying the condition a p q ( i ) · a q p ( i ) = 1 . When a p q ( i ) < 1 then alternative x p is favored over x q while when a p q ( i ) > 1 the reverse is true. The greater the distance from 1 (i.e., closer to 1 / 9 or closer to 9 ), the more preferable the corresponding alternative is. The normalized opinion matrix is O i = A i = a p q ( i ) ξ = 1 m a ξ q ( i ) m × m .
  • Additive Preference Relation: The opinion o i of agent i is expressed via a Pairwise Comparison Matrix O i = B i = b p q ( i ) m × m , with elements taking values in the interval [ 0 ,   1 ] and satisfying the condition b p q ( i ) + b q p ( i ) = 1 . When b p q ( i ) > 0.5 , then alternative x p is favored over x q while when b p q ( i ) < 0.5 , the reverse is true. The greater the distance from 0.5 (i.e., closer to 1 or closer to 0 ), the more preferable the corresponding alternative is. The normalized opinion matrix is O i = B i = b p q ( i ) ξ = 1 m b ξ q ( i ) m × m .
Depending on the form of the normalized opinion matrix O i , each agent is placed in one of the following four separate sets: S u = i : O i = U i ,   S r = i : O i = R i ,   S A = i : O i = A i ,   S B = { i : O i = B i } , with S u S r S A S B = S the union of all sets containing all agents. A weight c i , indicating the cooperativeness of agent i for reaching consensus, is assigned to each normalized opinion matrix O i . Group opinion is defined as the collective opinion vector o g r o u p = a r g   max o R m { G o } = [ o 1 ( g r o u p ) , o 2 ( g r o u p ) , ,   o m ( g r o u p ) ] , where:
  G o = i S u c i q = 1 m v q i , o + i S r c i q = 1 m r q i , o + i S A c i q = 1 m a q ( i ) , o + i S B c i q = 1 m b q ( i ) , o  
The cosine similarity   o q ( i ) , o , with the opinion matrix O i element o q ( i ) taking one of the following forms, namely v q ( i ) , r q ( i ) , a q ( i ) , b q ( i ) , is defined as:
  o q i , o = p = 1 m o p q i · o p p = 1 m o p q i 2 p = 1 m o p 2 .  
The quantity q = 1 m o q ( i ) , o is the sum of the above cosine similarity measures between the columns o q ( i ) of the opinion matrix of agent i and an opinion vector o = o 1 ,   o 2 , , o m . The consensus level G o g r o u p S · m expresses the normalized similarity between the group opinion o g r o u p and the opinions o i of the agents. When G o g r o u p S · m < ε , where ε is an arbitrary threshold, the consensus level is not acceptable and, therefore, an opinion update for all agents is required. Then, an agent i will randomly select a new opinion o p q ( i ) n e w in the interval min o p q _ g r o u p ( i ) , o p q ( i ) , max o p q _ g r o u p ( i ) , o p q ( i ) , where o p q _ g r o u p ( i ) = f i ( o p ( g r o u p ) , o q ( g r o u p ) ) is the collective opinion about x p in terms of x q in a form understandable to agent i , according to his opinion format.
During the above-described consensus reaching process, agents whose opinions o i diverge further from the group opinion o g r o u p are identified and clustered together. Such non-cooperative agents are called to modify their opinion o i . In case they persist in their divergence from the group opinion, they forfeit a part of their social influence in the GDM process as their individual cooperative weight c i is lowered after each iteration but never completely nullified. At the start of the GDM process, all agents have equal cooperative weights c i .

4. Knowledge Dynamics (KD)

Alongside OD and GDM, in the field of Sociophysics, Knowledge Dynamics (KD) is also intensively studied so as to investigate how knowledge is diffused in complex networks. Knowledge is distinguished from opinion as it requires a justification founded on logical conclusions about observations [97], not subjective and ad-hoc approximations of reality. As in the case of OD and GDM, Network Science has been utilized for modelling knowledge diffusion processes in complex networks [98].

4.1. Knowledge Exchange

One of the most notable agent-based approaches for knowledge diffusion in complex networks is based on the knowledge exchange principle [99,100]. In [99], agents are characterized by a knowledge vector containing several knowledge items s = 1 ,   2 ,   ,   N . The corresponding knowledge level of agent i for item s at time step t is denoted by k i s t . The exchange of knowledge between two neighboring agents is based on the “quid pro quo” principle (“win–win” interaction). This means that every possible interaction between two agents must result in mutual benefit, i.e., knowledge gain. The only prerequisite for knowledge exchange between agents i and j is the existence of a relative knowledge deficit in at least two different items. This condition is widely adopted in many knowledge diffusion models [101,102,103].
For simplicity, it is assumed that agents possess knowledge in only two items. Suppose that there is a relative knowledge deficit for agent i in item s = 1 and for agent j in item s = 2 , i.e., k i 1 t < k j 1 t and k j 2 t < k i 2 t , correspondingly. Knowledge diffusion is formulated as follows:
F o r   i t e m   s = 1 :   k i 1 t + 1 = k i 1 t + a k j 1 t k i 1 t k j 1 t + 1 = k j 1 t   b e c a u s e   k i 1 t < k j 1 t .   F o r   i t e m   s = 2 :   k i 2 t + 1 = k i 2 t k j 2 t + 1 = k j 2 t + a k i 2 t k j 2 t   b e c a u s e   k j 2 t < k i 2 t ,  
where 0 < a < 1 is a constant (similar to the convergence parameter μ in the DW model), indicating the capacity for knowledge absorption.
It is important to highlight that knowledge diffusion is conditioned on the existence of a mutual need to increase the present knowledge levels k i 1 t and k j 2 t . We can contrast this “quid pro quo” principle (“win–win” interaction), with the widely used bounded confidence condition ( 3 ) in OD. The key difference is that in KD there is an objective superiority of agent i in comparison to agent j in terms of knowledge in a specific knowledge item, whereas in OD there is no objective ranking of the agents involved in a social interaction. The mathematical implication of this remark is that in KD knowledge diffusion in a single knowledge item is unidirectional, namely from the more knowledgeable agent to the less knowledgeable one. On the contrary, in OD social influence may be bidirectional, in the sense a single social interaction may result into a shift of opinion for both interacting agents.
Additionally, it must be noted that in ON diffusion constraints are set by the psychosocial inability to communicate with someone with radically different posture on various issues (heterophobia), whereas in the context of KD diffusion constraints are set by objective knowledge gaps between agents. Someone who is vastly inferior in knowledge than someone highly knowledgeable (experts) simply cannot absorb the available knowledge. Thus, when communication fails, this is due to objective, not intersubjective, reasons.

4.2. Self-Innovating Agents

Central to the study of knowledge networks is the potential presence of self-innovating agents [97,101,103,104]. Self-innovating agents can be compared to the informed agents in OD. Contrary to informed agents, who may act as stealth manipulators of social change, self-innovating agents are generally regarded as beneficial sources guiding the knowledge enlightenment of their peers.
The concept of self-innovating agents was firstly proposed in [101]. Here, knowledge is a scalar variable. At each time step, a self-innovating agent i is selected to innovate, i.e., produce new knowledge. The process of innovation is formulated as k i t = k i t 1 1 + β i , where β i > 0 is the innovation ability of agent i . As knowledge is of scalar form, not vector, as in the case of knowledge exchange, there is no prerequisite condition for mutual knowledge gain. Therefore, knowledge diffusion from the self-innovating agent i to a regular neighboring agent j can be realized only if k i t > k j t , with the knowledge diffusion formula taking the following form:
  k j t + 1 = k j t + a j k i t k j t ,  
where 0 < a j < 1 is the knowledge absorptive captivity of agent j .
Knowledge level is normalized taking values in the interval [ 1 ,   1 ] . The innovation parameter of a self-innovating agent i is regarded as his self-weight, i.e., β i = w i i , which in [97] takes even negative values indicating self-destructive thinking. In addition to the presence of self-destructive agents, knowledge “destruction” can take place due to the presence of unreliable knowledge channels (misinformation) or targeted attacks on the knowledge network (disinformation).
Note that in most KD models [99,101], agents select randomly other agents for knowledge acquisition. This “randomness” assumption for social interaction is also found in most OD models [31,32,33]. However, and as we have already noted in the introduction, humans (or even other intelligent entities, artificial or otherwise) are not material atoms. Their actions have purpose. Only in certain recent model proposals [105,106,107], agents are treated as boundedly rational purposeful individuals [66] limited by their uncertainty about the knowledge level of their peers and/or the reliability and efficiency of the communication channels. This key observation distinguishes the classically defined diffusion equation describing spontaneous diffusion between “mindless” molecules of matter from social interactions between intelligent agents. Taking this key observation into account, the impact of prioritization of actions and awareness level has been extensively discussed in [105,106,107] for KD and in [56,79] for OD.

4.3. Application in Business

Applications of KD in business can also be found in the literature [108,109]. For example, in [108], knowledge diffusion among Indian companies (agents) in a weighted directed network is realized due to the presence of interlocking directors, i.e., individuals who are simultaneously members of different directors’ boards of different companies. Social interaction essentially takes place in board meetings, with affiliated directors acting as channels of knowledge transfer. Links are directed, with their direction indicating the affiliation of the corresponding director, and weighted, with weight w i j p j representing a separate common interlocking director p j belonging to the boards of both companies i and j and affiliated towards company j . Two connected agents i and j may exchange knowledge via two sets of multiple weighted directed links, denoted by e i j and e j i indicating the set of weighted directed links w i j p j and w j i p i respectively.
As in [99], each agent (company) i is assigned a knowledge vector containing several knowledge items s = 1 ,   2 ,     N , and a corresponding absorptive capacity a i . The knowledge level of agent i in item s at time t is denoted by k i s t . For each agent i , knowledge gain in an item s consists of two parts, namely: (a) a free knowledge gain G i s derived from “free” preliminary contributions from interlocking directors, and (b) a non-free knowledge gain F i s which is based on the “quid pro quo” exchange principle (“win–win” interaction). For simplicity, it is assumed that agents possess knowledge in only two items. Suppose that there is a relative knowledge deficit for agent i in item s = 1 and for agent j in item s = 2 , i.e., k i 1 t < k j 1 t and k j 2 t < k i 2 t correspondingly. Similar to ( 36 ) , knowledge diffusion is formulated as follows:
F o r   i t e m   s = 1 :   k i 1 t + 1 = k i 1 t + G i 1 + F i 1 k j 1 t + 1 = k j 1 t   b e c a u s e   k i 1 t < k j 1 t . F o r   i t e m   s = 2 :   k i 2 t + 1 = k i 2 t k j 2 t + 1 = k j 2 t + G j 2 + F j 2   b e c a u s e   k j 2 t < k i 2 t ,  
where the free knowledge gain components are formulated as:
G i 1 = p i = 1 e j i w j i p i a i k j 1 t k i 1 t ,     G j 2 = p j = 1 e i j w i j p j a j k i 2 t k j 2 t ,  
and the non-free knowledge gain components are formulated as:
F i 1 = a i min k j 1 t k i 1 t ,   k i 2 t k j 2 t , F j 2 = a j min k j 1 t k i 1 t ,   k i 2 t k j 2 t
Note that in the case of barter knowledge exchange 38 , knowledge gain (incorporating the difference in absorption rates) has to be equal in terms of quantity for both agents, i.e., F i 1 a i = F j 2 a j . In contrast, in [99], equality is only in terms of the number of the knowledge items to be shared.

5. A Critique of Social Diffusion Dynamics in Networks

5.1. Gaps and Issues in the Application of Sociophysics in Real-World Socioeconomic Phenomena

As things stand today, Sociophysics makes possible the quantitative description and analysis of complex social phenomena, by means of mathematical modelling in social networks. The age-old dream for a positive social science expressed by thinkers like August Comte, Émile Durkheim (1858–1917) and Herbert Spencer (1820–1902) might not have been fully realized but its distant echo can be heard in the modern social diffusion dynamics research. The value of Sociophysics has been already demonstrated in past cases of successful simulations of the social environment, as evidenced by reportedly accurate predictions of Sociophysics models on the results of important social processes, e.g., national elections, referenda, etc. [110]. Of similar value is the applications of Sociophysics in real-world social processes in the domains of Behavioral Finance, Social Trading and Business, taking into account the crucial sociological insight that the opinions of financially oriented agents are socially dependent [67,76,77]. Nonetheless, in order for the Sociophysics paradigm to offer a substantial contribution to the alleviation of already existing and emerging societal problems (e.g., disinformation/misinformation, spread of pseudo-scientific theories, lack of consensus among international actors like states, organizations, etc.) certain evident boundaries of current research have to be overcome.
Firstly, it should be noted that while Sociophysics applications in the field of behavioral finance/social trading/business abound in the case of OD, they seem to be scarce in the cases of GDM and KD. This is partly to be expected since the modern free market environment contains primarily self-interested agents. Thus, collaboration is not expected to be the norm. Knowledge sharing between financial/business agents is also uncommon, save for the case when there is a “quid pro quo” benefit to be gained. Financial/business actors generally prefer to keep their innovations secret [111]. Nonetheless, existing research suggests that there is certainly room to further investigate collaboration processes in the financial/business domain. Instances do exist where collaboration and knowledge sharing between multiple financial/business agents takes place, e.g., the common practice of co-branding [112] or the existence of partnerships between start-ups and large established companies [113].
Secondly, there is a distinctive lack of empirical validation for most proposed models. Despite the fact that Sociophysics models are built on the basis of common-sense assumptions (e.g., the existence of purposeful opinion-spreaders, the desire to collaborate and find a commonly acceptable solution or the existence of agents with a strong tendency for innovation), model calibration and validation on the basis of real-world data is sorely missing, except for certain empirically verified statistical observations on behavioral patterns, e.g., the fact that existing interpersonal ties tend to influence buying and selling practices of traders [63,64]. The lack of empirical validation is partly justified by the complexity of the social world and the expected inability to independently observe social interactions in their totality, contrary to physical phenomena that can be reproduced in a lab setting. However, the proliferation of Big Data and Machine Learning/Artificial Intelligence technologies and the tendency for increasing data accumulation in the corporate and state sectors indicate that Sociophysics research might hopefully be able to overcome, at least in part, the above-mentioned limitations [12]. In that case, it would be preferable that model development be conducted not a priori but in conjunction to the available data.

5.2. Misalignment between Sociophysics Modelling Assumptions and Social Reality

As regards the extent that Sociophysics modelling assumptions accurately capture, interpret and represent social reality (at least in accordance with current sociological understandings) we wish to underscore some important and rather overlooked issues and their implications. Firstly, it must be noted in most proposed models, simulations converge to a steady state considered to be the end of the social diffusion process. Although much focus is placed in formulating how social structure is built from the bottom (micro- level) to the top (macro- level), no particular emphasis is placed on the opposite, i.e., how an existing social structure is altered by micro-interactions in turn influenced by it. Contrary to structural functionalist expectations who expect general social stability and order [114], the contemporary social world is characterized by temporality, as agents interact with and transform existing social structures through their actions [115]. Continuous social flux seems to be the norm, per the well-known aphorism of the Greek philosopher Heraclitus (“Everything flows”—τὰ πάντα ῥεῖ). Thus, most social structures (e.g., opinion uniformity, opinion polarization, etc.), are bound to be eventually all but be discarded as agents will react to the existing “status quo”.
The presence of a co-evolution mechanism between structure and agents’ attributes, indicating a continuous micro-macro interaction, has been already highlighted in certain studies [76,77,79,107,116]. Nevertheless, further exploration would be more than welcome in order to more accurately describe various co-evolutionary processes of social diffusion. For example, micro-macro interaction could be modeled not only via taking into account the influence of neighbors on agents’ attributes and actions but of broader structural network properties as well. See, for example, the probabilistic opinion shift for contrarian agents in [69] where global distribution of opinion is taken into account and, in particular, the operation of the GDM model in [90], where opinion update for an agent is simultaneously dependent on all levels of interaction, micro (opinion of neighbors), meso (cluster opinion) and macro (collective opinion) (Table 2). We, however, note that what is missing from the last two formulations is the incorporation of modifications in network structure (i.e., activation/deactivation or strengthening/weakening of specific links) as agent attributes, such as opinion, reputation, authority, etc., shift in time due to the influence of micro, meso and macro network parameters. In short, simultaneous rejection of link staticity and incorporation of the direct influence of higher-level properties on agent attributes are paramount for a proper depiction of agent-structure interaction. To the best of our knowledge, such contribution is sorely missing from current Sociophysics research.
Secondly, to further elaborate our point, we note that the above-mentioned misalignment between Sociophysics and social reality can also be attributed to the fact that there is a tendency in many eminent Sociophysics models (e.g., [28,31,32,99]) to treat social interaction as the product of chance encounters inducing change in social properties (opinion, knowledge, etc.), much like how random collisions between air molecules induce changes in their physical properties (direction, speed, mass, etc.). Evidently, this is not how the social world primarily operates. We are aware of only a handful of modelling attempts [67,105,106,107], where social agents are implicitly or explicitly considered purposeful individuals, consciously deciding, on the basis of individual preferences and previous experience, with whom they will interact and what their position will be. Therefore, socially influenced as the agents may be, they still operate on the basis of certain rational criteria, whichever these may be (e.g., previous beneficial interaction). We think that this is in line with how existing social structures are formed and re-formed under the influence of individual decisions and actions, notwithstanding the fact that actors usually do not possess perfect knowledge as regards potential consequences of their actions [66] due to the immanent social complexity and the resulting interdependence between individual decisions, selections and actions. This observation has great political, beyond socioeconomic, relevance and it is probably of key importance for a successful incorporation of the element of social complexity in the domains of political science in general and international politics in particular [117,118,119].
Accordingly, the bottom line of our argument is that Sociophysics should treat social phenomena not as the social equivalent of stochastic or law-based neutral physical processes but as aspects of emergent and shifting social structures. These structures are formed, preserved and updated via the deliberate choices of conscious—or, at the very least, partially conscious due to their potentially biased dispositions—social actors/agents. Each agent is equipped with (a) a set of individual selection criteria, (b) limited knowledge of their surroundings and (c) a distinct position in the social structure, implying a certain degree of influence in the micro, meso and macro levels. The finite structural “resources” at his disposal permit him to implement—or prevent him from fully implementing—his own personal goals (e.g., transfer or extraction of knowledge, promotion of opinion, etc.). Thus, social structure exerts enabling but also constraining effects on conscious individual action [120].
We believe that the Network Science framework, already employed in Sociophysics, is ideal for further mathematical elaboration of social structure and its co-evolutionary interaction with individual agent behavior. The element of deliberate inter-agent communication in the process of mutual constitution between agency and structure is a perhaps overlooked but nonetheless extremely important point that an aspiring “computational social science” [12] like Sociophysics should fully take into account in order to soothe the already noted ontological tension between individual freedom of action and the placement of agent behavior in a set of mathematical constraints, taking the form of social diffusion equations.
The incorporation of these omissions (neglect of the agent-structure co-evolutionary interdependence and non-random, conscious communication), as well as the evident limitations outlined in Section 5.1. (dearth of applications in behavioral finance and business in the cases of GDM and KD and general lack of empirical validation), is crucial in order for the distinct advantages and added value of Sociophysics to become apparent. We suggest that the issues described herein (see Table 3) be tackled in short order for the discipline of Sociophysics to become accepted as the bleeding edge of applied mathematics in social sciences (economics, political science, etc.).

6. Conclusions—Future Prospects

Through a meticulous presentation of the most notable examples of the Sociophysics discipline in diffusion dynamics modelling, we were able to offer an “eagle’s eye” view of the existing literature. We provide a much-needed critical appraisal of the current standing of the discipline, hoping that our contribution will prove to be a beneficial one for the future of Sociophysics/Econophysics and computational social science in general. In particular, we showcase how the social world through the use of a mathematics-based quantitative approach can be fruitfully studied and we present key general approaches and applications of a more specified socioeconomic character, focused on interactions between financially oriented agents. We additionally highlight the promises and shortcomings of current Sociophysics research as we additionally aim to offer a critical view on the Sociophysics discipline, bringing to the foreground crucial aspects of its often-problematic correspondence with social reality.
Still, further elaboration is possible, i.e., through indication of specific advantages and disadvantages of the analyzed methods, an insight that is beyond the scope of this work. For now, suffice it to say that the appropriateness of each model is dependent on the specific context in which it is applied and the related well-defined and often conflicting assessment criteria. More specifically, with respect to the criterion of computational complexity, linear models, such as the ones found, for example in [18,21] have a comparative advantage. On the contrary, with respect to the criterion of closeness to socioeconomic reality, nonlinear models like the ones found, for instance, in [28,31] are rather more preferable, since they more effectively capture social complexity. Thus, a balance between conflicting requirements often needs to be achieved. The appearance of more data-enhanced real world applications of Sociophysics [121,122] will, hopefully, make apparent which models are more suitable for modelling which aspect of social reality, according to the criteria mentioned.
From the analysis conducted above, we conclude that current and future approaches on opinion, consensus and knowledge diffusion dynamics can be beneficially applied in the context of the modern complex information society [13], especially if the suggestions presented in Section 5 are to be taken into account through the application of Sociophysics principles into rather unexplored areas of socioeconomic interaction such as inter-firm collaboration [95,96,121], inter-firm patent diffusion [108,109,122], etc. Certain crucial questions include—but not are not limited to—the following: To what extent and manner firms and entrepreneurs exchange ideas, opinions and information? How can a company fully benefit from its collaborative interactions with other companies? How decision-making on the implementation of tasks with important social impact can be achieved among affected stakeholders, including firms? All the above can be explored through the incorporation of an increasing abundance of available time series data, pertaining to, for example, financial transactions, instances of collaboration or common participation and endorsement of social events. However, we believe that a more detailed mathematical depiction of agent–structure co-evolution is what is required the most.
We believe that the above proposals are of great relevance for all categories of social diffusion processes analyzed herein, OD, GDM and KD. In the case of OD, the need for firms, organizations and governmental agencies to adopt current norms and prevent the spread of disruptive disinformation/misinformation and fake news in relevant social networks [123,124] suggests that opinion diffusion modelling will be considered a must-have tool in the near future. The same is true for KD, since the existence of a rapidly shifting global social structure has intensified the need for the development of efficient mechanisms for knowledge transfer [125] and knowledge management [126]. The effective diffusion of knowledge and innovations in various important domains (e.g., energy efficiency technologies [109]) is crucial for the sustainable competitiveness and orderly operation of enterprises, financial organizations or innovation networks. Lastly, efficient GDM procedures ensure the accommodation of crucial financial/economic issues in areas such as earthquake sheltering [127] and urban resettlement [96].
Considering, in toto, the benefits and shortcomings of current Sociophysics research, it is important to underscore the apparent potential of the Sociophysics/Econophysics discipline to accurately describe the dynamics of social and economic reality. We believe that a Sociophysics-based approach might limit the intervention of subjectivity on the part of the social researcher, particularly as regards the way interaction between different structural social levels (micro, meso and macro) takes place.

Author Contributions

Conceptualization, D.T., M.T. and E.I.; methodology, D.T., M.T. and E.I.; formal analysis, D.T., M.T. and E.I.; investigation, D.T., M.T. and E.I.; resources, D.T., M.T. and E.I.; writing—original draft preparation, D.T., M.T. and E.I.; writing—review and editing, D.T. and E.I.; supervision, E.I. All authors have read and agreed to the published version of the manuscript.

Funding

This research received no external funding.

Conflicts of Interest

The authors declare no conflicts of interest.

References

  1. Comte, A. Social Physics: From the Positive Philosophy of Auguste Comte; Kessinger Publishing, LLC: Whitefish, MT, USA, 2010; ISBN 978-1-168-72610-0. [Google Scholar]
  2. Săvoiu, G.; Iorga Simăn, I. Sociophysics: A New Science or a New Domain for Physicists in a Modern University. In Econophysics; Săvoiu, G., Ed.; Academic Press: San Diego, CA, USA, 2013; pp. 149–168. ISBN 978-0-12-404626-9. [Google Scholar]
  3. Schelling, T.C. Models of Segregation. Am. Econ. Rev. 1969, 59, 488–493. [Google Scholar]
  4. Weidlich, W. The Statistical Description of Polarization Phenomena in Society. Br. J. Math. Stat. Psychol. 1971, 24, 251–266. [Google Scholar] [CrossRef]
  5. Ising, E. Beitrag zur Theorie des Ferromagnetismus. Z. Für Phys. 1925, 31, 253–258. [Google Scholar] [CrossRef]
  6. Callen, E.; Shapero, D. A Theory of Social Imitation. Phys. Today 1974, 27, 23–28. [Google Scholar] [CrossRef]
  7. Galam, S.; Gefen, Y.; Shapir, Y. Sociophysics: A New Approach of Sociological Collective Behaviour: I. Mean-Behaviour Description of a Strike. J. Math. Sociol. 1982, 9, 1–13. [Google Scholar] [CrossRef]
  8. Axelrod, R.; Mitchell, W.; Thomas, R.E.; Bennett, D.S.; Bruderer, E. Coalition Formation in Standard-Setting Alliances. Manag. Sci. 1995, 41, 1493–1508. [Google Scholar] [CrossRef]
  9. Axelrod, R. The Dissemination of Culture: A Model with Local Convergence and Global Polarization. J. Confl. Resolut. 1997, 41, 203–226. [Google Scholar] [CrossRef]
  10. Ball, P. Utopia Theory. Available online: https://physicsworld.com/a/utopia-theory/ (accessed on 18 March 2024).
  11. Wasserman, S.; Faust, K. Social Network Analysis: Methods and Applications, 1st ed.; Cambridge University Press: Cambridge, UK, 1994; ISBN 978-0-521-38707-1. [Google Scholar]
  12. Schweitzer, F. Sociophysics. Phys. Today 2018, 71, 40–46. [Google Scholar] [CrossRef]
  13. Antoniou, I.; Reeve, M.; Stenning, V. The Information Society as a Complex System. JUCS—J. Univers. Comput. Sci. 2000, 6, 272–288. [Google Scholar] [CrossRef]
  14. Jovanovic, F.; Mantegna, R.N.; Schinckus, C. When Financial Economics Influences Physics: The Role of Econophysics. Int. Rev. Financ. Anal. 2019, 65, 101378. [Google Scholar] [CrossRef]
  15. Kutner, R.; Ausloos, M.; Grech, D.; Di Matteo, T.; Schinckus, C.; Eugene Stanley, H. Econophysics and Sociophysics: Their Milestones & Challenges. Phys. A Stat. Mech. Its Appl. 2019, 516, 240–253. [Google Scholar] [CrossRef]
  16. Abelson, R.P. Mathematical Models in Social Psychology. In Advances in Experimental Social Psychology; Berkowitz, L., Ed.; Elsevier: Amsterdam, The Netherlands, 1967; Volume 3, pp. 1–54. ISBN 978-0-12-015203-2. [Google Scholar]
  17. Cohen, J.E.; Hajnal, J.; Newman, C.M. Approaching Consensus Can Be Delicate When Positions Harden. Stoch. Process. Their Appl. 1986, 22, 315–322. [Google Scholar] [CrossRef]
  18. DeGroot, M.H. Reaching a Consensus. J. Am. Stat. Assoc. 1974, 69, 118–121. [Google Scholar] [CrossRef]
  19. French, J.R.P. A Formal Theory of Social Power. Psychol. Rev. 1956, 63, 181–194. [Google Scholar] [CrossRef]
  20. Friedkin, N.; Johnsen, E. Social Influence Networks and Opinion Change. Adv. Group Process. 1999, 16, 1–29. [Google Scholar]
  21. Friedkin, N.E.; Johnsen, E.C. Social Influence and Opinions. J. Math. Sociol. 1990, 15, 193–206. [Google Scholar] [CrossRef]
  22. Lehrer, K. Social Consensus and Rational Agnoiology. Synthese 1975, 31, 141–160. [Google Scholar] [CrossRef]
  23. Alaali, A.; Purvis, M.A.; Savarimuthu, B.T.R. Vector Opinion Dynamics: An Extended Model for Consensus in Social Networks. In Proceedings of the 2008 IEEE/WIC/ACM International Conference on Web Intelligence and Intelligent Agent Technology, Sydney, NSW, Australia, 9–12 December 2008; Volume 3, pp. 394–397. [Google Scholar]
  24. Schweighofer, S.; Garcia, D.; Schweitzer, F. An Agent-Based Model of Multi-Dimensional Opinion Dynamics and Opinion Alignment. Chaos Interdiscip. J. Nonlinear Sci. 2020, 30, 093139. [Google Scholar] [CrossRef] [PubMed]
  25. Dittmer, J.C. Consensus Formation under Bounded Confidence. Nonlinear Anal. Theory Methods Appl. 2001, 47, 4615–4621. [Google Scholar] [CrossRef]
  26. Hegselmann, R.; Flache, A. Understanding Complex Social Dynamics: A Plea for Cellular Automata Based Modelling. J. Artif. Soc. Soc. Simul. 1998, 1, 1. [Google Scholar]
  27. Lorenz, J. Continuous Opinion Dynamics under Bounded Confidence: A Survey. Int. J. Mod. Phys. C 2007, 18, 1819–1838. [Google Scholar] [CrossRef]
  28. Hegselmann, R.; Krause, U. Opinion Dynamics and Bounded Confidence Models, Analysis and Simulation. J. Artif. Soc. Soc. Simul. 2002, 5, 1–2. [Google Scholar]
  29. Krause, U. A Discrete Nonlinear and Non-Autonomous Model of Consensus Formation. Commun. Differ. Equ. 2000, 2000, 227–236. [Google Scholar]
  30. Krause, U. Soziale Dynamiken mit Vielen Interakteuren. Eine Problemskizze. In Modellierung und Simulation von Dynamiken mit Vielen Interagierenden Akteuren; Krause, U., Stöckler, M., Eds.; Universität Bremen: Bremen, Germany, 1997; pp. 37–51. [Google Scholar]
  31. Deffuant, G.; Neau, D.; Amblard, F.; Weisbuch, G. Mixing Beliefs among Interacting Agents. Adv. Complex Syst. 2000, 3, 87–98. [Google Scholar] [CrossRef]
  32. Weisbuch, G.; Deffuant, G.; Amblard, F.; Nadal, J.-P. Interacting Agents and Continuous Opinions Dynamics. In Heterogenous Agents, Interactions and Economic Performance; Cowan, R., Jonard, N., Eds.; Springer: Berlin/Heidelberg, Germany, 2003; pp. 225–242. [Google Scholar]
  33. Weisbuch, G.; Deffuant, G.; Amblard, F.; Nadal, J.-P. Meet, Discuss, and Segregate! Complexity 2002, 7, 55–63. [Google Scholar] [CrossRef]
  34. Martins, A.C.R. Discrete Opinion Models as a Limit Case of the CODA Model. Phys. A Stat. Mech. Its Appl. 2014, 395, 352–357. [Google Scholar] [CrossRef]
  35. Martins, A.C.R. Trust in the CODA Model: Opinion Dynamics and the Reliability of Other Agents. Phys. Lett. A 2013, 377, 2333–2339. [Google Scholar] [CrossRef]
  36. Martins, A.C.R. Continuous Opinions and Discrete Actions in Opinion Dynamics Problems. Int. J. Mod. Phys. C 2008, 19, 617–624. [Google Scholar] [CrossRef]
  37. Clifford, P.; Sudbury, A. A Model for Spatial Conflict. Biometrika 1973, 60, 581–588. [Google Scholar] [CrossRef]
  38. Holley, R.A.; Liggett, T.M. Ergodic Theorems for Weakly Interacting Infinite Systems and the Voter Model. Ann. Probab. 1975, 3, 643–663. [Google Scholar] [CrossRef]
  39. Bernardes, A.T.; Stauffer, D.; Kertész, J. Election Results and the Sznajd Model on Barabasi Network. Eur. Phys. J. B—Condens. Matter Complex Syst. 2002, 25, 123–127. [Google Scholar] [CrossRef]
  40. Stauffer, D. The Sznajd Model of Consensus Building with Limited Persuasion. Int. J. Mod. Phys. C 2002, 13, 315–317. [Google Scholar] [CrossRef]
  41. Sznajd-Weron, K. Sznajd Model and Its Applications. Acta Phys. Pol. B 2005, 36, 2537–2547. [Google Scholar]
  42. Sznajd-Weron, K.; Sznajd, J. Opinion Evolution in Closed Community. Int. J. Mod. Phys. C 2000, 11, 1157–1165. [Google Scholar] [CrossRef]
  43. Galam, S. Real Space Renormalization Group and Totalitarian Paradox of Majority Rule Voting. Phys. A Stat. Mech. Its Appl. 2000, 285, 66–76. [Google Scholar] [CrossRef]
  44. Galam, S. Application of Statistical Physics to Politics. Phys. A Stat. Mech. Its Appl. 1999, 274, 132–139. [Google Scholar] [CrossRef]
  45. Galam, S. Majority Rule, Hierarchical Structures, and Democratic Totalitarianism: A Statistical Approach. J. Math. Psychol. 1986, 30, 426–434. [Google Scholar] [CrossRef]
  46. Krapivsky, P.L.; Redner, S. Dynamics of Majority Rule in Two-State Interacting Spin Systems. Phys. Rev. Lett. 2003, 90, 238701. [Google Scholar] [CrossRef] [PubMed]
  47. Arndt, J. Role of Product-Related Conversations in the Diffusion of a New Product. J. Mark. Res. 1967, 4, 291. [Google Scholar] [CrossRef]
  48. Kelly, J.A.; St Lawrence, J.S.; Diaz, Y.E.; Stevenson, L.Y.; Hauth, A.C.; Brasfield, T.L.; Kalichman, S.C.; Smith, J.E.; Andrew, M.E. HIV Risk Behavior Reduction Following Intervention with Key Opinion Leaders of Population: An Experimental Analysis. Am. J. Public Health 1991, 81, 168–171. [Google Scholar] [CrossRef] [PubMed]
  49. Merton, R.K. (Ed.) Patterns of Influence: Local and Cosmopolitan Influentials. In Social Theory and Social Structure; The Free Press: Glencoe, IL, USA, 1957; pp. 441–474. [Google Scholar]
  50. Nisbet, E.C. The Engagement Model of Opinion Leadership: Testing Validity Within a European Context. Int. J. Public Opin. Res. 2006, 18, 3–30. [Google Scholar] [CrossRef]
  51. Watts, D.J.; Dodds, P.S. Influentials, Networks, and Public Opinion Formation. J. Consum. Res. 2007, 34, 441–458. [Google Scholar] [CrossRef]
  52. Afshar, M.; Asadpour, M. Opinion Formation by Informed Agents. J. Artif. Soc. Soc. Simul. 2010, 13, 1–5. [Google Scholar] [CrossRef]
  53. AskariSichani, O.; Jalili, M. Influence Maximization of Informed Agents in Social Networks. Appl. Math. Comput. 2015, 254, 229–239. [Google Scholar] [CrossRef]
  54. Couzin, I.D.; Krause, J.; Franks, N.R.; Levin, S.A. Effective Leadership and Decision-Making in Animal Groups on the Move. Nature 2005, 433, 513–516. [Google Scholar] [CrossRef]
  55. Halloy, J.; Sempo, G.; Caprari, G.; Rivault, C.; Asadpour, M.; Tâche, F.; Saïd, I.; Durier, V.; Canonge, S.; Amé, J.M.; et al. Social Integration of Robots into Groups of Cockroaches to Control Self-Organized Choices. Science 2007, 318, 1155–1158. [Google Scholar] [CrossRef] [PubMed]
  56. Ioannidis, E.; Varsakelis, N.; Antoniou, I. Change Agents and Internal Communications in Organizational Networks. Phys. A Stat. Mech. Its Appl. 2019, 528, 121385. [Google Scholar] [CrossRef]
  57. Galam, S. Contrarian Deterministic Effects on Opinion Dynamics: “The Hung Elections Scenario”. Phys. A Stat. Mech. Its Appl. 2004, 333, 453–460. [Google Scholar] [CrossRef]
  58. Amblard, F.; Deffuant, G. The Role of Network Topology on Extremism Propagation with the Relative Agreement Opinion Dynamics. Phys. A Stat. Mech. Its Appl. 2004, 343, 725–738. [Google Scholar] [CrossRef]
  59. Deffuant, G.; Amblard, F.; Weisbuch, G.; Faure, T. How Can Extremism Prevail? A Study Based on the Relative Agreement Interaction Model. J. Artif. Soc. Soc. Simul. 2002, 5, 1. [Google Scholar]
  60. Deffuant, G. Comparing Extremism Propagation Patterns in Continuous Opinion Models. J. Artif. Soc. Soc. Simul. 2006, 9, 8. [Google Scholar]
  61. Fan, K.; Pedrycz, W. Emergence and Spread of Extremist Opinions. Phys. A Stat. Mech. Its Appl. 2015, 436, 87–97. [Google Scholar] [CrossRef]
  62. Khashanah, K.; Alsulaiman, T. Network Theory and Behavioral Finance in a Heterogeneous Market Environment. Complexity 2016, 21, 530–554. [Google Scholar] [CrossRef]
  63. Shiller, R.J.; Pound, J. Survey Evidence on Diffusion of Interest and Information among Investors. J. Econ. Behav. Organ. 1989, 12, 47–66. [Google Scholar] [CrossRef]
  64. Shive, S. An Epidemic Model of Investor Behavior. J. Financ. Quant. Anal. 2010, 45, 169–198. [Google Scholar] [CrossRef]
  65. Oldham, M. Understanding How Short-Termism and a Dynamic Investor Network Affects Investor Returns: An Agent-Based Perspective. Complexity 2019, 2019, 1715624. [Google Scholar] [CrossRef]
  66. Simon, H.A. Rational Decision Making in Business Organizations. Am. Econ. Rev. 1979, 69, 493–513. [Google Scholar]
  67. Panchenko, V.; Gerasymchuk, S.; Pavlov, O.V. Asset Price Dynamics with Heterogeneous Beliefs and Local Network Interactions. J. Econ. Dyn. Control 2013, 37, 2623–2642. [Google Scholar] [CrossRef]
  68. Brock, W.A.; Hommes, C.H. Heterogeneous Beliefs and Routes to Chaos in a Simple Asset Pricing Model. J. Econ. Dyn. Control 1998, 22, 1235–1274. [Google Scholar] [CrossRef]
  69. Zubillaga, B.J.; Vilela, A.L.M.; Wang, C.; Nelson, K.P.; Stanley, H.E. A Three-State Opinion Formation Model for Financial Markets. Phys. A Stat. Mech. Its Appl. 2022, 588, 126527. [Google Scholar] [CrossRef]
  70. DeOliveira, M.J. Isotropic Majority-Vote Model on a Square Lattice. J. Stat. Phys. 1992, 66, 273–281. [Google Scholar] [CrossRef]
  71. Vilela, A.L.M.; Wang, C.; Nelson, K.P.; Stanley, H.E. Majority-Vote Model for Financial Markets. Phys. A Stat. Mech. Its Appl. 2019, 515, 762–770. [Google Scholar] [CrossRef]
  72. Oliveira, I.V.G.; Wang, C.; Dong, G.; Du, R.; Fiore, C.E.; Vilela, A.L.M.; Stanley, H.E. Entropy Production on Cooperative Opinion Dynamics. Chaos Solitons Fractals 2024, 181, 114694. [Google Scholar] [CrossRef]
  73. Vilela, A.L.M.; Zubillaga, B.J.; Wang, C.; Wang, M.; Du, R.; Stanley, H.E. Three-State Majority-Vote Model on Scale-Free Networks and the Unitary Relation for Critical Exponents. Sci Rep 2020, 10, 8255. [Google Scholar] [CrossRef] [PubMed]
  74. Yang, J.-H.S. Social Network Influence and Market Instability. J. Math. Econ. 2009, 45, 257–276. [Google Scholar] [CrossRef]
  75. Restocchi, V.; McGroarty, F.; Gerding, E.; Brede, M. Opinion Dynamics Explain Price Formation in Prediction Markets. Entropy 2023, 25, 1152. [Google Scholar] [CrossRef] [PubMed]
  76. DeLellis, P.; Di Meglio, A.; Lo Iudice, F. Overconfident Agents and Evolving Financial Networks. Nonlinear Dyn. 2018, 92, 33–40. [Google Scholar] [CrossRef]
  77. DeLellis, P.; DiMeglio, A.; Garofalo, F.; Lo Iudice, F. The Evolving Cobweb of Relations among Partially Rational Investors. PLoS ONE 2017, 12, e0171891. [Google Scholar] [CrossRef] [PubMed]
  78. Gil, S.; Zanette, D.H. Coevolution of Agents and Networks: Opinion Spreading and Community Disconnection. Phys. Lett. A 2006, 356, 89–94. [Google Scholar] [CrossRef]
  79. Ioannidis, E.; Varsakelis, N.; Antoniou, I. Promoters versus Adversaries of Change: Agent-Based Modeling of Organizational Conflict in Co-Evolving Networks. Mathematics 2020, 8, 2235. [Google Scholar] [CrossRef]
  80. Vazquez, F.; Eguíluz, V.M.; Miguel, M.S. Generic Absorbing Transition in Coevolution Dynamics. Phys. Rev. Lett. 2008, 100, 108702. [Google Scholar] [CrossRef] [PubMed]
  81. Capuano, N.; Chiclana, F.; Fujita, H.; Herrera-Viedma, E.; Loia, V. Fuzzy Group Decision Making With Incomplete Information Guided by Social Influence. IEEE Trans. Fuzzy Syst. 2018, 26, 1704–1718. [Google Scholar] [CrossRef]
  82. Cook, W.D. Distance-Based and Ad Hoc Consensus Models in Ordinal Preference Ranking. Eur. J. Oper. Res. 2006, 172, 369–385. [Google Scholar] [CrossRef]
  83. Dong, Y.; Zha, Q.; Zhang, H.; Herrera, F. Consensus Reaching and Strategic Manipulation in Group Decision Making With Trust Relationships. IEEE Trans. Syst. Man Cybern. Syst. 2021, 51, 6304–6318. [Google Scholar] [CrossRef]
  84. Dong, Q.; Zhou, X.; Martínez, L. A Hybrid Group Decision Making Framework for Achieving Agreed Solutions Based on Stable Opinions. Inf. Sci. 2019, 490, 227–243. [Google Scholar] [CrossRef]
  85. Liang, H.; Dong, Y.; Ding, Z.; Urena, R.; Chiclana, F.; Herrera-Viedma, E. Consensus Reaching With Time Constraints and Minimum Adjustments in Group With Bounded Confidence Effects. IEEE Trans. Fuzzy Syst. 2020, 28, 2466–2479. [Google Scholar] [CrossRef]
  86. Ureña, R.; Chiclana, F.; Melançon, G.; Herrera-Viedma, E. A Social Network Based Approach for Consensus Achievement in Multiperson Decision Making. Inf. Fusion 2019, 47, 72–87. [Google Scholar] [CrossRef]
  87. Zha, Q.; Dong, Y.; Zhang, H.; Chiclana, F.; Herrera-Viedma, E. A Personalized Feedback Mechanism Based on Bounded Confidence Learning to Support Consensus Reaching in Group Decision Making. IEEE Trans. Syst. Man Cybern. Syst. 2021, 51, 3900–3910. [Google Scholar] [CrossRef]
  88. Zha, Q.; Liang, H.; Kou, G.; Dong, Y.; Yu, S. A Feedback Mechanism With Bounded Confidence-Based Optimization Approach for Consensus Reaching in Multiple Attribute Large-Scale Group Decision-Making. IEEE Trans. Comput. Soc. Syst. 2019, 6, 994–1006. [Google Scholar] [CrossRef]
  89. Du, Z.; Yu, S.; Luo, H.; Lin, X. Consensus Convergence in Large-Group Social Network Environment: Coordination between Trust Relationship and Opinion Similarity. Knowl.-Based Syst. 2021, 217, 106828. [Google Scholar] [CrossRef]
  90. Li, Y.; Kou, G.; Li, G.; Peng, Y. Consensus Reaching Process in Large-Scale Group Decision Making Based on Bounded Confidence and Social Network. Eur. J. Oper. Res. 2022, 303, 790–802. [Google Scholar] [CrossRef]
  91. Cannon-Bowers, J.A.; Salas, E.; Converse, S.A. Cognitive Psychology and Team Training: Training Shared Mental Models and Complex Systems. Hum. Factors Soc. Bull. 1990, 33, 1–4. [Google Scholar]
  92. Langan-Fox, J.; Wirth, A.; Code, S.; Langfield-Smith, K.; Wirth, A. Analyzing Shared and Team Mental Models. Int. J. Ind. Ergon. 2001, 28, 99–112. [Google Scholar] [CrossRef]
  93. Burtscher, M.J.; Manser, T. Team Mental Models and Their Potential to Improve Teamwork and Safety: A Review and Implications for Future Research in Healthcare. Saf. Sci. 2012, 50, 1344–1354. [Google Scholar] [CrossRef]
  94. Sayama, H.; Farrell, D.L.; Dionne, S.D. The Effects of Mental Model Formation on Group Decision Making: An Agent-Based Simulation. Complexity 2011, 16, 49–57. [Google Scholar] [CrossRef]
  95. Chao, X.; Kou, G.; Peng, Y.; Viedma, E.H. Large-Scale Group Decision-Making with Non-Cooperative Behaviors and Heterogeneous Preferences: An Application in Financial Inclusion. Eur. J. Oper. Res. 2021, 288, 271–293. [Google Scholar] [CrossRef]
  96. Chao, X.; Kou, G.; Peng, Y.; Herrera-Viedma, E.; Herrera, F. An Efficient Consensus Reaching Framework for Large-Scale Social Network Group Decision Making and Its Application in Urban Resettlement. Inf. Sci. 2021, 575, 499–527. [Google Scholar] [CrossRef]
  97. Ioannidis, E.; Varsakelis, N.; Antoniou, I. False Beliefs in Unreliable Knowledge Networks. Phys. A Stat. Mech. Its Appl. 2017, 470, 275–295. [Google Scholar] [CrossRef]
  98. Phelps, C.; Heidl, R.; Wadhwa, A. Knowledge, Networks, and Knowledge Networks: A Review and Research Agenda. J. Manag. 2012, 38, 1115–1166. [Google Scholar] [CrossRef]
  99. Cowan, R.; Jonard, N. Network Structure and the Diffusion of Knowledge. J. Econ. Dyn. Control 2004, 28, 1557–1575. [Google Scholar] [CrossRef]
  100. Luo, S.; Du, Y.; Liu, P.; Xuan, Z.; Wang, Y. A Study on Coevolutionary Dynamics of Knowledge Diffusion and Social Network Structure. Expert Syst. Appl. 2015, 42, 3619–3633. [Google Scholar] [CrossRef]
  101. Cowan, R.; Jonard, N. The Dynamics of Collective Invention. J. Econ. Behav. Organ. 2003, 52, 513–532. [Google Scholar] [CrossRef]
  102. Kim, H.; Park, Y. Structural Effects of R&D Collaboration Network on Knowledge Diffusion Performance. Expert Syst. Appl. 2009, 36, 8986–8992. [Google Scholar] [CrossRef]
  103. Lin, M.; Li, N. Scale-Free Network Provides an Optimal Pattern for Knowledge Transfer. Phys. A Stat. Mech. Its Appl. 2010, 389, 473–480. [Google Scholar] [CrossRef]
  104. Yang, G.-Y.; Hu, Z.-L.; Liu, J.-G. Knowledge Diffusion in the Collaboration Hypernetwork. Phys. A Stat. Mech. Its Appl. 2015, 419, 429–436. [Google Scholar] [CrossRef]
  105. Ioannidis, E.; Varsakelis, N.; Antoniou, I. Experts in Knowledge Networks: Central Positioning and Intelligent Selections. Phys. A Stat. Mech. Its Appl. 2018, 509, 890–905. [Google Scholar] [CrossRef]
  106. Ioannidis, E.; Varsakelis, N.; Antoniou, I. Communication Policies in Knowledge Networks. Phys. A Stat. Mech. Its Appl. 2018, 492, 360–374. [Google Scholar] [CrossRef]
  107. Ioannidis, E.; Varsakelis, N.; Antoniou, I. Intelligent Agents in Co-Evolving Knowledge Networks. Mathematics 2021, 9, 103. [Google Scholar] [CrossRef]
  108. Sankar, C.P.; Thumba, D.A.; Ramamohan, T.R.; Chandra, S.S.V.; Satheesh Kumar, K. Agent-Based Multi-Edge Network Simulation Model for Knowledge Diffusion through Board Interlocks. Expert Syst. Appl. 2020, 141, 112962. [Google Scholar] [CrossRef]
  109. Shi, Y.; Zeng, Y.; Engo, J.; Han, B.; Li, Y.; Muehleisen, R.T. Leveraging Inter-Firm Influence in the Diffusion of Energy Efficiency Technologies: An Agent-Based Model. Appl. Energy 2020, 263, 114641. [Google Scholar] [CrossRef]
  110. Galam, S. (Ed.) Sociophysics: Weaknesses, Achievements, and Challenges. In Sociophysics: A Physicist’s Modeling of Psycho-Political Phenomena; Springer US: Boston, MA, USA, 2012; pp. 69–90. ISBN 978-1-4614-2032-3. [Google Scholar]
  111. Crass, D.; Garcia Valero, F.; Pitton, F.; Rammer, C. Protecting Innovation Through Patents and Trade Secrets: Evidence for Firms with a Single Innovation. Int. J. Econ. Bus. 2019, 26, 117–156. [Google Scholar] [CrossRef]
  112. Pinello, C.; Picone, P.M.; Mocciaro Li Destri, A. Co-Branding Research: Where We Are and Where We Could Go from Here. Eur. J. Mark. 2022, 56, 584–621. [Google Scholar] [CrossRef]
  113. Giglio, C.; Corvello, V.; Coniglio, I.M.; Kraus, S.; Gast, J. Cooperation between Large Companies and Start-Ups: An Overview of the Current State of Research. Eur. Manag. J. 2023, in press. [Google Scholar] [CrossRef]
  114. Parsons, T. The Structure of Social Action; The Free Press: New York, NY, USA, 1949. [Google Scholar]
  115. Burt, R.S. Toward a Structural Theory of Action: Network Models of Social Structure, Perception, and Action; Quantitative studies in social relations; Academic Press: New York, NY, USA, 1982; ISBN 978-0-12-147150-7. [Google Scholar]
  116. Antoniou, I.; Ioannidis, E.; Varsakelis, N. Co-Evolutionary Complex Networks. In Nonequilibrium Thermodynamics and Fluctuation Kinetics; Brenig, L., Brilliantov, N., Tlidi, M., Eds.; Fundamental Theories of Physics; Springer International Publishing: Cham, Switzerland, 2022; Volume 208, pp. 277–302. ISBN 978-3-031-04457-1. [Google Scholar]
  117. Ward, M.D.; Stovel, K.; Sacks, A. Network Analysis and Political Science. Annu. Rev. Political Sci. 2011, 14, 245–264. [Google Scholar] [CrossRef]
  118. Orsini, A.; Le Prestre, P.; Haas, P.M.; Brosig, M.; Pattberg, P.; Widerberg, O.; Gomez-Mera, L.; Morin, J.-F.; Harrison, N.E.; Geyer, R.; et al. Forum: Complex Systems and International Governance. Int. Stud. Rev. 2020, 22, 1008–1038. [Google Scholar] [CrossRef]
  119. Jervis, R. System Effects: Complexity in Political and Social Life; Princeton University Press: Princeton, NJ, USA, 1997; ISBN 978-0-691-00530-0. [Google Scholar]
  120. Giddens, A. The Constitution of Society. Outline of the Theory of Structuration, 1st ed.; Polity Press: Cambridge, UK, 1984; ISBN 978-0-520-05728-9. [Google Scholar]
  121. Schweitzer, F.; Garas, A.; Tomasello, M.V.; Vaccario, G.; Verginer, L. The Role of Network Embeddedness on the Selection of Collaboration Partners: An Agent-Based Model with Empirical Validation. Adv. Complex Syst. 2022, 25, 2250003. [Google Scholar] [CrossRef]
  122. Vaccario, G.; Tomasello, M.V.; Tessone, C.J.; Schweitzer, F. Quantifying Knowledge Exchange in R&D Networks: A Data-Driven Model. J. Evol. Econ. 2018, 28, 461–493. [Google Scholar] [CrossRef]
  123. Guzmán Rincón, A.; Carrillo Barbosa, R.L.; Segovia-García, N.; Africano Franco, D.R. Disinformation in Social Networks and Bots: Simulated Scenarios of Its Spread from System Dynamics. Systems 2022, 10, 34. [Google Scholar] [CrossRef]
  124. Sulis, E.; Tambuscio, M. Simulation of Misinformation Spreading Processes in Social Networks: An Application with NetLogo. In Proceedings of the 2020 IEEE 7th International Conference on Data Science and Advanced Analytics (DSAA), Sydney, NSW, Australia, 6–9 October 2020; pp. 614–618. [Google Scholar]
  125. Tsai, W. Knowledge Transfer in Intraorganizational Networks: Effects of Network Position and Absorptive Capacity on Business Unit Innovation and Performance. Acad. Manag. J. 2001, 44, 996–1004. [Google Scholar] [CrossRef]
  126. McInerney, C. Knowledge Management and the Dynamic Nature of Knowledge. J. Am. Soc. Inf. Sci. Technol. 2002, 53, 1009–1018. [Google Scholar] [CrossRef]
  127. Xu, Y.; Wen, X.; Zhang, W. A Two-Stage Consensus Method for Large-Scale Multi-Attribute Group Decision Making with an Application to Earthquake Shelter Selection. Comput. Ind. Eng. 2018, 116, 113–129. [Google Scholar] [CrossRef]
Table 1. Mathematical Formulation of Opinion, Distance and Consensus at different hierarchical levels of interaction.
Table 1. Mathematical Formulation of Opinion, Distance and Consensus at different hierarchical levels of interaction.
LevelOpinionDistanceConsensus
Micro O i [ γ ] ( t ) = o i [ γ ] p ( q ) ( t ) m × n Agent i to agent j :
d i j γ = d O j γ t ,   O i γ t
Agent i to cluster G γ :
d i γ = d O i [ γ ] ( t ) , O γ ( t )
Agent i to cluster G γ :
C O i [ γ ] ( t ) = 1 d O i [ γ ] ( t ) , O γ ( t )
Meso O γ ( t ) = i = 1 G γ r i γ · O i [ γ ] ( t ) = o [ γ ] p ( q ) ( t ) m × n - C O γ ( t ) = i = 1 G γ r i [ γ ] · C O i [ γ ] ( t )
Macro O t = z = 1 Z r z O z t = o p ( q ) ( t ) m × n - C O ( t ) = z = 1 Z r z · C O z ( t )
Table 2. In-Cluster Opinion Diffusion for an agent i of cluster G γ .
Table 2. In-Cluster Opinion Diffusion for an agent i of cluster G γ .
ConditionCaseSubcaseInfluence fromOpinion Update for Agent i
C O t < φ  
C O γ t = min z 1 , , Z C O z t
S i E i -all agents j S i E i O i γ t + 1 = I i O i γ t + 1 I i S i E i j S i E i O j γ t
S i E i = S i The agent κ , specified as:
O κ γ t = a r g max j S i C O j γ t
O i γ t + 1 = I i O i γ t + 1 I i O κ γ t
S i = E i The agent κ , specified as:
O κ γ t = a r g max j E i C O j γ t
S i = E i = A hypothetical agent κ , defined as:
O κ γ t = O i γ t + ε i d i s γ O s γ t O i γ t
with
O s γ t = a r g max j G γ C O j γ t
Table 3. Key issues, recommendations and indicative approaches for future tackling of important research gaps/issues in the field of Sociophysics.
Table 3. Key issues, recommendations and indicative approaches for future tackling of important research gaps/issues in the field of Sociophysics.
IssueRecommendationPreliminary or Indicative Approaches
Dearth of socioeconomic applications in the GDM and KD categories.Exploration of collaborative aspects of socioeconomic reality.Chao et al. (2021a) [95]
Chao et al. (2021b) [96]
Schweitzer at al. (2022) [121]
Exploration of knowledge transfer phenomena between financially oriented agents.Vaccario et al. (2018) [122]
Sankar et al. (2020) [108]
Shi et al. (2020) [109]
Lack of empirical validation.Incorporation of available datasets for the calibration and testing of ABM sociophysical models.Schweitzer et al. (2022) [121]
Vaccario et al. (2018) [122]
Misalignment between Sociophysics and social reality.Emphasis on agent-structure co-evolution.DeLellis et al. (2017) [77]
DeLellis et al. (2018) [76]
Ioannidis et al. (2020) [79]
Ioannidis et al. (2021) [107]
Antoniou et al. (2022) [116]
Depiction of micro, meso and macro-level influence on agents’ actions and vice-versa.Zubillaga et al. (2022) [69]
Li et al. (2022) [90]
Incorporation of the element of conscious selection and interaction.Panchenko et al. (2013) [67]
Ioannidis et al. (2018a) [105]
Ioannidis et al. (2018b) [106]
Ioannidis et al. (2021) [107]
Disclaimer/Publisher’s Note: The statements, opinions and data contained in all publications are solely those of the individual author(s) and contributor(s) and not of MDPI and/or the editor(s). MDPI and/or the editor(s) disclaim responsibility for any injury to people or property resulting from any ideas, methods, instructions or products referred to in the content.

Share and Cite

MDPI and ACS Style

Tsintsaris, D.; Tsompanoglou, M.; Ioannidis, E. Dynamics of Social Influence and Knowledge in Networks: Sociophysics Models and Applications in Social Trading, Behavioral Finance and Business. Mathematics 2024, 12, 1141. https://doi.org/10.3390/math12081141

AMA Style

Tsintsaris D, Tsompanoglou M, Ioannidis E. Dynamics of Social Influence and Knowledge in Networks: Sociophysics Models and Applications in Social Trading, Behavioral Finance and Business. Mathematics. 2024; 12(8):1141. https://doi.org/10.3390/math12081141

Chicago/Turabian Style

Tsintsaris, Dimitris, Milan Tsompanoglou, and Evangelos Ioannidis. 2024. "Dynamics of Social Influence and Knowledge in Networks: Sociophysics Models and Applications in Social Trading, Behavioral Finance and Business" Mathematics 12, no. 8: 1141. https://doi.org/10.3390/math12081141

Note that from the first issue of 2016, this journal uses article numbers instead of page numbers. See further details here.

Article Metrics

Back to TopTop