The average covering tree value for directed graph games

We introduce a single-valued solution concept, the so-called average covering tree value, for the class of transferable utility games with limited communication structure represented by a directed graph. The solution is the average of the marginal contribution vectors corresponding to all covering t...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	Journal of combinatorial optimization 2020-02, Vol.39 (2), p.315-333
Hauptverfasser:	Khmelnitskaya, Anna, Selçuk, Özer, Talman, Dolf
Format:	Artikel
Sprache:	eng
Schlagworte:	Combinatorics Convex and Discrete Geometry Convexity Game theory Games Graph theory Graphical representations Graphs Mathematical Modeling and Industrial Mathematics Mathematics Mathematics and Statistics Operations Research/Decision Theory Optimization Theory of Computation Trees
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!