Let us consider a privileged value α, initially known by all processes. Design an algorithm that allow a process pi to decide in one communication step in the executions where it receives the value α...

Let us consider a privileged value α, initially known by all processes. Design an algorithm that

allow a process pi to decide in one communication step in the executions where it receives the

value α from (n − t) processes during the first communication step.

Let us observe that there are executions in which pi may receive α from (n−t) processes, while

other processes do not. They may receive α from at most (n − 2t) processes and other values

from t processes. In this case, only pi is required to decide in one communication step.

Solution in [84].