This paper investigates the leader-election problem in the perfect-information model of distributed computing. It is shown that for every $\epsilon < \half$, there exist leader-election protocols for $n$ processors that tolerate $\eps n$ faults.
['Ravi B. Boppana', 'Babu O. Narayanan']
Perfect-Information Leader Election with Optimal Resilience