The weighted majority algorithm
Information and Computation
Journal of the ACM (JACM)
Adaptive routing with end-to-end feedback: distributed learning and geometric approaches
STOC '04 Proceedings of the thirty-sixth annual ACM symposium on Theory of computing
Anytime algorithms for multi-armed bandit problems
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
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
Congestion games with malicious players
Proceedings of the 8th ACM conference on Electronic commerce
Equilibria for networks with malicious users
Mathematical Programming: Series A and B
Regret minimization and the price of total anarchy
STOC '08 Proceedings of the fortieth annual ACM symposium on Theory of computing
The Price of Stochastic Anarchy
SAGT '08 Proceedings of the 1st International Symposium on Algorithmic Game Theory
Spiteful bidding in sealed-bid auctions
IJCAI'07 Proceedings of the 20th international joint conference on Artifical intelligence
STACS'99 Proceedings of the 16th annual conference on Theoretical aspects of computer science
WINE '09 Proceedings of the 5th International Workshop on Internet and Network Economics
Adversarial behavior in network mechanism design
Proceedings of the 5th International ICST Conference on Performance Evaluation Methodologies and Tools
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
Non-monetary fair scheduling: a cooperative game theory approach
Proceedings of the twenty-fifth annual ACM symposium on Parallelism in algorithms and architectures
ACM Transactions on Economics and Computation
Computational Aspects of Uncertainty Profiles and Angel-Daemon Games
Theory of Computing Systems
| Hi-index | 0.00 |
We study the price of malice in linear congestion games using the technique of no-regret analysis in the presence of Byzantine players. Our assumptions about the behavior both of rational players, and of malicious players are strictly weaker than have been previously used to study the price of malice. Rather than assuming that rational players route their flow according to a Nash equilibrium, we assume only that they play so as to have no regret . Rather than assuming that malicious players myopically seek to maximize the social cost of the game, we study Byzantine players about whom we make no assumptions, who may be seeking to optimize any utility function, and who may engage in an arbitrary degree of counter-speculation. Because our assumptions are strictly weaker than in previous work, the bounds we prove on two measures of the price of malice hold also for the quantities studied by Babaioff et al. [2] and Moscibroda et al. [15] We prove tight bounds both for the special case of parallel link routing games, and for general congestion games.