On the complexity of the parity argument and other inefficient proofs of existence
Journal of Computer and System Sciences - Special issue: 31st IEEE conference on foundations of computer science, Oct. 22–24, 1990
Journal of the ACM (JACM)
Selfish Routing and the Price of Anarchy
Selfish Routing and the Price of Anarchy
Fast convergence to Wardrop equilibria by adaptive sampling methods
Proceedings of the thirty-eighth annual ACM symposium on Theory of computing
When selfish meets evil: byzantine players in a virus inoculation game
Proceedings of the twenty-fifth annual ACM symposium on Principles of distributed computing
Spiteful bidding in sealed-bid auctions
IJCAI'07 Proceedings of the 20th international joint conference on Artifical intelligence
Regret minimization and the price of total anarchy
STOC '08 Proceedings of the fortieth annual ACM symposium on Theory of computing
Altruism, selfishness, and spite in traffic routing
Proceedings of the 9th ACM conference on Electronic commerce
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
The Price of Malice in Linear Congestion Games
WINE '08 Proceedings of the 4th International Workshop on Internet and Network Economics
Stackelberg Routing in Arbitrary Networks
WINE '08 Proceedings of the 4th International Workshop on Internet and Network Economics
Malicious Bayesian Congestion Games
Approximation and Online Algorithms
EGOIST: overlay routing using selfish neighbor selection
CoNEXT '08 Proceedings of the 2008 ACM CoNEXT Conference
Proceedings of the 10th ACM conference on Electronic commerce
GameNets'09 Proceedings of the First ICST international conference on Game Theory for Networks
SAGT '09 Proceedings of the 2nd International Symposium on Algorithmic Game Theory
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
Stackelberg Routing in Arbitrary Networks
Mathematics of Operations Research
Stressed web environments as strategic games: risk profiles and weltanschauung
TGC'10 Proceedings of the 5th international conference on Trustworthly global computing
Weakly-acyclic (internet) routing games
SAGT'11 Proceedings of the 4th international conference on Algorithmic game theory
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
How well can congestion pricing neutralize denial of service attacks?
Proceedings of the 12th ACM SIGMETRICS/PERFORMANCE joint international conference on Measurement and Modeling of Computer Systems
Approaching utopia: strong truthfulness and externality-resistant mechanisms
Proceedings of the 4th conference on Innovations in Theoretical Computer Science
ACM Transactions on Economics and Computation
Weakly-Acyclic (Internet) Routing Games
Theory of Computing Systems
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 |
We study the equilibria of non-atomic congestion games in which there are two types of players: rational players, who seek to minimize their own delay, and malicious players, who seek to maximize the average delay experienced by the rational players. We study the existence of pure and mixed Nash equilibria for these games, and we seek to quantify the impact of the malicious players on the equilibrium. One counter intuitive phenomenon which we demonstrate is the "windfall of malice": paradoxically, when a myopically malicious player gains control of a fraction of the flow, a fraction of the players change from rational to malicious, the new equilibrium may be more favorable for the remaining rational players than the previous equilibrium.