Allocation rules for networks inspired by cooperative game-theory
Alternative title: | Les règles d'allocation pour les réseaux inspirées de la théorie des jeux coopératifs |
---|---|
Year of publication: |
juillet-août 2017
|
Authors: | Caulier, Jean-François ; Skoda, Alexandre ; Tanimura, Emily |
Published in: |
Revue d'économie politique. - Paris : Dalloz, ISSN 0373-2630, ZDB-ID 241473-9. - Vol. 127.2017, 4, p. 517-558
|
Subject: | communication games | network games | Shapley value | Myerson value | the average tree solution | axiomatization | Kooperatives Spiel | Cooperative game | Shapley-Wert | Spieltheorie | Game theory | Netzwerk | Network | Kommunikation | Communication | Transferierbarer Nutzen | Transferable utility |
-
Networks, communication and hierarchy : applications to cooperative games
Algaba, Encarnación, (2021)
-
Consistency and the graph Banzhaf value for communication graph games
Shan, Erfang, (2022)
-
Directed communication in games with directed graphs
Gavilán, E. C., (2023)
- More ...
-
Convexity of graph-restricted games induced by minimum partitions
Skoda, Alexandre, (2019)
-
Inheritance of convexity for the Pmin-restricted game
Skoda, Alexandre, (2021)
-
Coalition structures induced by the strength of a graph
Grabisch, Michel, (2011)
- More ...