Self-stabilization
Self-stabilizing systems in spite of distributed control
Communications of the ACM
BAR fault tolerance for cooperative services
Proceedings of the twentieth ACM symposium on Operating systems principles
Proceedings of the thirty-eighth annual ACM symposium on Theory of computing
Symposium on Theory of Computing Conference 2006
The complexity of computing a Nash equilibrium
Proceedings of the thirty-eighth annual ACM symposium on Theory of computing
The effect of collusion in congestion games
Proceedings of the thirty-eighth annual ACM symposium on Theory of computing
Proceedings of the twenty-fifth annual ACM symposium on Principles of distributed computing
Proceedings of the twenty-sixth annual ACM symposium on Principles of distributed computing
ACM Symposium on Principles of Distributed Computing 2007
Game authority for robust andscalable distributed selfish-computer systems
Proceedings of the twenty-sixth annual ACM symposium on Principles of distributed computing
Proceedings of the twenty-sixth annual ACM symposium on Principles of distributed computing
SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
Algorithmic Game Theory
OSDI '06 Proceedings of the 7th symposium on Operating systems design and implementation
BAR--Where Distributed Computing Meets Game Theory
LADC '07 Proceedings of the 3rd Latin-American symposium on Dependable Computing
SSS'06 Proceedings of the 8th international conference on Stabilization, safety, and security of distributed systems
Stabilization in dynamic systems with varying equilibrium
SSS'07 Proceedings of the 9h international conference on Stabilization, safety, and security of distributed systems
Lower bounds on implementing robust and resilient mediators
TCC'08 Proceedings of the 5th conference on Theory of cryptography
International Journal of Autonomous and Adaptive Communications Systems
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
Survey: Robust and scalable middleware for selfish-computer systems
Computer Science Review
| Hi-index | 0.00 |
Systems of selfish-computers, such as the Internet, are subject to transient faults due to hardware/software temporal malfunctions; just as the society is subjected to human mistakes due to a moment of weakness. Game theory uses punishment for deterring improper behavior. Due to faults, selfish-computers may punish well-behaved ones. This is one of the key motivations for forgiveness that follows any effective and credible punishment. Therefore, unplanned punishments must be proven to have ceased in order to avoid infinite cycles of unsynchronized behavior of "tit for tat". We investigate another aspect of selfish-computer systems. We consider the possibility of subsystem takeover, say, by the use of hostile malware. The takeover may lead to joint deviations coordinated by an arbitrary selfish-computer that controls an unknown group of subordinate computers. We present strategies that deter the coordinator (and its subordinates) from deviating in infinitely repeated games. We construct deterministic and finite automata that implement these strategies with optimal complexity. Moreover, we prove that all unplanned punishments eventually cease by showing that the automata can recover from transient faults.