Competitive routing in multiuser communication networks
IEEE/ACM Transactions on Networking (TON)
Algorithms, games, and the internet
STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
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
The Price of Routing Unsplittable Flow
Proceedings of the thirty-seventh annual ACM symposium on Theory of computing
The price of anarchy of finite congestion games
Proceedings of the thirty-seventh annual ACM symposium on Theory of computing
Congestion games with failures
Proceedings of the 6th ACM conference on Electronic commerce
Selfish Routing and the Price of Anarchy
Selfish Routing and the Price of Anarchy
Fairness Measures for Resource Allocation
SIAM Journal on Computing
Fast, Fair, and Efficient Flows in Networks
Operations Research
Taxed congestion games with failures
Annals of Mathematics and Artificial Intelligence
STACS'99 Proceedings of the 16th annual conference on Theoretical aspects of computer science
Mechanism design with execution uncertainty
UAI'02 Proceedings of the Eighteenth conference on Uncertainty in artificial intelligence
Agent failures in totally balanced games and convex games
WINE'12 Proceedings of the 8th international conference on Internet and Network Economics
Hi-index | 0.04 |
We introduce a new class of games, congestion games with failures (CGFs), which allows for resource failures in congestion games. In a CGF, players share a common set of resources (service providers), where each service provider (SP) may fail with some known probability (that may be constant or depend on the congestion on the resource). For reliability reasons, a player may choose a subset of the SPs in order to try and perform his task. The cost of a player for utilizing any SP is a function of the total number of players using this SP. A main feature of this setting is that the cost for a player for successful completion of his task is the minimum of the costs of his successful attempts. We show that although CGFs do not, in general, admit a (generalized ordinal) potential function and the finite improvement property (and thus are not isomorphic to congestion games), they always possess a pure strategy Nash equilibrium. Moreover, every best reply dynamics converges to an equilibrium in any given CGF, and the SPs' congestion experienced in different equilibria is (almost) unique. Furthermore, we provide an efficient procedure for computing a pure strategy equilibrium in CGFs and show that every best equilibrium (one minimizing the sum of the players' disutilities) is semi-strong. Finally, for the subclass of symmetric CGFs we give a constructive characterization of best and worst equilibria.