Leader election on finite labelled graph with finite memory and anonymous agents

Given a finite graph of bounded arity on with lie several active “agents”, the leader election problem consists in selecting exactly one leader among those agents.

In this talk, we consider the case where it is possible to write a finite information on each cell and where agents have a finite memory and a local behaviour. In this case, we give an algorithm that can achieve leader election in every case where it is possible.