An efficient and fair solution for communication graph games

被引：48

作者：

van den Brink, Rene ^{[1
,2
]}

Khmelnitskaya, Anna ^{[3
]}

van der Laan, Gerard ^{[1
,2
]}

机构：

[1] Vrije Univ Amsterdam, Dept Econometr, NL-1081 HV Amsterdam, Netherlands

[2] Vrije Univ Amsterdam, Tinbergen Inst, NL-1081 HV Amsterdam, Netherlands

[3] St Petersburg State Univ, Fac Appl Math, St Petersburg 198504, Russia

来源：

ECONOMICS LETTERS | 2012年 / 117卷 / 03期

关键词：

Game theory; TU game; Communication graph; Myerson value;

D O I：

10.1016/j.econlet.2012.08.026

中图分类号：

F [经济];

学科分类号：

020101 [政治经济学];

摘要：

We introduce an efficient solution for games with communication graph structures and show that it is characterized by efficiency, fairness and a new axiom called fair distribution of the surplus. (C) 2012 Elsevier B.V. All rights reserved.

引用

页码：786 / 789

页数：4

共 5 条

[1]

Fairness and fairness for neighbors: The difference between the Myerson value and component-wise egalitarian solutions [J].

Beal, Sylvain ;

Remila, Eric ;

Solal, Philippe .

ECONOMICS LETTERS, 2012, 117 (01) :263-267

[2]

Casajus A., 2007, Working paper

[3]

COINCIDENCE OF AND COLLINEARITY BETWEEN GAME THEORETIC SOLUTIONS [J].

DRIESSEN, TSH ;

FUNAKI, Y .

OR SPEKTRUM, 1991, 13 (01) :15-30

[4]

Myerson R. B., 1977, Mathematics of Operations Research, V2, P225, DOI 10.1287/moor.2.3.225

[5]

Shapley L.S., 1953, Contributions to the Theory of Games, DOI [DOI 10.1515/9781400881970-018, 10.1515/9781400881970-018]

← 1 →