Computer Science – Computer Science and Game Theory
Scientific paper
2005-06-14
Computer Science
Computer Science and Game Theory
Originally Laboratory for Information and Decision Systems (MIT) Publication 2605
Scientific paper
We consider a resource allocation problem where individual users wish to send data across a network to maximize their utility, and a cost is incurred at each link that depends on the total rate sent through the link. It is known that as long as users do not anticipate the effect of their actions on prices, a simple proportional pricing mechanism can maximize the sum of users' utilities minus the cost (called aggregate surplus). Continuing previous efforts to quantify the effects of selfish behavior in network pricing mechanisms, we consider the possibility that users anticipate the effect of their actions on link prices. Under the assumption that the links' marginal cost functions are convex, we establish existence of a Nash equilibrium. We show that the aggregate surplus at a Nash equilibrium is no worse than a factor of 4*sqrt{2} - 5 times the optimal aggregate surplus; thus, the efficiency loss when users are selfish is no more than approximately 34%.
Johari Ramesh
Mannor Shie
Tsitsiklis John N.
No associations
LandOfFree
Efficiency Loss in a Network Resource Allocation Game: The Case of Elastic Supply does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Efficiency Loss in a Network Resource Allocation Game: The Case of Elastic Supply, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Efficiency Loss in a Network Resource Allocation Game: The Case of Elastic Supply will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-224866