"Optimistic" weighted Shapley rules in minimum cost spanning tree problems
"Optimistic" weighted Shapley rules in minimum cost spanning tree problems
复制标题
DOI：
10.1016/j.ejor.2006.12.035
复制
发表时间：
2008-02
期刊：
影响因子：
--
通讯作者：
G. Bergantiños;S. Lorenzo-Freire
中科院分区：
文献类型：
--
作者：
G. Bergantiños;S. Lorenzo-Freire
在最小生成树问题中引入了乐观加权Shapley规则。我们将它们定义为Bergantiños和Vidal-Puga [Bergantiños，G.，Vidal-Puga，J.J.，即将到来。最小费用生成树问题中的乐观TU对策。国际博弈论杂志。可从以下网站获得：]。我们证明它们是义务规则[Tijs，S.，布兰泽河，Moretti，S.，Norde，H.，2006.最小费用生成树情形的义务规则及其单调性。欧洲运筹学杂志175，121-134]。
We introduce optimistic weighted Shapley rules in minimum cost spanning tree problems. We define them as the weighted Shapley values of the optimistic game v+introduced in Bergantiños and Vidal-Puga [Bergantiños, G., Vidal-Puga, J.J., forthcoming. The optimistic TU game in minimum cost spanning tree problems. International Journal of Game Theory. Available from: ]. We prove that they are obligation rules [Tijs, S., Branzei, R., Moretti, S., Norde, H., 2006. Obligation rules for minimum cost spanning tree situations and their monotonicity properties. European Journal of Operational Research 175, 121–134].