LAUSR.org creates dashboard-style pages of related content for over 1.5 million academic articles. Sign Up to like articles & get recommendations!

A Reputation Mechanism for Dynamical Interactions in Multiagent Systems Under Quality of Service Requirements

Photo by impatrickt from unsplash

A novel and original distributed reputation mechanism is here proposed for a class of networked systems characterized by two distinct groups of nodes: user agents and service providers (servers/resources). The… Click to show full abstract

A novel and original distributed reputation mechanism is here proposed for a class of networked systems characterized by two distinct groups of nodes: user agents and service providers (servers/resources). The proposed methodology is in charge of intercepting those resources that have the highest quality of service (QoS) on the basis of their reputation (trust) shared among agents. Such a reputation may change over the time mainly influenced by changing performance indexes and other events. As a result, it is shown that the trust evolution can be modeled as the output of a positive switching linear system. This model straightforwardly allows one to prove trust boundedness and other relevant steady-state properties. To illustrate the benefits of this approach, a sensors selection problem for state estimation is outlined and addressed within the proposed framework. In particular, it is formally proved that the resulting estimation scheme ensures, over the time, the selection of the sensor with the current best perceived QoS in a finite time.

Keywords: reputation; reputation mechanism; quality service; service

Journal Title: IEEE Transactions on Automatic Control
Year Published: 2021

Link to full text (if available)


Share on Social Media:                               Sign Up to like & get
recommendations!

Related content

More Information              News              Social Media              Video              Recommended



                Click one of the above tabs to view related content.