The covering values for acyclic digraph games (Q647347): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: The Shapley value for cooperative games under precedence constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Games with permission structures: The conjunctive 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: Values for rooted-tree and sink-tree digraph games and sharing a river / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3059253 / 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: An axiomatization of the disjunctive permission value for games with a permission structure / rank
 
Normal rank
Property / cites work
 
Property / cites work: Component efficient solutions in line-graph games with applications / rank
 
Normal rank

Revision as of 15:52, 4 July 2024

scientific article
Language Label Description Also known as
English
The covering values for acyclic digraph games
scientific article

    Statements

    Identifiers