Rooted-tree solutions for tree games (Q1046115): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
Property / cites work | |||
Property / cites work: Convex multi-choice games: characterizations and monotonic allocation schemes / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Games on lattices, multichoice games and the Shapley value: a new approach / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: The average tree solution for cycle-free graph games / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Graphs and Cooperation in Games / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q5817870 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Harsanyi power solutions for graph-restricted games / rank | |||
Normal rank |
Latest revision as of 07:23, 2 July 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Rooted-tree solutions for tree games |
scientific article |
Statements
Rooted-tree solutions for tree games (English)
0 references
21 December 2009
0 references
average tree solution
0 references
communication structure
0 references
marginal contributions
0 references
random (order) values
0 references