  In 1974 E.W. Dijkstra introduced the seminal concept of self-stabilization
that turned out to be one of the main approaches to fault-tolerant computing.
We show here how his three solutions can be formalized and reasoned about using
the concepts of game theory. We also determine the precise number of steps
needed to reach self-stabilization in his first solution.
