Utilitarian resource assignment

Computer Science – Computer Science and Game Theory

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

19 pages

Scientific paper

This paper studies a resource allocation problem introduced by Koutsoupias and Papadimitriou. The scenario is modelled as a multiple-player game in which each player selects one of a finite number of known resources. The cost to the player is the total weight of all players who choose that resource, multiplied by the ``delay'' of that resource. Recent papers have studied the Nash equilibria and social optima of this game in terms of the $L_\infty$ cost metric, in which the social cost is taken to be the maximum cost to any player. We study the $L_1$ variant of this game, in which the social cost is taken to be the sum of the costs to the individual players, rather than the maximum of these costs. We give bounds on the size of the coordination ratio, which is the ratio between the social cost incurred by selfish behavior and the optimal social cost; we also study the algorithmic problem of finding optimal (lowest-cost) assignments and Nash Equilibria. Additionally, we obtain bounds on the ratio between alternative Nash equilibria for some special cases of the problem.

No associations

LandOfFree

Say what you really think

Search LandOfFree.com for scientists and scientific papers. Rate them and share your experience with other people.

Rating

Utilitarian resource assignment 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 Utilitarian resource assignment, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Utilitarian resource assignment will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-714595

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.