This paper initiates a study of connections between local and global properties of graphical games. Specifically, we introduce a concept of local price of anarchy that quantifie...
In this paper, we define a network service provider game. We show that the price of anarchy of the defined game can be bounded by analyzing a local search heuristic for a related...
Nikhil R. Devanur, Naveen Garg, Rohit Khandekar, V...
We investigate the price of anarchy of a load balancing game with K dispatchers. The service rates and holding costs are assumed to depend on the server, and the service disciplin...
We consider the price of selfish routing in terms of tradeoffs and from an average-case perspective. Each player in a network game seeks to send a message with a certain length by...
We consider a variation of the resource allocation problem. In the traditional problem, there is a global planner who would like to assign a set of players to a set of resources s...