<!DOCTYPE article PUBLIC "-//NLM//DTD JATS (Z39.96) Journal Archiving and Interchange DTD v1.0 20120330//EN" "JATS-archivearticle1.dtd">
<article xmlns:xlink="http://www.w3.org/1999/xlink">
  <front>
    <journal-meta />
    <article-meta>
      <title-group>
        <article-title>Exploring the Dynamics of Learned, Pre-existing, and Partial Knowledge in Dependence Networks within Multi-Agent Systems</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author">
          <string-name>Alessandro Sapienza</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Rino Falcone</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <aff id="aff0">
          <label>0</label>
          <institution>Institute of Cognitive Sciences and Technologies, National Research Council of Italy (ISTC-CNR)</institution>
          ,
          <addr-line>00185 Rome</addr-line>
          ,
          <country country="IT">Italy</country>
        </aff>
      </contrib-group>
      <abstract>
        <p>Dependence networks play a pivotal role in shaping interactions among agents in multi-agent systems, influencing collaboration, resource management, and overall system performance. In this study, we explore the efects of limited knowledge on the dynamics of dependence networks within such systems. Through a series of experiments, we investigate how agents with restricted awareness of their environment and potential partners navigate within dependence networks and the implications of their limitations on system outcomes. Our findings reveal that agents with limited knowledge face significant challenges, including reduced collaboration opportunities, suboptimal resource utilization, and limited goal achievement. Moreover, we demonstrate the tangible costs associated with acquiring trustworthiness knowledge and the critical role it plays in optimizing agent interactions. Overall, our study sheds light on the intricate interplay between knowledge, dependence, and trust in multi-agent systems, ofering insights into strategies for enhancing system eficiency in real-world applications.</p>
      </abstract>
      <kwd-group>
        <kwd>eol&gt;dependence networks</kwd>
        <kwd>trust</kwd>
        <kwd>multi-agent systems</kwd>
        <kwd>social-simulation</kwd>
      </kwd-group>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>1. Introduction</title>
      <p>
        Social dynamics play a particularly important role in social sciences, since they shed light on
how relationships develop, evolve, and shape human behavior, providing insights crucial for a
deeper understanding of society[
        <xref ref-type="bibr" rid="ref1 ref2 ref3">1, 2, 3</xref>
        ]. This is why the social sciences have devoted so much
interest to the study of these dynamics, in both a theoretical and practical perspective.
      </p>
      <p>
        Moreover, the dynamics of social bonds play a pivotal role in individual and community
decision-making processes. People are often influenced and conditioned by the beliefs and
actions of their social circles [
        <xref ref-type="bibr" rid="ref4">4</xref>
        ]. Understanding how these dynamics afect behavior is vital for
making more accurate predictions and planning efective social and economic interventions.
      </p>
      <p>This is precisely the context in which our research fits. Specifically, we are interested in
investigating dependence networks within hybrid societies comprising both human and artificial
agents, focusing on the social dynamics they give rise to, also in relation to the concept of trust.</p>
      <p>
        Specifically, this work builds upon the results obtained in previous studies[
        <xref ref-type="bibr" rid="ref5 ref6">5, 6</xref>
        ], to which
we refer for a more comprehensive formalization of the role of dependence. In particular, as
preliminary works, some limitations were highlighted. Firstly, preliminary studies investigated
dependence relationships within a limited network of agents: in a world where agents are
closely interrelated for the accomplishment of the tasks they need, having few partners available
is certainly a disadvantage. This point was addressed by significantly increasing the number of
available partners. In the scenarios considered here, we introduce a total of 30 agents, notably
more than the 6 in the previous works.
      </p>
      <p>Secondly, there was no efective reinforcement or punitive mechanism for partner selection.
In other words, there was no penalty for agents interacting with untrustworthy partners. In
such a case, adopting a restrictive partner selection strategy became counterproductive because,
without incurring any cost for incorrect interactions, the best strategy was to rely even on
unreliable partners.</p>
      <p>This mechanism was addressed by introducing a monetary capital that agents must use to
manage their interactions.</p>
      <p>Specifically, within this article, we aim to investigate the role of knowledge in relation to
dependence, addressing the following research questions:
1. How does the necessity to acquire knowledge on others’ trustworthiness impact? Since
trust is closely related to dependence, it is crucial to accurately evaluate partners to decide
whom to rely on. Without this knowledge, there is a "cost" to acquiring it.
2. What happens if agents possess partial and limited knowledge of the world? How does
this aspect afect their performance and that of other agents in the network?</p>
      <p>
        Indeed, the importance of investigating agents operating with restricted knowledge of their
