Yen, Li-HsingLi-HsingYenHuang, Jean-YaoJean-YaoHuangTurau, VolkerVolkerTurau2020-03-092020-03-092016-09-01ACM Transactions on Autonomous and Adaptive Systems 3 (11): 18 1-27 (2016-09-01)http://hdl.handle.net/11420/5254Self-stabilizing systems tolerate transient faults by always returning to a legitimate system state within a finite time. This goal is challenged by several system features such as arbitrary system states after faults, various process execution models, and constrained process communication means. This work designs selfstabilizing distributed algorithms from the perspective of game theory, achieving an intended system goal through private goals of processes.We propose a generic game design for identifying a maximal independent set (MIS) or a maximal weighted independent set (MWIS) among all processes in a distributed system. From the generic game several specific games can be defined which differ in whether and how neighboring players influence each other. Turning the game designs into self-stabilizing algorithms, we obtain the first algorithms for the MWIS problem and also the first self-stabilizingMIS algorithm that considers node degree (including an analysis of its performance ratio). We also show how to handle simultaneous moves of processes in some process execution models. Simulation results indicate that, for various representative network topologies, the new algorithm outperforms existing methods in terms of MIS size and convergence rate. For the MWIS problem, the new algorithms performed only slightly worse than centralized greedy counterparts.en1556-466520163127ACMDistributed algorithmsGame theoryIndependent setSelf-stabilizationInformatikHandel, Kommunikation, VerkehrJournal Article10.1145/2957760Other