Algorithms, games, and the internet
STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
Journal of the ACM (JACM)
Pricing network edges for heterogeneous selfish users
Proceedings of the thirty-fifth annual ACM symposium on Theory of computing
How asymmetry helps load balancing
Journal of the ACM (JACM)
The price of anarchy is independent of the network topology
Journal of Computer and System Sciences - STOC 2002
The complexity of pure Nash equilibria
STOC '04 Proceedings of the thirty-sixth annual ACM symposium on Theory of computing
Edge Pricing of Multicommodity Networks for Heterogeneous Selfish Users
FOCS '04 Proceedings of the 45th Annual IEEE Symposium on Foundations of Computer Science
Tolls for Heterogeneous Selfish Users in Multicommodity Networks and Generalized Congestion Games
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
How much can taxes help selfish routing?
Journal of Computer and System Sciences - Special issue on network algorithms 2005
Tight bounds for worst-case equilibria
ACM Transactions on Algorithms (TALG)
Selfish Load Balancing and Atomic Congestion Games
Algorithmica
Taxes for linear atomic congestion games
ESA'06 Proceedings of the 14th conference on Annual European Symposium - Volume 14
The effectiveness of Stackelberg strategies and tolls for network congestion games
SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
Graph balancing: a special case of scheduling unrelated parallel machines
Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
STACS'99 Proceedings of the 16th annual conference on Theoretical aspects of computer science
Stackelberg strategies for atomic congestion games
ESA'07 Proceedings of the 15th annual European conference on Algorithms
Cost-balancing tolls for atomic network congestion games
WINE'07 Proceedings of the 3rd international conference on Internet and network economics
Tight bounds for selfish and greedy load balancing
ICALP'06 Proceedings of the 33rd international conference on Automata, Languages and Programming - Volume Part I
Taxes for linear atomic congestion games
ACM Transactions on Algorithms (TALG)
Hi-index | 0.00 |
In load balancing games, there is a set of available servers and a set of clients; each client wishes to run her job on some server. Clients are selfish and each of them selects a server that, given an assignment of the other clients to servers, minimizes the latency she experiences with no regard to the global optimum. In order to mitigate the effect of selfishness on the efficiency, we assign taxes to the servers. In this way, we obtain a new game where each client aims to minimize the sum of the latency she experiences and the tax she pays. Our objective is to find taxes so that the worst equilibrium of the new game is as efficient as possible. We present new results concerning the impact of taxes on the efficiency of equilibria, with respect to the total latency of all clients and the maximum latency (makespan).