An Efficient and Fair Solution for Communication Graph Games

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 component balancedness. This latter axiom compares for every component in the communication graph the total payoff to the players of this component in the game itself to the total payoff of these players when applying the solution to the subgame induced by this component.

MoreLess

Year of publication:	2011-03-14
Authors:	Brink, Rene van den ; Khmelnitskaya, Anna ; Laan, Gerard van der
Institutions:	Tinbergen Institute
Subject:	TU game \| communication graph \| Myerson value \| fairness \| efficiency

freely available

Full text |

More access options

Check Google Scholar

In German libraries (KVK)

I need help

More details

Extent:	application/pdf
Series:	Tinbergen Institute Discussion Papers.
Type of publication:	Book / Working Paper
Notes:	The text is part of a series Tinbergen Institute Discussion Papers Number 11-052/1
Classification:	C71 - Cooperative Games
Source:	RePEc - Research Papers in Economics

Persistent link: https://www.econbiz.de/10008867500