Is Shapley cost sharing optimal?

被引:6
|
作者
Dobzinski, Shahar [1 ,4 ]
Mehta, Aranyak [2 ]
Roughgarden, Tim [3 ]
Sundararajan, Mukund [2 ,4 ]
机构
[1] Weizmann Inst Sci, Dept Appl Math & Comp Sci, IL-76100 Rohovot, Israel
[2] Google Inc, Mountain View, CA USA
[3] Stanford Univ, Dept Comp Sci, 474 Gates Bldg,353 Serra Mall, Stanford, CA 94305 USA
[4] Stanford Univ, Stanford, CA 94305 USA
基金
以色列科学基金会;
关键词
Shapley value; Cost-sharing mechanisms; Approximate efficiency; EXCLUDABLE PUBLIC-GOODS; SCHEDULING PROBLEMS; MECHANISMS; EFFICIENCY; SERIAL;
D O I
10.1016/j.geb.2017.03.008
中图分类号
F [经济];
学科分类号
02 ;
摘要
A general approach to the design of budget-balanced cost-sharing mechanisms is to use the Shapley value, applied to the given cost function, to define payments from the players to the mechanism. Is the corresponding Shapley value mechanism "optimal" in some sense? We consider the objective of minimizing worst-case inefficiency subject to a revenue constraint, and prove results in three different regimes. First, for the public excludable good problem, the Shapley value mechanism minimizes the worst-case efficiency loss over all truthful, deterministic, and budget-balanced mechanisms that satisfy equal treatment. Second, even with randomization and approximate budget-balance allowed and dropping equal treatment, the worst-case efficiency loss of the Shapley value mechanism is within a constant factor of the minimum possible. Third, for no-deficit mechanisms, we prove a general positive result: for every monotone cost function, a suitable blend of the VCG and Shapley value mechanisms is no-deficit and enjoys good approximate efficiency guarantees. (C) 2017 Elsevier Inc. All rights reserved.
引用
收藏
页码:130 / 138
页数:9
相关论文
共 50 条