Standard

An efficient and fair solution for communication graph games. / van den Brink, René; Khmelnitskaya, A.B. ; van der Laan, Gerard.

In: Economics Letters, Vol. 117, No. 3, 12.2012, p. 786-789.

Research output: Contribution to journal › Article › peer-review

Harvard

van den Brink, R, Khmelnitskaya, AB & van der Laan, G 2012, 'An efficient and fair solution for communication graph games', Economics Letters, vol. 117, no. 3, pp. 786-789. https://doi.org/10.1016/j.econlet.2012.08.026

APA

van den Brink, R., Khmelnitskaya, A. B., & van der Laan, G. (2012). An efficient and fair solution for communication graph games. Economics Letters, 117(3), 786-789. https://doi.org/10.1016/j.econlet.2012.08.026

Vancouver

van den Brink R, Khmelnitskaya AB, van der Laan G. An efficient and fair solution for communication graph games. Economics Letters. 2012 Dec;117(3):786-789. https://doi.org/10.1016/j.econlet.2012.08.026

Author

van den Brink, René ; Khmelnitskaya, A.B. ; van der Laan, Gerard. / An efficient and fair solution for communication graph games. In: Economics Letters. 2012 ; Vol. 117, No. 3. pp. 786-789.

BibTeX

@article{a50633b0519641aea6e2b86baa133e6a,
title = "An efficient and fair solution for communication graph games",
abstract = "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.",
keywords = "Communication graph Game theory Myerson value TU game",
author = "{van den Brink}, Ren{\'e} and A.B. Khmelnitskaya and {van der Laan}, Gerard",
year = "2012",
month = dec,
doi = "10.1016/j.econlet.2012.08.026",
language = "English",
volume = "117",
pages = "786--789",
journal = "Economics Letters",
issn = "0165-1765",
publisher = "Elsevier",
number = "3",

}

RIS

TY - JOUR

T1 - An efficient and fair solution for communication graph games

AU - van den Brink, René

AU - Khmelnitskaya, A.B.

AU - van der Laan, Gerard

PY - 2012/12

Y1 - 2012/12

N2 - 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.

AB - 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.

KW - Communication graph Game theory Myerson value TU game

U2 - 10.1016/j.econlet.2012.08.026

DO - 10.1016/j.econlet.2012.08.026

M3 - Article

VL - 117

SP - 786

EP - 789

JO - Economics Letters

JF - Economics Letters

SN - 0165-1765

IS - 3

ER -

ID: 5402473