environment and potential partners is evidenced by the great interest in the literature on this
subject[
        <xref ref-type="bibr" rid="ref10 ref11 ref12 ref13 ref7 ref8 ref9">7, 8, 9, 10, 11, 12, 13</xref>
        ].
      </p>
      <p>We address the two research questions by introducing a multi-agent simulation and modeling
a network of interconnected agents that need to carry out a series of tasks.</p>
    </sec>
    <sec id="sec-2">
      <title>2. Practical Formulation of the Model</title>
      <p>
        In this section, we focus on describing the framework we have developed. We chose to implement
the problem of dependence networks within the block world framework [
        <xref ref-type="bibr" rid="ref14 ref15 ref16">14, 15, 16</xref>
        ]. This domain
was chosen due to its characteristics, which make the block world an interesting study context.
Indeed, despite its conceptual simplicity, the block world ofers suficient complexity to model
a wide range of scenarios and behaviors. Precisely because of this nature, it allows for the
efective exploration of various aspects such as planning, learning, and social cooperation. The
specific world we consider comprises a table and several blocks with diferent characteristics
(shape, color, weight). Within the simulation context, agents must move specific blocks on the
table to achieve their goals. During the execution of their tasks, they may need to collaborate
with each other. As we will see, from this perspective, diferent strategies enable agents to
achieve more or less valid performances.
      </p>
      <p>Figure 1 shows how the simulated world appears at the beginning of the simulation.</p>
      <sec id="sec-2-1">
        <title>2.1. The blocks</title>
        <p>The blocks are characterized by diferent shapes (cylinders, cones, cubes, spheres, stars), colors
(red, blue, green, yellow, white), and weights (light, medium-light, medium, medium-heavy,
heavy). Overall, 125 blocks are present in the world. Moreover, blocks can have an owner,
i.e. a single agent who is authorized to change the status of the block in terms of position or
ownership. Initially, all blocks are out of the table. Some of them are assigned to an agent from
the beginning, while others are free and can be claimed by the agents.</p>
        <p>Indeed, blocks are a limited resource. They are abundant at the beginning but get consumed
for the agents’ goals. One type of block will be more valuable the rarer it is in the world. We
modeled this phenomenon by introducing a mechanism that takes into account the rarity of
blocks in agents’ transactions: a block will have a minimum value of 1 unit of capital and will
reach a maximum value, set in the simulation, when it remains the only available block of that
type.</p>
      </sec>
      <sec id="sec-2-2">
        <title>2.2. The agents</title>
        <p>Agents act in the world in order to realize their goals, i.e. to place specific blocks on the table.
Specifically, each agent is defined in terms of:
• A goal: the type of block the agent needs to move on the table.
• A given competence, which defines how capable an agent is in performing certain tasks.
• A category of membership: we considered two categories: human or artificial agents. The
category influences the characteristics of the agent. Specifically, we assume that humans
can move cylinders and cones, while robots can move cubes and spheres. Both types of
agents are able to move the stars.
• Resources (blocks): initially, each agent possesses a given number of blocks. As the
simulation progresses, this number changes because the agent can yield some blocks or
acquire others.
• Monetary capital: it is the initial capital that citizens have available to manage interactions
with other agents. This capital decreases when the agent delegates a task, while it increases
when they perform tasks for other agents.
• Beliefs: The entire perception and reasoning of the agents are based on beliefs, whether
they are about themselves, the world, or others. Therefore, there is a strong influence of
their personal interpretation of reality. Certainly, these beliefs can vary in accuracy or
even be absent.
• A  threshold, which determines how trustworthy its potential partners must be to
consider the dependence with them usable. Such a threshold value, specific to each agent,
has the purpose of verifying that the partner is capable of performing certain actions. Of
course, there remains a certain probability of error.</p>
        <p>Agents must collaborate to achieve their goals, considering their subjective dependence
networks, i.e. namely their personal perception of dependencies on others and of others on
themselves. Agents are acquainted with all other agents and blocks in the world.</p>
        <p>
          Introducing categories in this framework allows us, on the one hand, to diferentiate the
characteristics of the agents, such as their manipulation and action capabilities in the world.
On the other hand, this enables us to introduce and model processes of inferential reasoning[
          <xref ref-type="bibr" rid="ref17 ref18 ref19">17,
18, 19, 20</xref>
          ].
        </p>
      </sec>
      <sec id="sec-2-3">
        <title>2.3. Agents’ trust and trustworthiness</title>
        <p>In this study, we refer to the concept of trust as modeled in [21]. Trust is considered by the
