Leader election is one of the fundamental problems in distributed systems. A leader is a correct process that can be used to coordinate the work of a set of processes. An algorithm has to implement two properties to solve the leader election problem: (1) safety, (2) liveness. In this work we show that the stabilization property is not necessary for the leader election problem. We do this by examine the ability to solve leader election in the FAR model. The FAR model does neither assume the existence of an upper bound on the communication or computation delays nor that the system stabilizes. Instead it assumes that the system is in a certain balance: computation is not infinitely fast, the communication subsystem has rudimentary congestion control and the average response time between two correct processes is finite. Our contribution is twofold: (1) we show that leader election is not solvable in the pure FAR model and (2) that it becomes solvable with local clocks with a bounded drift rate