DeepAI AI Chat
Log In Sign Up

Rational Uniform Consensus with General Omission Failures

by   Yansong Zhang, et al.

Generally, system failures, such as crash failures, Byzantine failures and so on, are considered as common reasons for the inconsistencies of distributed consensus and have been extensively studied. In fact, strategic manipulations by rational agents do not be ignored for reaching consensus in distributed system. In this paper, we extend the game-theoretic analysis of consensus and design an algorithm of rational uniform consensus with general omission failures under the assumption that processes are controlled by rational agents and prefer consensus. Different from crashing one, agent with omission failures may crash, or omit to send or receive messages when it should, which leads to difficulty of detecting faulty agents. By combining the possible failures of agents at the both ends of a link, we convert omission failure model into link state model to make faulty detection possible. Through analyzing message passing mechanism in the distributed system with n agents, among which t agents may commit omission failures, we provide the upper bound on message passing time for reaching consensus on a state among nonfaulty agents, and message chain mechanism for validating messages. And then we prove our rational uniform consensus is a Nash equilibrium when n>2t+1, and failure patterns and initial preferences are blind (an assumption of randomness). Thus agents could have no motivation to deviate the consensus. Our research strengthens the reliability of consensus with omission failures from the perspective of game theory.


page 1

page 2

page 3

page 4


Rational Consensus

We provide a game-theoretic analysis of consensus, assuming that process...

Consensus analysis of random sub-graphs for distributed filtering with link failures

In this paper we carry out a stability analysis of a distributed consens...

Who Needs Consensus? A Distributed Monetary System Between Rational Agents via Hearsay

We propose a novel distributed monetary system called Hearsay that toler...

Verification of Eventual Consensus in Synod Using a Failure-Aware Actor Model

Successfully attaining consensus in the absence of a centralized coordin...

Are Multiagent Systems Resilient to Communication Failures?

A challenge in multiagent control systems is to ensure that they are app...

Fast Multidimensional Asymptotic and Approximate Consensus

We study the problems of asymptotic and approximate consensus in which a...

Topological Characterization of Consensus Solvability in Directed Dynamic Networks

Consensus is one of the most fundamental problems in distributed computi...