agents for the selection of dependencies, serving as a mechanism to decide whether to interact
with one partner rather than another.</p>
        <p>Within the simulation context, we assume the absence of malicious agents; hence, we choose
not to consider the influence of motivational aspects on the determination of an agent’s
trustworthiness. For the sake of completeness, it is worth underlining that an agent might have
conflicting motivations regarding a task: for instance, it may not want to give up a block of its
interest as it will be needed for the completion of its sub-goals. However, this does not imply
malicious intent. In such a case, the agent will simply decline the proposed task.</p>
        <p>
          Therefore, we characterize agent trustworthiness in terms of , i.e., how efectively
they can accomplish tasks in the world. Competence is defined as a real value within the range
[
          <xref ref-type="bibr" rid="ref1">0,1</xref>
          ], where 0 implies a total inability to act, while 1 signifies a guaranteed success.
        </p>
        <p>In the simulated world, we consider three types of tasks:
1. Acquisition of a block.
2. Repositioning of a block.</p>
        <p>Since we have no interest in diferentiating the values of competence for these tasks, for
computational simplicity, we assume that an agent’s trustworthiness is the same for each of
them. We would like to point out that this is not necessarily true in reality. Indeed, skills on
diferent tasks usually tend to difer. Nevertheless, considering such a diference would have no
practical impact within our scenario.</p>
        <p>An agent is considered capable of achieving a task if it has a probability greater than a given
threshold  of accomplishing it. Such a probability is assessed through its trustworthiness
evaluation. As mentioned earlier, agents possess a trustworthiness. This is an intrinsic characteristic
of the agent that determines its task execution capability. As such, it cannot be accessed directly,
not even by the agent itself, but it can only be estimated. To estimate the trustworthiness of
agents, we consider a computational model based on the Beta distribution. The Beta distribution
is commonly employed in the analysis of agent trustworthiness [22, 23, 24, 25], especially when
it comes to modeling and estimating success or failure probabilities in complex situations. The
Beta distribution is defined by two parameters, denoted as  and  . As described in Equations 1
and 2, they depend on the estimation of the number of observed successes _ and
failures _  of the agent .</p>
        <p>= _ + 1
  = _  + 1
 ℎ =</p>
        <p>+</p>
        <p>In this context, the expected value of the distribution, representing the estimation of the
average trustworthiness  ℎ of an agent , is given by Equation 3:</p>
        <p>When an agent  identifies its lack of power to perform a task  and the consequent presence
of such power in another agent , a dependence is explicitly manifested. In this case, if agent
 suficiently trusts agent , i.e., the assessment that  has made of the trustworthiness of
 exceeds the trust threshold  of , then  will contact  for the execution of  . In our
framework, in the presence of multiple potential trustees, the choice is made randomly among
those selected as suficiently trustworthy.</p>
        <p>Note that lack of power may either mean a total impossibility to perform the task (for example,
the agent needs to move a certain type of block but does not have the physical characteristics
to do so), or it could also mean that the agent evaluates itself as not suficiently competent,
based on its internal threshold  , to execute  . In this case, the trustor agent will first attempt to
delegate the task to someone else. In the absence of potential partners, it will still try to execute
the task, as there is no cost associated with doing so.</p>
      </sec>
      <sec id="sec-2-4">
        <title>2.4. Beliefs</title>
        <p>Beliefs represent the perceptions and knowledge that agents possess about the state of the
environment, about other agents, and about the relationships between them. These beliefs
influence the decisions and actions of the agents and, consequently, guide the overall evolution
of the simulation. Indeed, their fundamental role becomes even more crucial if beliefs on
dependence networks are also considered.</p>
        <p>In our framework, agents possess beliefs about:
(1)
(2)
(3)
• their own goals;
• their own abilities;
• the blocks that exist in the world;
• who the owners of the blocks are;
• the other agents that exist in the world;
• the goals of the other agents;
• the abilities of the other agents;
• the plans of the other agents (they know which ones they possess, not how these plans
are articulated);
• dependencies on actions;
• dependencies on resources (blocks)
• dependencies on plans.</p>
        <p>In this contribution, beliefs play a particularly significant role as we investigate what happens
in the presence of limited knowledge. Indeed, in a network of agents, especially in relation to
dependence networks, limited knowledge can significantly impact the beliefs that agents hold.
Remarkably, agents with limited knowledge may fail to recognize all relevant dependencies
within the network. This can result in missed opportunities for collaboration or reliance on
less optimal partners. A similar problem concerns the use of resources. One must believe that a
resource exists in the world and is available in order to utilize it.</p>
      </sec>
    </sec>
    <sec id="sec-3">
      <title>3. Simulations</title>
      <p>Once the practical model is introduced, we proceed to examine its simulation implementations,
