Abstract
In 1974 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.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Abraham, I., Dolev, D., Halpern, J.Y.: Distributed protocols for leader election: a game-theoretic perspective. In: Afek, Y. (ed.) DISC 2013. LNCS, vol. 8205, pp. 61–75. Springer, Heidelberg (2013). https://doi.org/10.1007/978-3-642-41527-2_5
Apt, K.R., de Keijzer, B., Rahn, M., Schäfer, G., Simon, S.: Coordination games on graphs. Int. J. Game Theory 46(3), 851–877 (2017)
Apt, K.R., Simon, S.: A classification of weakly acyclic games. Theory Decis. 78(4), 501–524 (2015)
Apt, K.R., Simon, S., Wojtczak, D.: Coordination games on directed graphs. In: Proceedings of the 15th Conference on Theoretical Aspects of Rationality and Knowledge (TARK 2015). EPTCS, vol. 215, pp. 67–80 (2016)
Arora, A., Gouda, M.: Closure and convergence: a foundation of fault-tolerant computing. IEEE Trans. Softw. Eng. 19(11), 1015–1027 (1993)
Dasgupta, A., Ghosh, S., Tixeuil, S.: Selfish stabilization. In: Datta, A.K., Gradinariu, M. (eds.) SSS 2006. LNCS, vol. 4280, pp. 231–243. Springer, Heidelberg (2006). https://doi.org/10.1007/978-3-540-49823-0_16
Dijkstra, E.W.: Self-stabilization in spite of distributed control, October 1973. http://www.cs.utexas.edu/users/EWD/ewd03xx/EWD391.PDF
Dijkstra, E.W.: Self-stabilization with four-state machines, October 1973. http://www.cs.utexas.edu/users/EWD/ewd03xx/EWD392.PDF
Dijkstra, E.W.: Self-stabilization with three-state machines, November 1973. http://www.cs.utexas.edu/users/EWD/ewd03xx/EWD396.PDF
Dijkstra, E.W.: Self-stabilizing systems in spite of distributed control. Commun. ACM 17(11), 643–644 (1974)
Dijkstra, E.W.: Self-stabilization in spite of distributed control. In: Selected Writings on Computing: A Personal Perspective, pp. 41–46. Springer, New York (1982). https://doi.org/10.1007/978-1-4612-5695-3_7
Dijkstra, E.W.: A belated proof of self-stabilization. Distrib. Comput. 1(1), 5–6 (1986). https://www.cs.utexas.edu/users/EWD/ewd09xx/EWD922.PDF
Dolev, S.: Self-stabilization. MIT Press, Cambridge (2000)
Finkbeiner, B., Olderog, E.: Petri games: synthesis of distributed systems with causal memory. Inf. Comput. 253, 181–203 (2017)
Fokkink, W., Hoepman, J., Pang, J.: A note on \(k\)-state self-stabilization in a ring with \(k=n\). Nord. J. Comput. 12(1), 18–26 (2005)
Ghosh, S.: An alternative solution to a problem on self-stabilization. ACM Trans. Program. Lang. Syst. 15(4), 735–742 (1993)
Gouda, M.G.: The theory of weak stabilization. In: Datta, A.K., Herman, T. (eds.) WSS 2001. LNCS, vol. 2194, pp. 114–123. Springer, Heidelberg (2001). https://doi.org/10.1007/3-540-45438-1_8
Halpern, J.Y.: Computer science and game theory: a brief survey. CoRR 2007 (2007). http://arxiv.org/abs/cs/0703148
Halpern, J.Y., Teague, V.: Rational secret sharing and multiparty computation: extended abstract. In: Proceedings of the 36th Annual ACM Symposium on Theory of Computing, pp. 623–632. ACM (2004)
Jaggard, A.D., Lutz, N., Schapira, M., Wright, R.N.: Self-stabilizing uncoupled dynamics. In: Lavi, R. (ed.) SAGT 2014. LNCS, vol. 8768, pp. 74–85. Springer, Heidelberg (2014). https://doi.org/10.1007/978-3-662-44803-8_7
Lamport, L.: Solved problems, unsolved problems and non-problems in concurrency (invited address). In: Proceedings of the Third Annual ACM Symposium on Principles of Distributed Computing, pp. 1–11 (1984)
Manku, G.S.: A simple proof for \(\cal{O}(n^2)\) convergence of Dijkstra’s self-stabilization protocol (2005, Unpublished)
Milchtaich, I.: Congestion games with player-specific payoff functions. Games Econ. Behav. 13, 111–124 (1996)
Monderer, D., Shapley, L.S.: Potential games. Games Econ. Behav. 14, 124–143 (1996)
Rahn, M., Schäfer, G.: Efficient equilibria in polymatrix coordination games. In: Italiano, G.F., Pighizzini, G., Sannella, D.T. (eds.) MFCS 2015. LNCS, vol. 9235, pp. 529–541. Springer, Heidelberg (2015). https://doi.org/10.1007/978-3-662-48054-0_44
Schneider, M.: Self-stabilization. ACM Comput. Surv. 25(1), 45–67 (1993)
Shukla, S.K., Rosenkrantz, D.J., Ravi, S.S., et al.: Observations on self-stabilizing graph algorithms for anonymous networks. In: Proceedings of the Second Workshop on Self-stabilizing Systems, vol. 7, p. 15 (1995)
Simon, S., Wojtczak, D.: Synchronisation games on hypergraphs. In: Proceedings of the International Joint Conference on Artificial Intelligence (IJCAI 2017), pp. 402–408. IJCAI/AAAI Press (2017)
Yen, L.-H., Huang, J.-Y., Turau, V.: Designing self-stabilizing systems using game theory. ACM Trans. Auton. Adapt. Syst. 11(3), 18:1–18:27 (2016)
Young, H.P.: The evolution of conventions. Econometrica 61(1), 57–84 (1993)
Acknowledgment
We acknowledge useful comments of Mohammad Izadi, Zoi Terzopoulou and Peter van Emde Boas. First author was partially supported by the NCN grant nr 2014/13/B/ST6/01807.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2018 Springer International Publishing AG, part of Springer Nature
About this chapter
Cite this chapter
Apt, K.R., Shoja, E. (2018). Self-stabilization Through the Lens of Game Theory. In: de Boer, F., Bonsangue, M., Rutten, J. (eds) It's All About Coordination. Lecture Notes in Computer Science(), vol 10865. Springer, Cham. https://doi.org/10.1007/978-3-319-90089-6_2
Download citation
DOI: https://doi.org/10.1007/978-3-319-90089-6_2
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-90088-9
Online ISBN: 978-3-319-90089-6
eBook Packages: Computer ScienceComputer Science (R0)