BAR--Where Distributed Computing Meets Game Theory

Authors:
Lorenzo Alvisi
Affiliations:
Laboratory for Advanced Systems Research (LASR), Department of Computer Sciences, The University of Texas at Austin,
Venue:
LADC '07 Proceedings of the 3rd Latin-American symposium on Dependable Computing
Year:
2007

Citing 0
Cited 3

Strategies for repeated games with subsystem takeovers: implementable by deterministic and self-stabilizing automata (extended abstract)

Autonomics '08 Proceedings of the 2nd International Conference on Autonomic Computing and Communication Systems
Strategies for repeated games with subsystem takeovers implementable by deterministic and self-stabilising automata

International Journal of Autonomous and Adaptive Communications Systems
Survey: Robust and scalable middleware for selfish-computer systems

Computer Science Review

Quantified Score

Hi-index	0.00

Visualization

Abstract

This tutorial describes a general approach for building cooperative services that span multiple administrative domains (MADs). MAD systems are attractive because their diffused control structure may yield services that are potentially less costly and more democratic than their more centralized counterparts. Unfortunately, they are also particularly problematic from a dependability standpoint as they challenge the traditional distinction between correct and faulty nodes.