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 pro...

abstract the investigation of habermas’s political ideas of philosophical perspective and measuring his philosophical principles ratio, which is the deliberative democracy, is a purpose of this study that will be followed.  on the one hand, the importance of this issue is this that represents the new readings of democratic standards and on the other hand, consolidates one type of the democracy ...

The consensus is a very important problem in distributed computing, where among the n players, the honest players try to come to an agreement even in the presence of t malicious players. In game theoretic environment, the group choice problem is similar to the rational consensus problem, where every player pi prefers come to consensus on his value vi or to a value which is as close to it as pos...

A new consensus model for the consensus reaching process, in a linguistic framework, is presented in heterogeneous group decision making problems, called rational consensus model. It is guided by some linguistic consensus and linguistic consistency meaures. All the measures are calculated from a set of linguistic preference relations used to provide experts' opinions. This consensus model allow...

this article examines capacity of rational dialogues to achieve ethical universalism. in positive attitude, rational ability considered as most important reason for possibility of achievement to common social-political norms and rights. rational dialogue, by creating a suitable space for dialogue beyond the private interests and involvement of state power; searches consensus on foundation of so...

In this paper, we study distributed consensus in synchronous systems subject to both unexpected crash failures and strategic manipulations by rational agents in the system. We adapt the concept of collusion-resistant Nash equilibrium to model protocols that are resilient to both crash failures and strategic manipulations of a group of colluding agents. For a system with n distributed agents, we...

We investigate how like-minded agents can reach consensus on their decisions even if they receive different information. The model used here was introduced by Aumann, and subsequently refined by Geanakoplos and Polemarchakis, Bacharach, Cave, Parikh and Krasucki ([Aum76,GP82,Cav83,Bac85,PK]). The main result is that when any number of like-minded agents communicate according to some fair protoc...