Efficiently computing the Shapley value of connectivity games in low-treewidth graphs
- Location
-
Deutsche Nationalbibliothek Frankfurt am Main
- Extent
-
1 Online-Ressource.
- Language
-
Englisch
- Bibliographic citation
-
Efficiently computing the Shapley value of connectivity games in low-treewidth graphs ; volume:23 ; number:1 ; day:15 ; month:2 ; year:2023 ; pages:1-23 ; date:3.2023
Operational research ; 23, Heft 1 (15.2.2023), 1-23, 3.2023
- Creator
- Contributor
-
SpringerLink (Online service)
- DOI
-
10.1007/s12351-023-00742-4
- URN
-
urn:nbn:de:101:1-2408120908353.983427067712
- Rights
-
Open Access; Der Zugriff auf das Objekt ist unbeschränkt möglich.
- Last update
-
14.08.2025, 11:00 AM CEST
Data provider
This object is provided by:
Deutsche Nationalbibliothek. If you have any questions about the object, please contact the data provider.
Deutsche Nationalbibliothek. If you have any questions about the object, please contact the data provider.
Associated
- Zanden, Tom C. van der
- Bodlaender, Hans L.
- Hamers, Herbert J. M.
- SpringerLink (Online service)
Other Objects (12)
Efficiently computing alternative paths in game maps
Cooperative games: Core and shapley value
The Shapley Value and Games with Hierarchies
The Shapley value for shortest path games
On the Shapley value of liability games
Shapley polygons in 4 x 4 games
The Shapley Value for Airport and Irrigation Games
Efficiently Computing Inclusion Dependencies for Schema Discovery
On Axiomatizations of the Shapley Value for Assignment Games
Shapley value: from cooperative game to explainable artificial intelligence
Centrality Rewarding Shapley and Myerson Values for Undirected Graph Games
A Minimal Test for Convex Games and the Shapley Value
Efficiently computing alternative paths in game maps
Cooperative games: Core and shapley value
The Shapley Value and Games with Hierarchies
The Shapley value for shortest path games
On the Shapley value of liability games
Shapley polygons in 4 x 4 games
The Shapley Value for Airport and Irrigation Games
Efficiently Computing Inclusion Dependencies for Schema Discovery
On Axiomatizations of the Shapley Value for Assignment Games
Shapley value: from cooperative game to explainable artificial intelligence
Centrality Rewarding Shapley and Myerson Values for Undirected Graph Games
A Minimal Test for Convex Games and the Shapley Value
Efficiently computing alternative paths in game maps
Cooperative games: Core and shapley value
The Shapley Value and Games with Hierarchies
The Shapley value for shortest path games
On the Shapley value of liability games
Shapley polygons in 4 x 4 games
The Shapley Value for Airport and Irrigation Games
Efficiently Computing Inclusion Dependencies for Schema Discovery
On Axiomatizations of the Shapley Value for Assignment Games
Shapley value: from cooperative game to explainable artificial intelligence
Centrality Rewarding Shapley and Myerson Values for Undirected Graph Games