ArticlePublisher preview available

A novel trust evolution algorithm based on a quantum-like model of computational trust

Article

A novel trust evolution algorithm based on a quantum-like model of computational trust

If you want to read the PDF, try requesting it from the authors.

Abstract and Figures

Trust models play an important role in decision support systems and computational environments in general. The common goal of the existing trust models is to provide a representation as close as possible to the social phenomenon of trust in computational domains. In recent years, the field of quantum decision making has been significantly developed. Researchers have shown that the irrationalities, subjective biases, and common paradoxes of human decision making can be better described based on a quantum theoretic model. These decision and cognitive theoretic formulations that use the mathematical toolbox of quantum theory (i.e., quantum probabilities) are referred to by researchers as quantum-like modeling approaches. Based on the general structure of a quantum-like computational trust model, in this paper, we demonstrate that a quantum-like model of trust can define a powerful and flexible trust evolution (i.e., updating) mechanism. After the introduction of the general scheme of the proposed model, the main focus of the paper would be on the proposition of an amplitude amplification-based approach to trust evolution. By performing four different experimental evaluations, it is shown that the proposed trust evolution algorithm inspired by the Grover’s quantum search algorithm is an effective and accurate mechanism for trust updating compared to other commonly used classical approaches.
This content is subject to copyright. Terms and conditions apply.
Vol.:(0123456789)
1 3
Cognition, Technology & Work (2019) 21:201–224
https://doi.org/10.1007/s10111-018-0496-9
ORIGINAL ARTICLE
A novel trust evolution algorithm based onaquantum-like model
ofcomputational trust
MehrdadAshtiani1· MohammadAbdollahiAzgomi1
Received: 13 March 2018 / Accepted: 4 June 2018 / Published online: 12 June 2018
© Springer-Verlag London Ltd., part of Springer Nature 2018
Abstract
Trust models play an important role in decision support systems and computational environments in general. The common
goal of the existing trust models is to provide a representation as close as possible to the social phenomenon of trust in com-
putational domains. In recent years, the field of quantum decision making has been significantly developed. Researchers have
shown that the irrationalities, subjective biases, and common paradoxes of human decision making can be better described
based on a quantum theoretic model. These decision and cognitive theoretic formulations that use the mathematical toolbox
of quantum theory (i.e., quantum probabilities) are referred to by researchers as quantum-like modeling approaches. Based on
the general structure of a quantum-like computational trust model, in this paper, we demonstrate that a quantum-like model
of trust can define a powerful and flexible trust evolution (i.e., updating) mechanism. After the introduction of the general
scheme of the proposed model, the main focus of the paper would be on the proposition of an amplitude amplification-based
approach to trust evolution. By performing four different experimental evaluations, it is shown that the proposed trust evolu-
tion algorithm inspired by the Grover’s quantum search algorithm is an effective and accurate mechanism for trust updating
compared to other commonly used classical approaches.
Keywords Trust model· Quantum-like modeling· Trust evolution· Amplitude amplification· Grover’s quantum search
algorithm· Superposition axiom
1 Introduction
Similar to the social domain where trust is considered as
the glue of the society, computational trust is becoming
more and more important in various domains of virtual and
multi-agent environments (Youssef etal. 2017). Over the
past years, computational trust has found its place in various
fields such as decision support and recommender systems,
vehicular networks (Ahmed etal. 2017), mobile commu-
nications (Guo etal. 2017), service-oriented environments
and social networks. As an example, Web users make judg-
ments routinely about which sources to rely on since there
are often numerous sources relevant to a given query. These
trust judgments are made by humans based on their prior
knowledge about a source’s perceived reputation or past per-
sonal experience about its quality factors.
Today, the concept of trust in computational environ-
ments is of such importance that a vast number of researches
have been performed in recent years. Their common goal is
to introduce a computational model of trust for better rep-
resentation of trust establishment, trust description, trust
propagation, and trust evolution in socio-technical contexts.
In other words, presenting a model that provides the most
accurate representation of the social phenomenon of trust in
computational environments has been the fundamental goal
of the researchers. Recently, a new field of research has been
developed around the concept of quantum decision making
and cognition. Researchers in this field have demonstrated
that the mathematical foundation of quantum theory can
provide an accurate representation of the decision-making
process of human beings and better describe the common
irrationalities and subjective biases that happen in the pro-
cess of human decision making (Trueblood and Busemeyer
2011; Pothos and Busemeyer 2009; Busemeyer etal. 2009;
* Mohammad Abdollahi Azgomi
azgomi@iust.ac.ir
Mehrdad Ashtiani
m_ashtiani@iust.ac.ir
1 Trustworthy Computing Laboratory, School ofComputer
Engineering, Iran University ofScience andTechnology,
Hengam St., Resalat Sq., Tehran16846-13114, Iran
Content courtesy of Springer Nature, terms of use apply. Rights reserved.
... The last point may be a higher order humanitics on trust that computing may find challenging to realise. In search of trust models for its algorithmic implementations, a taxonomy for the building blocks of trust is discussed in [3]. ...
... The concept of simultaneous existence of both paradoxical opposites is conceptually similar to quantum physics that provides a mathematical model to express a particle in dual states at a given instant based on the principle of uncertainties. The concept [3] proposes, follows quantum-like model. Quantum model is essentially a probabilistic model that is different than classical probability concept that operates with binary values. ...
Chapter
Full-text available
Computer Science often emulates humanlike behaviours including intelligence that has taken to storms in every other domain where human deals with. A computing system with a defined role and goal is called an agent with humanlike capability for decision making in dynamic and complex real world it is situated in. Largely this aspect of a computing unit needs ability to learn, act and forecast. Broadly the study in Artificial Intelligence (AI) also deals with such aspects. Researchers of both the schools of computing viz. Intelligent Agents and AI systems, propose several algorithms to emulate human like behaviours. These algorithms here, are labelled as anthropomorphic algorithms. In particular, here our discussion is focussed on trust. The idea of trust as conceptualised, computed and applied in different domains, is discussed. Further, it points out the dimensions that need to be looked at, in order to endow computing systems with trust as a humanitics.
... Finally, the paper fromAshtiani andAzgomi [2] brought an unconventional view on trust. Using a similarity to quantum computing, the paper proposed that every situation can be described by the superposition of of trust and distrust. ...
Article
Full-text available
A brand-new paradigm of robots-quantum robots-is proposed through the fusion of quantum theory with robot technology. A quantum robot is essentially a complex quantum system which generally consists of three fundamental components: multi-quantum computing units (MQCU), quantum controller/actuator, and information acquisition units. Corresponding to the system structure, several learning control algorithms, including quantum searching algorithms and quantum reinforcement learning algorithms, are presented for quantum robots. The theoretical results show that quantum robots using quantum searching algorithms can reduce the complexity of the search problem from O(N 2) in classical robots to O(N √ N). Simulation results demonstrate that quantum robots are also superior to classical robots in efficient learning under novel quantum reinforcement learning algorithms. Considering the advantages of quantum robots, some important potential applications are also analyzed and prospected.
Article
Full-text available
A novel quantum reinforcement learning is proposed through combining quantum theory and reinforcement learning. Inspired by state superposi-tion principle, a framework of state value update algorithm is introduced. The state/action value is represented with quantum state and the probability of action eigenvalue is denoted by probability amplitude, which is updated according to rewards. This approach makes a good tradeoff between exploration and exploitation using probability and can speed up learning. The results of simulated experiment verified its effectiveness and superiority.
Article
Full-text available
This paper addresses the measurement of the social dimension of cognitive trust in collaborative networks. Trust indicators are typically measured and combined in literature in order to calculate partners’ trustworthiness. When expressing the result of a measurement, some quantitative indication of the quality of the result—the uncertainty of measurement—should be given. However, currently this is not taken into account for the measurement of the social dimension of cognitive trust in collaborative networks. In view of this, an innovative metrology-based approach for the measurement of social cognitive trust indicators in collaborative networks is presented. Thus, a measurement result is always accompanied by its uncertainty of measurement, as well as by information traditionally used to properly interpret the results: the sample size, and the standard deviation of the sample.
Article
Full-text available
The growing need for mental workload (MWL) optimization on the shop floor yields an impressive increase in theoretical and applied references to the concept of mental workload (Young et al. 2014). However, do we really understand and agree upon what mental workload exactly is? Does it include emotional load? Can we rely upon an explanatory framework? The present account first runs a critical concept analysis on mental workload, based on the Walker and Avant (2011) method. Results show that existing definitions and theoretical accounts arbitrarily include and exclude defining variables and describe these variables on various levels of abstraction, misuse pivotal terms such as mediation and moderation, and do not theoretically explicitate the role of yet repeatedly operationalized emotional load variables such as frustration. We therefore clarify the concept by disentangling MWL into its antecedents, defining attributes and consequences. Next, we derive a clear-cut conceptual definition and present a generic explanatory framework - the latter extended with insights from Cognitive Load Theory (Sweller 1988; 1994). We conclude with a set of suggestions for future research and practice. Next to contributing to the theoretical clarification of this hallmark concept, the concept analysis and derived explanatory framework, as proposed, can foster solid research practices and support practitioners in contextualizing MWL-assessment and in effectively optimizing MWL.
Article
Full-text available
Dedicated Short Range Communication (DSRC) is proposed for Vehicle to Vehicle (V2V) communications to learn about significant events in the network from neighboring vehicles. However, these neighbors may be malicious and report incorrect events in order to take advantage of the system. The malicious nodes may also provide incorrect recommendations about their peers in order to exert a stronger influence on the receiver’s decision. Incorrect information and malicious nodes render the system unreliable for safety and emergency applications. In order to correctly identify the events as well as malicious nodes, a novel trust framework is proposed in this paper which studies all aspects of the trust in Connected Vehicle (CV) to CV communications. The nodes iteratively learn about the environment from received messages and then update the trust values of their neighbors. Nodes are classified on the basis of their trust values and reported events are also classified as true and false. Nodes advertise their recommendation about trusted and malicious neighbors. The proposed framework allows nodes to identify and filter recommendations from malicious nodes, and to discern true events. The performance of the proposed framework is evaluated experimentally using false and true positive rates, event detection probability and trust computation error. The proposed framework identifies malicious nodes and true events with high probability of more than 0.92 while keeping the trust computation error below 0.03.
Article
Full-text available
Decision Support Systems (DSSs) in the domain of Industrial Engineering and Management can be very powerful tools, but more knowledge about the way users utilize these systems is required. In the current research, we evaluated the effect of previous experience with a task on users' willingness to accept a suggested decision aid and their performance in a supply chain management system. Participants were randomly assigned to one of three between-participants groups: the No Aid Group, which did not receive any decision aid during the interaction; the Aid Group, which was offered an algorithm, at the beginning of the first session, to help members improve their decisions; and the Mid-term Aid Group, which received, at the beginning of the second session, the same algorithm that was offered to the Aid Group. Participants were tested separately. The results demonstrated that in the second session, the performance of the Aid Group was significantly better in comparison with the No Aid Group. The Mid-term Aid Group's performance did not show any gain, although both the Aid and Mid-term Aid Groups made similar use of the aid in this session. We concluded that in a DSS, having previous experience with the task before introducing the decision aid compared to having previous experience with the task and with the decision aid is not recommended.
Article
Device-to-device (D2D) communication is a promising concept for improving user experiences and resource utilization in cellular networks. This type of communication enables two or more mobile devices in proximity to establish local links, coordinated by a base station, to perform direct data exchange. The benefits of D2D communication include ubiquitous computing and communication, enhanced energy efficiency, creation of new services and so on. However, how to establish the trust relationship between two devices is a base problem that should be solved. In this paper, we propose a situational awareness trust evolution model for mobile devices involved in D2D communication. Compared with available trust evaluation schemes, we consider the comprehensive situation that a mobile device may encounter. We use what a device wants and what it can obtain to depict the situation of the device when given a concrete interaction (transaction). We give the method to get quantitative description of such information, and then the coefficients of the new proposed trust evolution function can be determined. To demonstrate the efficiency of our method, we conduct some experiments to show the properties of our method, and the results show that our trust evolution scheme is consistent with the intuition about trust in real life. Furthermore, we compare our scheme with two state-of-the-art dynamic trust evaluation schemes in different usage scenarios of mobile devices. The results show that our scheme can perform well in all scenarios, whereas the other two schemes can perform well only in some of the tested scenarios.