aiming to investigate the efectiveness of using dependence networks. In particular, we also
intend to explore the role of trust in this context. One of the limitations of previous experiments
lies in the small number of agents present in the network, specifically six. Thus, in this case, we
considered a total of 30 agents in the world. The goal is randomly assigned for all agents, thus
avoiding any agent being advantaged or disadvantaged by the complexity of the goal assigned
by the system. In each goal, two out of three components among weight, shape, and color
are specified, leaving the third dimension free. When an agent completes a task, it is assigned
another one, always randomly.</p>
      <p>In the experiments, we need a strategy that allows us to identify which agents perform better
and which perform worse. Specifically, we will assign a point each time an agent successfully
completes a goal. Additionally, another metric of fundamental importance is the capital of
the agents. On one hand, this dimension is crucial to account for how well the implemented
delegation strategy optimizes the success/failure ratio of delegated tasks. Furthermore, capital
is a dimension that also models how reliable an agent is considered within the network.</p>
    </sec>
    <sec id="sec-4">
      <title>4. Results</title>
      <p>We have considered 3 simulation scenarios in which to assess the efectiveness of using
dependence networks, specifically comparing their efectiveness with trust. The experiments
were conducted by using agent-based simulation, implementing what was described in the
previous sections on the 3D version of the NetLogo platform [26]. The experiments aim at
investigating the relationship between trust[27] and dependence networks[28, 29]. Specifically,
we are interested in analyzing:
1. The importance of identifying an efective strategy in trusting. This aspect has been
implemented through the trust threshold. We are interested in understanding whether,
in relation to dependencies, it is better to use more restrictive or more open evaluation
strategies.
2. The importance of being trustworthy within the network of agents.</p>
      <p>The results we report pertain to a window of 30 interactions among the agents, which is
suficient to stabilize the interactions. Moreover, what we considered are the results averaged
over 1000 simulations, in such a way as to eliminate the variability introduced by the random
efects on the individual runs.</p>
      <sec id="sec-4-1">
        <title>4.1. First simulation</title>
        <p>In this first experiment, we evaluate how the process of acquiring knowledge about partner
trustworthiness impacts on agent performance. To investigate this aspect, we compare two
scenarios: one where agents have to estimate trust from scratch and another where agents,
through a training phase, learn about this dimension beforehand.</p>
        <p>Moreover, we will divide agents into two groups of equal size, thus considering the 15 most
trustworthy and the 15 least trustworthy, and compare the performance of these groups.</p>
        <p>
          The experiments were conducted using the following settings:
• duration: 30 time units;
• training phase: 30 time units;
• number of agents: 30;
• number of blocks: 125;
• maximum value of a block: 5;
• percentage of human agents: 50%;
• percentage of artificial agents: 50
• initial capital: 10 unit;
• 2 blocks per agent;
• agents’  randomly assigned in the range [
          <xref ref-type="bibr" rid="ref1">0,1</xref>
          ];
•  threshold randomly assigned between 0.25, 0.5 and 0.75.
        </p>
        <p>As Table 1 shows, undoubtedly, the most trustworthy agents achieve better results. This
characteristic impacts both the final capital, as these agents receive on average more delegation
requests and have higher incomes, and the average score because, as seen in Section 2.3, agents
who consider themselves less trustworthy tend to delegate more than those who are more
trustworthy.</p>
        <p>We then proceed to analyze the trust strategies of the agents, with reference to the partner
selection thresholds: 0.25, 0.5, and 0.75. From Table 2, it emerges that agents with a lower
threshold generally manage to achieve better performance in terms of average score. However,
this happens strongly at the expense of the final capital. Despite having a higher score of 32.3%
compared to agents with a threshold of 0.75, these end up with a lower capital of 72.6%. On
the other hand, using a threshold of 0.75 allows for maintaining a higher capital. This occurs
because in this way agents delegate more cautiously: they manage to delegate less, but when
they do, they have a higher likelihood of success.</p>
        <p>Regarding the efect of training, we can observe that, in general, the average scores are
homogenized. Furthermore, examining the ratio of how many tasks are delegated by the most
trustworthy agents compared to the least trustworthy ones, this value stands at 0.82 without
training and 0.69 when training is introduced. Additionally, the ratio of how many tasks are
delegated to the most trustworthy agents compared to the least trustworthy ones stands at 2.20
without training and 3.03 after. Thus, in general, less trustworthy agents delegate more, and
more trustworthy agents receive more delegation requests. The introduction of training further
polarizes these efects.</p>
        <p>In practice, the presence of a training phase implies that there is already knowledge available
