Arbeitspapier
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.
- Sprache
-
Englisch
- Erschienen in
-
Series: Tinbergen Institute Discussion Paper ; No. 11-052/1
- Klassifikation
-
Wirtschaft
Cooperative Games
- Thema
-
TU game
communication graph
Myerson value
fairness
efficiency
Transferable Utility Games
Kooperatives Spiel
Theorie
- Ereignis
-
Geistige Schöpfung
- (wer)
-
van den Brink, Rene
Khmelnitskaya, Anna
van der Laan, Gerard
- Ereignis
-
Veröffentlichung
- (wer)
-
Tinbergen Institute
- (wo)
-
Amsterdam and Rotterdam
- (wann)
-
2011
- Handle
- Letzte Aktualisierung
-
10.03.2025, 11:43 MEZ
Datenpartner
ZBW - Deutsche Zentralbibliothek für Wirtschaftswissenschaften - Leibniz-Informationszentrum Wirtschaft. Bei Fragen zum Objekt wenden Sie sich bitte an den Datenpartner.
Objekttyp
- Arbeitspapier
Beteiligte
- van den Brink, Rene
- Khmelnitskaya, Anna
- van der Laan, Gerard
- Tinbergen Institute
Entstanden
- 2011