The following pages link to (Q3059253):
Displaying 16 items.
- The covering values for acyclic digraph games (Q647347) (← links)
- Value of games with two-layered hypergraphs (Q656788) (← links)
- An algorithm for computing the stable coalition structures in tree-graph communication games (Q1304775) (← links)
- Values for cooperative games over graphs and games with inadmissible coalitions (Q1651251) (← links)
- A value for cooperative games with coalition and probabilistic graph structures (Q2125235) (← links)
- Coalition resilient outcomes in max \(k\)-cut games (Q2206218) (← links)
- Values for transferable utility games with coalition and graph structure (Q2343068) (← links)
- Internal structure of coalitions in competitive and altruistic graphical coalitional games (Q2628410) (← links)
- Characteristic function games with restricted agent interactions: core-stability and coalition structures (Q2634475) (← links)
- Stable cooperation in graph-restricted games (Q2827149) (← links)
- Coalition Structure Generation over Graphs (Q3143571) (← links)
- (Q3412166) (← links)
- Values of Graph-Restricted Games (Q3796995) (← links)
- Graphs and Cooperation in Games (Q4187625) (← links)
- Graph games and edge density of graphs (Q5197303) (← links)
- Cooperation and communication restrictions: A survey (Q5688334) (← links)
