Computational Models Based on Forgiveness Mechanism for Untrustworthy Agents

Binmad, Ruchdee; Li, Mingchu

doi:10.1007/978-3-319-27000-5_3

Cited by 3 publications

(4 citation statements)

References 22 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Let us look more closely at the structure of A in light of (14). First, we recognize that the data is always spanned by B 3 = {1 n , z 1 , z 3 }, and the span of B 3 is the same as the subspace spanned by K 3 .…”

Section: Approximating Linear Signals With Kmdmentioning

confidence: 99%

“…Démare et al [13] studied a highly-detailed model of goods transport between a port and inland regions by different levels of agents on a dynamic graph. Binmad and Li [14] use an ABM approach to demonstrate the benefits of a forgiveness method to improve reputation systems in online commerce and social communities. Stavash et al [15] present an ABM in a war-gaming context to model the logistics of military operations.…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Koopman Mode Analysis of agent-based models of logistics processes

Hogg¹,

Fonoberova²,

Mezić

et al. 2019

PLoS ONE

View full text Add to dashboard Cite

Modern logistics processes and systems can feature extremely complicated dynamics. Agent Based Modeling is emerging as a powerful modeling tool for design, analysis and control of such logistics systems. However, the complexity of the model itself can be overwhelming and mathematical meta-modeling tools are needed that aggregate information and enable fast and accurate decision making and control system design. Here we present Koopman Mode Analysis (KMA) as such a tool. KMA uncovers exponentially growing, decaying or oscillating collective patterns in dynamical data. We apply the methodology to two problems, both of which exhibit a bifurcation in dynamical behavior, but feature very different dynamics: Medical Treatment Facility (MTF) logistics and ship fueling (SF) logistics. The MTF problem features a transition between efficient operation at low casualty rates and inefficient operation beyond a critical casualty rate, while the SF problem features a transition between short mission life at low initial fuel levels and sustained mission beyond a critical initial fuel level. Both bifurcations are detected by analyzing the spectrum of the associated Koopman operator. Mathematical analysis is provided justifying the use of the Dynamic Mode Decomposition algorithm in punctuated linear decay dynamics that is featured in the SF problem.

show abstract

Section: Approximating Linear Signals With Kmdmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

Koopman Mode Analysis of agent-based models of logistics processes

Hogg¹,

Fonoberova²,

Mezić

et al. 2019

PLoS ONE

View full text Add to dashboard Cite

show abstract

“…In this study, forgiveness and regret are considered as implementable properties for formalizing the incorporation of trust defining a computational model. Forgiveness, in particular, has been extensively studied as a positive method of coping with trust violations in [12,[20][21][22][23][24][25][26][27], while regret, always together with responsibility, is used to form the definition of an apology [13,20,21,[28][29][30][31]. For instance, an apology was defined by [20] as "a decisive public expression regarding both responsibility and regret for a violation of trust."…”

Section: Related Workmentioning

confidence: 99%

“…In other words, a transgressor who apologizes immediately after the offence takes place is more likely to be forgiven than that who apologizes later. To compute this metric, we apply the same mathematical formula on an apology factor in our previous work [22]. That is, we first define recency factor [47]:…”

Section: Signals Of Remorse Frommentioning

confidence: 99%

Psychology-Inspired Trust Restoration Framework in Distributed Multiagent Systems

Binmad

2018

Scientific Programming

Self Cite

View full text Add to dashboard Cite

Trust violation during cooperation of autonomous agents in multiagent systems is usually unavoidable and can arise due to a wide number of reasons. From a psychological point of view, the violation of an agent’s trust is a result of one agent (which is a transgressor) expressing a very low weight on the welfare of another agent (which is a victim) by inflicting a high cost for a very small benefit. In order for the victim to make an effective decision about whether to cooperate or punish for the next interaction, a psychological variable called welfare tradeoff ratio (WTR) can be used to upregulate the transgressor’s disposition so that the number of exploitive behaviors that are likely to happen in the future will be decreased. In this paper, we propose computational models of metrics based on the welfare tradeoff ratio along with the way by which multiple metrics can be integrated to provide the final result. Additionally, a number of experiments based on social network analysis are conducted to evaluate the performance of the proposed framework and the results show that by implementing WTR the simulated network is able to deal with different levels of trust violation effectively.

show abstract

Improving the Efficiency of an Online Marketplace by Incorporating Forgiveness Mechanism

Binmad

2017

ACM Trans. Internet Technol.

View full text Add to dashboard Cite

Reputation plays a key role in online marketplace communities improving trust among community members. Reputation works as a decision-making tool for understanding the behavior of the business partners. Success of any online business depends on the trust the business agents share with each other. However, untrustworthy agents have anno place in online marketplaces and are forced to leave the market even if they will potentially cooperate. In this study, we propose an exploration strategy based on a forgiveness mechanism for untrustworthy agents to recover their reputation. Furthermore, a number of experiments based on the NetLogo simulation are performed to validate the applicability of the proposed mechanism. The results show that the online marketplaces incorporating a forgiveness mechanism can be used with the existing reputation systems and improve the efficiency of online marketplaces.

show abstract

Computational Models Based on Forgiveness Mechanism for Untrustworthy Agents

Cited by 3 publications

References 22 publications

Koopman Mode Analysis of agent-based models of logistics processes

Koopman Mode Analysis of agent-based models of logistics processes

Psychology-Inspired Trust Restoration Framework in Distributed Multiagent Systems

Improving the Efficiency of an Online Marketplace by Incorporating Forgiveness Mechanism

Contact Info

Product

Resources

About