An Efficient and Fair Solution for Communication Graph Games

J.R. van den Brink; A. Khmelnitskaya; G. van der Laan

doi:10.1016/j.econlet.2012.08.026

An Efficient and Fair Solution for Communication Graph Games

J.R. van den Brink, A. Khmelnitskaya, G. van der Laan

Research output: Contribution to Journal › Article › Academic › peer-review

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. © 2012 Elsevier B.V.

Original language	English
Pages (from-to)	786-789
Journal	Economics Letters
Volume	117
Issue number	3
DOIs	https://doi.org/10.1016/j.econlet.2012.08.026
Publication status	Published - 2012

UN SDGs

This output contributes to the following UN Sustainable Development Goals (SDGs)

Access to Document

10.1016/j.econlet.2012.08.026

Persistent URL (handle)

Persistent link

Cite this

@article{f02a83123745482c9bf9dbe7bce42732,

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. {\textcopyright} 2012 Elsevier B.V.",

author = "{van den Brink}, J.R. and A. Khmelnitskaya and {van der Laan}, G.",

year = "2012",

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",

}

TY - JOUR

T1 - An Efficient and Fair Solution for Communication Graph Games

AU - van den Brink, J.R.

AU - Khmelnitskaya, A.

AU - van der Laan, G.

PY - 2012

Y1 - 2012

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. © 2012 Elsevier B.V.

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. © 2012 Elsevier B.V.

U2 - 10.1016/j.econlet.2012.08.026

DO - 10.1016/j.econlet.2012.08.026

M3 - Article

SN - 0165-1765

VL - 117

SP - 786

EP - 789

JO - Economics Letters

JF - Economics Letters

IS - 3

ER -

An Efficient and Fair Solution for Communication Graph Games

Abstract

UN SDGs

Access to Document

Persistent URL (handle)

Fingerprint

Cite this