Efficiency analysis of load balancing games with and without activation costs

Authors:
Bo Chen;Sinan Gürel
Affiliations:
Qufu Normal University, Shandong, China 273165 and Centre for Discrete Mathematics and its Applications (DIMAP), Warwick Business School, University of Warwick, Coventry, UK CV4 7AL;Centre for Discrete Mathematics and its Applications (DIMAP), Warwick Business School, University of Warwick, Coventry, UK CV4 7AL and Department of Industrial Engineering, Middle East Technical U ...
Venue:
Journal of Scheduling
Year:
2012

Citing 19
Cited 1

Algorithms, games, and the internet

STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
How bad is selfish routing?

Journal of the ACM (JACM)
Desiderata for agent argumentation protocols

Proceedings of the first international joint conference on Autonomous agents and multiagent systems: part 1
Tight bounds for worst-case equilibria

SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
Sharing the cost of multicast transmissions

Journal of Computer and System Sciences - Special issue on Internet algorithms
On optimal outcomes of negotiations over resources

AAMAS '03 Proceedings of the second international joint conference on Autonomous agents and multiagent systems
The Price of Routing Unsplittable Flow

Proceedings of the thirty-seventh annual ACM symposium on Theory of computing
Utilitarian resource assignment

Journal of Discrete Algorithms
Strong equilibrium in cost sharing connection games

Proceedings of the 8th ACM conference on Electronic commerce
Selfish Routing with Incomplete Information

Theory of Computing Systems
A new model for selfish routing

Theoretical Computer Science
Nash equilibria in discrete routing games with convex latency functions

Journal of Computer and System Sciences
Conflicting Congestion Effects in Resource Allocation Games

WINE '08 Proceedings of the 4th International Workshop on Internet and Network Economics
Intrinsic robustness of the price of anarchy

Proceedings of the forty-first annual ACM symposium on Theory of computing
The Price of Stability for Network Design with Fair Cost Allocation

SIAM Journal on Computing
Worst-case equilibria

STACS'99 Proceedings of the 16th annual conference on Theoretical aspects of computer science
Total latency in singleton congestion games

WINE'07 Proceedings of the 3rd international conference on Internet and network economics
Tradeoffs and Average-Case Equilibria in Selfish Routing

ACM Transactions on Computation Theory (TOCT)
Exact price of anarchy for polynomial congestion games

STACS'06 Proceedings of the 23rd Annual conference on Theoretical Aspects of Computer Science

Convergence of best-response dynamics in games with conflicting congestion effects

WINE'12 Proceedings of the 8th international conference on Internet and Network Economics

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper, we study two models of resource allocation games: the classical load-balancing game and its new variant involving resource activation costs. The resources we consider are identical and the social costs of the games are utilitarian, which are the average of all individual players' costs.Using the social costs we assess the quality of pure Nash equilibria in terms of the price of anarchy (PoA) and the price of stability (PoS). For each game problem, we identify suitable problem parameters and provide a parametric bound on the PoA and the PoS. In the case of the load-balancing game, the parametric bounds we provide are sharp and asymptotically tight.