Extending Eigentrust with the Max-Plus Algebra

06/13/2019
by   Juan Afanador, et al.
0

Eigentrust is a simple and widely used algorithm, which quantifies trust based on the repeated application of an update matrix to a vector of initial trust values. In some cases, however, this procedure is rendered uninformative. Here, we characterise such situations and trace their origin to the algebraic conditions guaranteeing the convergence of the Power Method. We overcome the identified limitations by extending Eigentrust's core ideas into the Max-Plus Algebra. The empirical evaluation of our max-plus approach demonstrates improvements over Eigentrust.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
09/29/2016

Max-plus statistical leverage scores

The statistical leverage scores of a complex matrix A∈C^n× d record the ...
research
12/09/2019

Tropical Geometry and Piecewise-Linear Approximation of Curves and Surfaces on Weighted Lattices

Tropical Geometry and Mathematical Morphology share the same max-plus an...
research
04/21/2018

A Fluid-Flow Interpretation of SCED Scheduling

We show that a fluid-flow interpretation of Service Curve Earliest Deadl...
research
07/01/2020

Computation of the Transient in Max-Plus Linear Systems via SMT-Solving

This paper proposes a new approach, grounded in Satisfiability Modulo Th...
research
04/20/2019

Analysis and Design of Robust Max Consensus for Wireless Sensor Networks

A novel distributed algorithm for estimating the maximum of the node ini...
research
04/01/2023

Max-Plus Synchronization in Decentralized Trading Systems

We introduce a decentralized mechanism for pricing and exchanging altern...
research
07/09/2020

Symbolic Reachability Analysis of High Dimensional Max-Plus Linear Systems

This work discusses the reachability analysis (RA) of Max-Plus Linear (M...

Please sign up or login with your details

Forgot password? Click here to reset