功利资源分配
Utilitarian resource assignment
摘要:
本文研究了Koutsoupias和Papadimitriou提出的一个资源分配问题。该方案被建模为一个多人游戏,其中每个玩家选择一个有限数量的已知资源。玩家的成本是所有选择该资源的玩家的总重量,乘以该资源的“延迟”。最近的论文研究了纳什均衡和社会最优的$L_\infty$成本度量,其中社会成本是最大成本的任何球员。我们研究了这个游戏的$L_1$变体,其中社会成本被认为是个体玩家的成本之和,而不是这些成本的最大值。我们给出的协调比,这是自私的行为所产生的社会成本和最优社会成本之间的比例的大小上的界限,我们还研究了算法问题,找到最优(最低成本)的分配和纳什均衡。此外,我们得到了一些特殊情况下的问题的替代纳什均衡之间的比率的界限。
英文摘要:
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.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。