Closure and Convergence: A Foundation of Fault-Tolerant Computing
IEEE Transactions on Software Engineering - Special issue on software reliability
Self-stabilization
Self-stabilizing systems in spite of distributed control
Communications of the ACM
The Triumph and Tribulation of System Stabilization
WDAG '95 Proceedings of the 9th International Workshop on Distributed Algorithms
Self-Stabilizing Protocols for Maximal Matching and Maximal Independent Sets for Ad Hoc Networks
IPDPS '03 Proceedings of the 17th International Symposium on Parallel and Distributed Processing
Proceedings of the twenty-fifth annual ACM symposium on Principles of distributed computing
Self-optimizing Peer-to-Peer Networks with Selfish Processes
SASO '07 Proceedings of the First International Conference on Self-Adaptive and Self-Organizing Systems
Beyond Nash Equilibrium: Solution Concepts for the 21st Century
CONCUR '08 Proceedings of the 19th international conference on Concurrency Theory
An exercise in selfish stabilization
ACM Transactions on Autonomous and Adaptive Systems (TAAS)
Self-stabilizing coloration in anonymous planar networks
Information Processing Letters
Lower bounds on implementing robust and resilient mediators
TCC'08 Proceedings of the 5th conference on Theory of cryptography
Price stabilization in networks: what is an appropriate model?
SSS'11 Proceedings of the 13th international conference on Stabilization, safety, and security of distributed systems
A Lightweight Method for Automated Design of Convergence in Network Protocols
ACM Transactions on Autonomous and Adaptive Systems (TAAS) - Special Section: Extended Version of SASO 2011 Best Paper
| Hi-index | 0.00 |
The objective of this paper is three-fold. First, we specify what it means for a fixed point of a stabilizing distributed system to be a Nash equilibrium. Second, we present methods that can be used to verify whether or not a given fixed point of a given stabilizing distributed system is a Nash equilibrium. Third, we argue that in a stabilizing distributed system, whose fixed points are all Nash equilibria, no process has an incentive to perturb its local state, after the system reaches one fixed point, in order to force the system to reach another fixed point where the perturbing process achieves a better gain. If the fixed points of a stabilizing distributed system are all Nash equilibria, then we refer to the system as perturbation-proof. Otherwise, we refer to the system as perturbation-prone. We identify four natural classes of perturbation-(proof/prone) systems. We present system examples for three of these classes of systems, and show that the fourth class is empty.