within the network, and this can be efectively utilized. For example, agents who consider
themselves less trustworthy will directly turn to others for the execution of their tasks. This, in
turn, results in better performance of these agents, which leads to fewer resources available in
the world for other agents.</p>
        <p>In general, we observe that by introducing training, expenses are minimized. This is
interesting because, in fact, the diference in terms of expenses represents the cost that agents should
pay to learn about the trustworthiness of their potential partners.</p>
      </sec>
      <sec id="sec-4-2">
        <title>4.2. Second simulation</title>
        <p>In this second experiment, we are interested in investigating the efects of limited knowledge
on the utilization of dependence networks. To explore the efects of this lack of knowledge, we
introduced agents who have a limited view of the world. These agents are able to observe only
a limited part of the world, which means knowing a restricted number of agents and having
access to a limited amount of resources. In this sense, the knowledge about dependencies that
can be exploited is reduced.</p>
        <p>
          The experiments were conducted using the following settings:
• duration: 30 time units;
• number of agents: 30;
• percentage of agents with limited knowledge about the world: 16.7%, 33.3%, 50%;
• percentage of known world: 25%, 50%, 75%;
• number of blocks: 125;
• maximum value of a block: 5;
• percentage of human agents: 50%;
• percentage of artificial agents: 50
• initial capital: 10 unit;
• 2 blocks per agent;
• agents’  randomly assigned in the range [
          <xref ref-type="bibr" rid="ref1">0,1</xref>
          ];
•  threshold randomly assigned between 0.25, 0.5 and 0.75.
        </p>
        <p>Within Table 3 and Table 4, the Setting refers to the combination of how many agents with
limited knowledge there are in the world and how limited their knowledge is.</p>
        <p>From Table 3, it indeed emerges that knowledge limitations have a significant and strong
impact on the agents’ performance: generally, starting from very low average scores (between
0.85 and 0.89) when agents can observe only 25% of the world, their performance improves
significantly as their knowledge increases, reaching a maximum (between 2.35 and 2.39) when
agents have access to 75% of the world.</p>
        <p>Conversely, Table 4 indicates the opposite trend for the remaining agents, who start from
a situation of substantial advantage and gradually achieve fewer goals. This dynamic occurs
because, in the presence of agents with severe knowledge limitations, the remaining agents
can exploit their knowledge more efectively, utilizing more resources than others. By reducing
the knowledge gap between these two categories of agents, the diference in terms of scores
decreases considerably.</p>
        <p>Thus, indeed, having limited knowledge severely restricts the efective utilization of
dependencies. While this represents a significant disadvantage for these agents, the remaining agents
can exploit this situation to their advantage.</p>
      </sec>
    </sec>
    <sec id="sec-5">
      <title>5. Discussion and Conclusions</title>
      <p>This work builds upon the findings of previous studies on dependence networks, focusing on
the role of knowledge. In comparison to prior works, this article contributes by investigating the
diference between needing to learn and already knowing information, and between possessing
it entirely or partially, within dependence networks in multi-agent systems. These problems are
also explored in relation to trust, particularly focusing on the trust strategy and the relevance
of being trustworthy.</p>
      <p>Remarkably, in both experiments, albeit on diferent aspects, the value of knowledge clearly
emerges. In its absence, there are significant limitations on the utilization of dependencies, i.e
agents cannot optimally leverage the network for collaborations, which negatively afects their
performance.</p>
      <p>In the first experiment, we demonstrate how the lack of knowledge about agents’
trustworthiness results in an actual cost to acquire it. This cost is paid through the direct experience that
agents have with the world and their partners. Initially, agents enter the environment with no
pre-established understanding of who among their peers is trustworthy or not. As a result, they
must engage in interactions and collaborations based on failure and error, which involves both
successful and failed attempts at task delegation. Each failed attempt represents a tangible cost:
it could mean wasted resources, missed opportunities, and time lost in reattempting the same
task or seeking out new partners. Moreover, the process of learning from these interactions
incurs additional cognitive and computational costs as agents need to continually update their
beliefs and strategies based on the outcomes of their engagements. This iterative process of
refining trust assessments underscores a significant investment in terms of efort and eficiency.
The cumulative efect of these costs highlights the critical importance of initial knowledge about
trustworthiness in optimizing agent performance within the network.</p>
      <p>Conversely, this situation represents an advantage for the remaining agents, who can
