Survey: Robust and scalable middleware for selfish-computer systems

Authors:
Shlomi Dolev;Elad M. Schiller;Paul G. Spirakis;Philippas Tsigas
Affiliations:
Department of Computer Science, Ben-Gurion University of the Negev, 84105, Israel;Department of Computing Science, Chalmers University of Technology and Göteborg University, Rännvägen 6B Göteborg, S-412 96, Sweden;Research Academic Computer Technology Institute, N. Kazantzakis str., University Campus, 265 00 Rio, Patras, Greece;Department of Computing Science, Chalmers University of Technology and Göteborg University, Rännvägen 6B Göteborg, S-412 96, Sweden
Venue:
Computer Science Review
Year:
2011

Citing 28
Cited 1

Fully Polynomial Byzantine Agreement for Processors in Rounds

SIAM Journal on Computing
Self-stabilization

Self-stabilization
The Byzantine Generals Problem

ACM Transactions on Programming Languages and Systems (TOPLAS)
Self-stabilizing systems in spite of distributed control

Communications of the ACM
Distributed algorithmic mechanism design: recent results and future directions

DIALM '02 Proceedings of the 6th international workshop on Discrete algorithms and methods for mobile computing and communications
Coin flipping by telephone a protocol for solving impossible problems

ACM SIGACT News - A special issue on cryptography
Self-stabilizing clock synchronization in the presence of Byzantine faults

Journal of the ACM (JACM)
The Price of Stability for Network Design with Fair Cost Allocation

FOCS '04 Proceedings of the 45th Annual IEEE Symposium on Foundations of Computer Science
BAR fault tolerance for cooperative services

Proceedings of the twentieth ACM symposium on Operating systems principles
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

ACM Symposium on Principles of Distributed Computing 2006
When selfish meets evil: byzantine players in a virus inoculation game

Proceedings of the twenty-fifth annual ACM symposium on Principles of distributed computing
Distributed computing meets game theory: robust mechanisms for rational secret sharing and multiparty computation

Proceedings of the twenty-fifth annual ACM symposium on Principles of distributed computing
Game authority for robust andscalable distributed selfish-computer systems

Proceedings of the twenty-sixth annual ACM symposium on Principles of distributed computing
Theory of BAR games

Proceedings of the twenty-sixth annual ACM symposium on Principles of distributed computing
Strong price of anarchy

SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
Algorithmic Game Theory

Algorithmic Game Theory
BAR gossip

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
An exercise in selfish stabilization

ACM Transactions on Autonomous and Adaptive Systems (TAAS)
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
Self-stabilization

SSS'06 Proceedings of the 8th international conference on Stabilization, safety, and security of distributed systems
Worst-case equilibria

STACS'99 Proceedings of the 16th annual conference on Theoretical aspects of computer science
Stabilization in dynamic systems with varying equilibrium

SSS'07 Proceedings of the 9h international conference on Stabilization, safety, and security of distributed systems
Game authority for robust and scalable distributed selfish-computer systems

Theoretical Computer Science
Lower bounds on implementing robust and resilient mediators

TCC'08 Proceedings of the 5th conference on Theory of cryptography
Strategies for repeated games with subsystem takeovers implementable by deterministic and self-stabilising automata

International Journal of Autonomous and Adaptive Communications Systems

Rationality authority for provable rational behavior

Proceedings of the 30th annual ACM SIGACT-SIGOPS symposium on Principles of distributed computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

Distributed algorithm designers often assume that system processes execute the same predefined software. Alternatively, when they do not assume that, designers turn to non-cooperative games and seek an outcome that corresponds to a rough consensus when no coordination is allowed. We argue that both assumptions are inapplicable in many real distributed systems, e.g., the Internet, and propose designing self-stabilizing and Byzantine fault-tolerant distributed game authorities. Once established, the game authority can secure the execution of any complete information game. As a result, we reduce costs that are due to the processes' freedom of choice. Namely, we reduce the price of malice.