Communications of the ACM
Time, clocks, and the ordering of events in a distributed system
Communications of the ACM
Rational secret sharing and multiparty computation: extended abstract
STOC '04 Proceedings of the thirty-sixth annual ACM symposium on Theory of computing
Free Riding on Gnutella Revisited: The Bell Tolls?
IEEE Distributed Systems Online
BAR fault tolerance for cooperative services
Proceedings of the twentieth ACM symposium on Operating systems principles
When selfish meets evil: byzantine players in a virus inoculation game
Proceedings of the twenty-fifth annual ACM symposium on Principles of distributed computing
Proceedings of the twenty-fifth annual ACM symposium on Principles of distributed computing
OSDI '06 Proceedings of the 7th USENIX Symposium on Operating Systems Design and Implementation - Volume 7
Bittorrent is an auction: analyzing and improving bittorrent's incentives
Proceedings of the ACM SIGCOMM 2008 conference on Data communication
Competitive safety analysis: robust decision-making in multi-agent systems
Journal of Artificial Intelligence Research
Lower bounds on implementing robust and resilient mediators
TCC'08 Proceedings of the 5th conference on Theory of cryptography
FlightPath: obedience vs. choice in cooperative services
OSDI'08 Proceedings of the 8th USENIX conference on Operating systems design and implementation
It's on me! the benefit of altruism in BAR environment
DISC'10 Proceedings of the 24th international conference on Distributed computing
Do incentives build robustness in bit torrent
NSDI'07 Proceedings of the 4th USENIX conference on Networked systems design & implementation
Rationality in the full-information model
TCC'10 Proceedings of the 7th international conference on Theory of Cryptography
What's a little collusion between friends?
Proceedings of the 2013 ACM symposium on Principles of distributed computing
Reasoning with MAD distributed systems
CONCUR'13 Proceedings of the 24th international conference on Concurrency Theory
Hi-index | 0.00 |
Cooperative, peer-to-peer (P2P) services--distributed systems consisting of participants from multiple administrative domains (MAD)--must deal with the threat of arbitrary (Byzantine) failures while incentivizing the cooperation of potentially selfish (rational) nodes that such services rely on to function. This paper investigates how to specify conditions (i.e., a solution concept) for rational cooperation in an environment that also contains Byzantine and obedient peers. We find that regret-free approaches--which, inspired by traditional Byzantine fault tolerance, condition rational cooperation on identifying a strategy that proves a best response regardless of how Byzantine failures occur--are unattainable in many fault-tolerant distributed systems. We suggest an alternative regret-braving approach, in which rational nodes aim to best respond to their expectations regarding Byzantine failures: the chosen strategy guarantees no regret only to the extent that such expectations prove correct. While work on regret-braving solution concepts is just beginning, our preliminary results show that these solution concepts are not subject to the fundamental limitations inherent to regret freedom.