efectively exploit resources in the world.</p>
      <p>In the second experiment, we analyze what happens to agents with limited knowledge of the
world. These agents face significant interaction limitations, as their restricted understanding of
the environment hampers their ability to identify and connect with potential collaborators. As a
consequence, they often miss out on crucial opportunities for cooperation and resource sharing,
leading to suboptimal performance. Their lack of comprehensive knowledge means they cannot
fully leverage the dependencies within the network, which is vital for achieving complex tasks
that require coordinated eforts. This limited knowledge also results in ineficient use of the
capital they possess, as they are unable to identify the most strategic ways to invest or utilize
their resources. Conversely, this situation represents a distinct advantage for the remaining
agents, who possess a broader and more accurate understanding of the world. These agents can
capitalize on the limitations of their counterparts, efectively exploiting available resources and
maximizing their performance within the network.</p>
      <p>Another finding is that more relaxed delegation strategies regarding trust lead to higher
performance, but at a significantly higher cost. It is noteworthy that this scenario considered a
world with strictly finite resources. Indeed, in the absence of such a condition, this strategy
would be further penalized.</p>
      <p>This analysis has provided valuable insights into the role of knowledge within dependence
networks. These aspects certainly deserve further investigation. Additionally, it would be
interesting to explore the efects of erroneous beliefs on dependencies. Erroneous beliefs
can significantly influence agents’ behavior, since they can lead agents to take suboptimal or
even harmful actions, as they are based on incorrect information about dependencies among
themselves and other agents. For example, an agent may mistakenly believe to be dependent on
another agent when in fact it is not, or vice versa. This could lead to erroneous decisions in
resource management or collaborative task planning. Therefore, understanding how erroneous
beliefs influence the dynamics of dependence networks is crucial for developing more efective
strategies and improving the overall performance of the multi-agent system. We intend to
investigate this aspect in future work.</p>
    </sec>
    <sec id="sec-6">
      <title>Acknowledgments</title>
      <p>This work has been partially supported by the project FAIR - Future Artificial Intelligence
Research (MIUR-PNRR).
[20] X. Liu, A. Datta, K. Rzadca, E.-P. Lim, Stereotrust: a group based personalized trust model,
in: Proceedings of the 18th ACM conference on Information and knowledge management,
2009, pp. 7–16.
[21] C. Castelfranchi, R. Falcone, Trust theory: A socio-cognitive and computational model,</p>
      <p>John Wiley &amp; Sons, 2010.
[22] D. Choi, S. Jin, Y. Lee, Y. Park, Personalized eigentrust with the beta distribution, ETRI
journal 32 (2010) 348–350.
[23] W. Fang, C. Zhang, Z. Shi, Q. Zhao, L. Shan, Btres: Beta-based trust and reputation
evaluation system for wireless sensor networks, Journal of Network and Computer
Applications 59 (2016) 88–94.
[24] W. Fang, W. Zhang, Y. Yang, Y. Liu, W. Chen, A resilient trust management scheme for
defending against reputation time-varying attacks based on beta distribution, Science
China Information Sciences 60 (2017) 1–11.
[25] V. Kanchana Devi, R. Ganesan, Trust-based selfish node detection mechanism using beta
distribution in wireless sensor network, J. ICT Res. Appl 13 (2019) 79–92.
[26] U. Wilensky, Netlogo. evanston, il: Center for connected learning and computer-based
modeling, northwestern university, 1999.
[27] A. Sapienza, F. Cantucci, R. Falcone, Modeling interaction in human–machine systems: A
trust and trustworthiness approach, Automation 3 (2022) 242–257.
[28] R. Conte, J. S. Sichman, Depnet: How to benefit from social dependence, Journal of</p>
      <p>Mathematical Sociology 20 (1995) 161–177.
