Impossibility of n-1-strong-equllibrium for Distributed Consensus with Rational Agents

by   Amit Jacob Fanani, et al.

An algorithm for n-1-strong-equillibrium for distributed consensus in a ring with rational agents was proposed by Afek et al. (2014). A proof of impossibility of n-1-strong-equillibrium for distributed consensus in every topology with rational agents, when n is even, is presented. Furthermore, we show that the algorithm proposed by Afek et al. is the only algorithm which can solve the problem when n is odd. Finally, we prove that the proposed algorithm provides a n-2-strong-equillibrium in a synchronous ring when n is even.


page 1

page 2

page 3

page 4


Skew Cyclic Codes Over A Finite Ring : A Note on a result of Mohammadi et al

In this small note we correct an error made by Mohammadi et al. in their...

Formally verified asymptotic consensus in robust networks

Distributed architectures are used to improve performance and reliabilit...

Second-Order Agents on Ring Digraphs

The paper addresses the problem of consensus seeking among second-order ...

Gracefully Degrading Gathering in Dynamic Rings

Gracefully degrading algorithms [Biely et al., TCS 2018] are designed to...

Exploring a Dynamic Ring without Landmark

Consider a group of autonomous mobile computational entities, called age...

Careful Autonomous Agents in Environments With Multiple Common Resources

Careful rational synthesis was defined in (Condurache et al. 2021) as a ...

Measure preservation and integrals for Lotka–Volterra T-systems and their Kahan discretisation

We show that any Lotka–Volterra T-system associated with an n-vertex tre...

Please sign up or login with your details

Forgot password? Click here to reset