Computational complexity of a solution for directed graph cooperative games (Q384201): Difference between revisions
From MaRDI portal
Created a new Item |
ReferenceBot (talk | contribs) Changed an Item |
||
(4 intermediate revisions by 4 users not shown) | |||
Property / Mathematics Subject Classification ID | |||
Property / Mathematics Subject Classification ID: 05C57 / rank | |||
Normal rank | |||
Property / Mathematics Subject Classification ID | |||
Property / Mathematics Subject Classification ID: 05C20 / rank | |||
Normal rank | |||
Property / Mathematics Subject Classification ID | |||
Property / Mathematics Subject Classification ID: 91A43 / rank | |||
Normal rank | |||
Property / Mathematics Subject Classification ID | |||
Property / Mathematics Subject Classification ID: 03D15 / rank | |||
Normal rank | |||
Property / Mathematics Subject Classification ID | |||
Property / Mathematics Subject Classification ID: 68Q17 / rank | |||
Normal rank | |||
Property / zbMATH DE Number | |||
Property / zbMATH DE Number: 6233800 / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
\(\#P\)-complete | |||
Property / zbMATH Keywords: \(\#P\)-complete / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
digraph game | |||
Property / zbMATH Keywords: digraph game / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
average covering tree value | |||
Property / zbMATH Keywords: average covering tree value / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
coalition | |||
Property / zbMATH Keywords: coalition / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
communication structure | |||
Property / zbMATH Keywords: communication structure / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
linear extension | |||
Property / zbMATH Keywords: linear extension / rank | |||
Normal rank | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1007/s40305-013-0025-8 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2156084709 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q5422499 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Counting linear extensions / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On the Complexity of Cooperative Solution Concepts / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: The Shapley value for cooperative games under precedence constraints / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q5817870 / rank | |||
Normal rank | |||
links / mardi / name | links / mardi / name | ||
Latest revision as of 03:10, 7 July 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Computational complexity of a solution for directed graph cooperative games |
scientific article |
Statements
Computational complexity of a solution for directed graph cooperative games (English)
0 references
27 November 2013
0 references
\(\#P\)-complete
0 references
digraph game
0 references
average covering tree value
0 references
coalition
0 references
communication structure
0 references
linear extension
0 references