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
Authors:	van den Brink, Rene ; Khmelnitskaya, Anna ; van der Laan, Gerard
Publisher:	Amsterdam and Rotterdam : Tinbergen Institute
Subject:	Transferable Utility Games \| Kooperatives Spiel \| Theorie \| 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

Series:	Tinbergen Institute Discussion Paper ; 11-052/1
Type of publication:	Book / Working Paper
Type of publication (narrower categories):	Working Paper
Language:	English
Other identifiers:	840682573 [GVK] hdl:10419/86843 [Handle] RePEc:dgr:uvatin:20110052 [RePEc]
Classification:	C71 - Cooperative Games
Source:	EconStor

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