A new fault-tolerant algorithm for clock synchronization
Information and Computation
Impossibility of distributed consensus with one faulty process
Journal of the ACM (JACM)
Algorithmic mechanism design (extended abstract)
STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
Reaching Agreement in the Presence of Faults
Journal of the ACM (JACM)
The Byzantine Generals Problem
ACM Transactions on Programming Languages and Systems (TOPLAS)
Stackelberg scheduling strategies
STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
Algorithms, games, and the internet
STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
A BGP-based mechanism for lowest-cost routing
Proceedings of the twenty-first annual symposium on Principles of distributed computing
Proceedings of the twenty-second annual symposium on Principles of distributed computing
Equilibria in topology control games for ad hoc networks
DIALM-POMC '03 Proceedings of the 2003 joint workshop on Foundations of mobile computing
Broadcast in radio networks tolerating byzantine adversarial behavior
Proceedings of the twenty-third annual ACM symposium on Principles of distributed computing
Distributed Computing
Inoculation strategies for victims of viruses and the sum-of-squares partition problem
SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
Selfish Routing and the Price of Anarchy
Selfish Routing and the Price of Anarchy
BAR fault tolerance for cooperative services
Proceedings of the twentieth ACM symposium on Operating systems principles
On the topologies formed by selfish peers
Proceedings of the twenty-fifth annual ACM symposium on Principles of distributed computing
STACS'99 Proceedings of the 16th annual conference on Theoretical aspects of computer science
Congestion games with malicious players
Proceedings of the 8th ACM conference on Electronic commerce
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
Impact of Asynchrony on the Behavior of Rational Selfish Agents
Fundamenta Informaticae
Fault tolerance in large games
Proceedings of the 9th ACM conference on Electronic commerce
On the windfall of friendship: inoculation strategies on social networks
Proceedings of the 9th ACM conference on Electronic commerce
Distributed computing in SOSP and OSDI
ACM SIGACT News
A local mean field analysis of security investments in networks
Proceedings of the 3rd international workshop on Economics of networked systems
On the Complexity of Equilibria Problems in Angel-Daemon Games
COCOON '08 Proceedings of the 14th annual international conference on Computing and Combinatorics
An exercise in selfish stabilization
ACM Transactions on Autonomous and Adaptive Systems (TAAS)
The Price of Malice in Linear Congestion Games
WINE '08 Proceedings of the 4th International Workshop on Internet and Network Economics
Malicious Bayesian Congestion Games
Approximation and Online Algorithms
Proceedings of the 10th ACM conference on Electronic commerce
Uncertainty in the weakest-link security game
GameNets'09 Proceedings of the First ICST international conference on Game Theory for Networks
Bayesian Auctions with Friends and Foes
SAGT '09 Proceedings of the 2nd International Symposium on Algorithmic Game Theory
WINE '09 Proceedings of the 5th International Workshop on Internet and Network Economics
SSS'06 Proceedings of the 8th international conference on Stabilization, safety, and security of distributed systems
Game authority for robust and scalable distributed selfish-computer systems
Theoretical Computer Science
Better vaccination strategies for better people
Proceedings of the 11th ACM conference on Electronic commerce
FlightPath: obedience vs. choice in cooperative services
OSDI'08 Proceedings of the 8th USENIX conference on Operating systems design and implementation
ICALP'10 Proceedings of the 37th international colloquium conference on Automata, languages and programming: Part II
Web services and incerta spiriti: a game theoretic approach to uncertainty
ECSQARU'11 Proceedings of the 11th European conference on Symbolic and quantitative approaches to reasoning with uncertainty
The price of defense and fractional matchings
ICDCN'06 Proceedings of the 8th international conference on Distributed Computing and Networking
Adversarial behavior in network mechanism design
Proceedings of the 5th International ICST Conference on Performance Evaluation Methodologies and Tools
Towards network games with social preferences
SIROCCO'10 Proceedings of the 17th international conference on Structural Information and Communication Complexity
OPODIS'11 Proceedings of the 15th international conference on Principles of Distributed Systems
The snowball effect of uncertainty in potential games
WINE'11 Proceedings of the 7th international conference on Internet and Network Economics
Survey: Robust and scalable middleware for selfish-computer systems
Computer Science Review
Impact of Asynchrony on the Behavior of Rational Selfish Agents
Fundamenta Informaticae
What's a little collusion between friends?
Proceedings of the 2013 ACM symposium on Principles of distributed computing
ACM Transactions on Economics and Computation
Reasoning with MAD distributed systems
CONCUR'13 Proceedings of the 24th international conference on Concurrency Theory
On the Windfall and price of friendship: Inoculation strategies on social networks
Computer Networks: The International Journal of Computer and Telecommunications Networking
| Hi-index | 0.00 |
Over the last years, game theory has provided great insights into the behavior of distributed systems by modeling the players as utility-maximizing agents. In particular, it has been shown that selfishness causes many systems to perform in a globally suboptimal fashion. Such systems are said to have a large Price of Anarchy. In this paper, we extend this active field of research by allowing some players to be malicious or Byzantine rather than selfish. We ask: What is the impact of Byzantine players on the system's efficiency compared to purely selfish environments or compared to the social optimum? In particular, we introduce the Price of Malice which captures this efficiency degradation. As an example, we analyze the Price of Malice of a game which models the containment of the spread of viruses. In this game, each node can choose whether or not to install anti-virus software. Then, a virus starts from a random node and iteratively infects all neighboring nodes which are not inoculated. We establish various results about this game. For instance, we quantify how much the presence of Byzantine players can deteriorate or---in case of highly risk-averse selfish players---improve the social welfare of the distributed system.