[29] S. Za, F. Marzo, M. De Marco, M. Cavallari, Agent based simulation of trust dynamics in
dependence networks, in: Exploring Services Science: 6th International Conference, IESS
2015, Porto, Portugal, February 4-6, 2015, Proceedings 6, Springer, 2015, pp. 243–252.</p>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          [1]
          <string-name>
            <given-names>X.</given-names>
            <surname>Jin</surname>
          </string-name>
          ,
          <string-name>
            <surname>Y. Wang,</surname>
          </string-name>
          <article-title>Research on social network structure and public opinions dissemination of micro-blog based on complex network analysis</article-title>
          ,
          <source>Journal of Networks</source>
          <volume>8</volume>
          (
          <year>2013</year>
          )
          <fpage>1543</fpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          [2]
          <string-name>
            <given-names>S.</given-names>
            <surname>Wasserman</surname>
          </string-name>
          ,
          <string-name>
            <given-names>K.</given-names>
            <surname>Faust</surname>
          </string-name>
          ,
          <article-title>Social network analysis: Methods and applications (</article-title>
          <year>1994</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          [3]
          <string-name>
            <given-names>D. J.</given-names>
            <surname>Watts</surname>
          </string-name>
          ,
          <article-title>Six degrees: The science of a connected age</article-title>
          ,
          <source>WW Norton &amp; Company</source>
          ,
          <year>2004</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          [4]
          <string-name>
            <given-names>R. B.</given-names>
            <surname>Cialdini</surname>
          </string-name>
          ,
          <string-name>
            <given-names>N. J.</given-names>
            <surname>Goldstein</surname>
          </string-name>
          ,
          <article-title>Social influence: Compliance and conformity</article-title>
          ,
          <source>Annu. Rev. Psychol</source>
          .
          <volume>55</volume>
          (
          <year>2004</year>
          )
          <fpage>591</fpage>
          -
          <lpage>621</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref5">
        <mixed-citation>
          [5]
          <string-name>
            <given-names>R.</given-names>
            <surname>Falcone</surname>
          </string-name>
          ,
          <string-name>
            <given-names>C.</given-names>
            <surname>Castelfranchi</surname>
          </string-name>
          ,
          <article-title>Grounding human machine interdependence through dependence and trust networks: Basic elements for extended sociality</article-title>
          ,
          <source>Frontiers in Physics 10</source>
          (
          <year>2022</year>
          )
          <fpage>946095</fpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref6">
        <mixed-citation>
          [6]
          <string-name>
            <given-names>R.</given-names>
            <surname>Falcone</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Sapienza</surname>
          </string-name>
          ,
          <article-title>The role of trust in dependence networks: A case study</article-title>
          ,
          <source>Information</source>
          <volume>14</volume>
          (
          <year>2023</year>
          )
          <fpage>652</fpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref7">
        <mixed-citation>
          [7]
          <string-name>
            <given-names>P.</given-names>
            <surname>De Meo</surname>
          </string-name>
          ,
          <string-name>
            <given-names>F.</given-names>
            <surname>Messina</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D.</given-names>
            <surname>Rosaci</surname>
          </string-name>
          ,
          <string-name>
            <given-names>G. M.</given-names>
            <surname>Sarné</surname>
          </string-name>
          ,
          <article-title>Recommending users in social networks by integrating local and global reputation</article-title>
          ,
          <source>in: Internet and Distributed Computing Systems: 7th International Conference, IDCS</source>
          <year>2014</year>
          , Calabria, Italy,
          <source>September 22-24</source>
          ,
          <year>2014</year>
          . Proceedings 7, Springer,
          <year>2014</year>
          , pp.
          <fpage>437</fpage>
          -
          <lpage>446</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref8">
        <mixed-citation>
          [8]
          <string-name>
            <given-names>R.</given-names>
            <surname>Falcone</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Sapienza</surname>
          </string-name>
          ,
          <string-name>
            <given-names>C.</given-names>
            <surname>Castelfranchi</surname>
          </string-name>
          ,
          <article-title>Recommendation of categories in an agents world: The role of (not) local communicative environments</article-title>
          ,
          <source>in: 2015 13th Annual Conference on Privacy, Security and Trust (PST)</source>
          , IEEE,
          <year>2015</year>
          , pp.
          <fpage>7</fpage>
          -
          <lpage>13</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref9">
        <mixed-citation>
          [9]
          <string-name>
            <given-names>A.</given-names>
            <surname>Herzig</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A. Y.</given-names>
            <surname>Ginel</surname>
          </string-name>
          <article-title>, Multi-agent abstract argumentation frameworks with incomplete knowledge of attacks</article-title>
          , in: Thirtieth
          <source>International Joint Conference on Artificial Intelligence (IJCAI</source>
          <year>2021</year>
          ),
          <year>2021</year>
          , pp.
          <fpage>1922</fpage>
          -
          <lpage>1928</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref10">
        <mixed-citation>
          [10]
          <string-name>
            <given-names>D.</given-names>
            <surname>Rosaci</surname>
          </string-name>
          , Cilios:
          <article-title>Connectionist inductive learning and inter-ontology similarities for recommending information agents</article-title>
          ,
          <source>Information systems 32</source>
          (
          <year>2007</year>
          )
          <fpage>793</fpage>
          -
          <lpage>825</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref11">
        <mixed-citation>
          [11]
          <string-name>
            <given-names>D.</given-names>
            <surname>Rosaci</surname>
          </string-name>
          ,
          <article-title>Web recommender agents with inductive learning capabilities</article-title>
          ,
          <source>Emergent Web Intelligence: Advanced Information Retrieval</source>
          (
          <year>2010</year>
          )
          <fpage>233</fpage>
          -
          <lpage>267</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref12">
        <mixed-citation>
          [12]
          <string-name>
            <given-names>A.</given-names>
            <surname>Sapienza</surname>
          </string-name>
          ,
          <string-name>
            <given-names>R.</given-names>
            <surname>Falcone</surname>
          </string-name>
          ,
          <article-title>A bayesian computational model for trust on information sources</article-title>
          .,
          <source>in: WOA</source>
          ,
          <year>2016</year>
          , pp.
          <fpage>50</fpage>
          -
          <lpage>55</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref13">
        <mixed-citation>
          [13]
          <string-name>
            <given-names>Y.</given-names>
            <surname>Zhang</surname>
          </string-name>
          ,
          <string-name>
            <surname>M. M. Zavlanos</surname>
          </string-name>
          ,
          <article-title>Cooperative multi-agent reinforcement learning with partial observations</article-title>
          ,
          <source>IEEE Transactions on Automatic Control</source>
          (
          <year>2023</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref14">
        <mixed-citation>
          [14]
          <string-name>
            <given-names>S. V.</given-names>
            <surname>Chenoweth</surname>
          </string-name>
          ,
          <article-title>On the np-hardness of blocks world</article-title>
          ., in: AAAI,
          <year>1991</year>
          , pp.
          <fpage>623</fpage>
          -
          <lpage>628</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref15">
        <mixed-citation>
          [15]
          <string-name>
            <given-names>J.</given-names>
            <surname>Slaney</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Thiébaux</surname>
          </string-name>
          , Blocks world revisited,
          <source>Artificial Intelligence</source>
          <volume>125</volume>
          (
          <year>2001</year>
          )
          <fpage>119</fpage>
          -
          <lpage>153</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref16">
        <mixed-citation>
          [16]
          <string-name>
            <given-names>T.</given-names>
            <surname>Winograd</surname>
          </string-name>
          ,
          <source>Five lectures on artificial intelligence</source>
          , Stanford University, Standord Artificial Intelligence Laboratory Stanford . . . ,
          <year>1974</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref17">
        <mixed-citation>
          [17]
          <string-name>
            <given-names>C.</given-names>
            <surname>Burnett</surname>
          </string-name>
          ,
          <string-name>
            <given-names>T. J.</given-names>
            <surname>Norman</surname>
          </string-name>
          ,
          <string-name>
            <given-names>K.</given-names>
            <surname>Sycara</surname>
          </string-name>
          ,
          <article-title>Stereotypical trust and bias in dynamic multiagent systems</article-title>
          ,
          <source>ACM Transactions on Intelligent Systems and Technology (TIST) 4</source>
          (
          <issue>2013</issue>
          )
          <fpage>1</fpage>
          -
          <lpage>22</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref18">
        <mixed-citation>
          [18]
          <string-name>
            <given-names>R.</given-names>
            <surname>Falcone</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Sapienza</surname>
          </string-name>
          ,
          <string-name>
            <given-names>C.</given-names>
            <surname>Castelfranchi</surname>
          </string-name>
          ,
          <article-title>Trusting information sources through their categories</article-title>
          ,
          <source>in: Advances in Practical Applications of Agents, Multi-Agent Systems, and Sustainability: The PAAMS Collection: 13th International Conference, PAAMS</source>
          <year>2015</year>
          , Salamanca, Spain, June 3-4,
          <year>2015</year>
          , Proceedings 13, Springer,
          <year>2015</year>
          , pp.
          <fpage>80</fpage>
          -
          <lpage>92</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref19">
        <mixed-citation>
          [19]
          <string-name>
            <given-names>R.</given-names>
            <surname>Falcone</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Sapienza</surname>
          </string-name>
          ,
          <string-name>
            <given-names>F.</given-names>
            <surname>Cantucci</surname>
          </string-name>
          ,
          <string-name>
            <given-names>C.</given-names>
            <surname>Castelfranchi</surname>
          </string-name>
          ,
          <article-title>To be trustworthy and to trust: The new frontier of intelligent systems, Handbook of Human-Machine Systems (</article-title>
          <year>2023</year>
          )
          <fpage>213</fpage>
          -
          <lpage>223</lpage>
          .
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>