Pages that link to "Item:Q526836"
From MaRDI portal
The following pages link to On the core and nucleolus of directed acyclic graph games (Q526836):
Displaying 13 items.
- On the core and nucleolus of directed acyclic graph games (Q526836) (← links)
- The integer nucleolus of directed simple games: a characterization and an algorithm (Q725102) (← links)
- The nucleolus of arborescence games in directed acyclic graphs (Q1785328) (← links)
- Spanning network games. (Q1972602) (← links)
- An algorithm to compute the nucleolus of shortest path games (Q1999962) (← links)
- Network strength games: the core and the nucleolus (Q2297643) (← links)
- A heuristic procedure for computing the nucleolus (Q2329720) (← links)
- Directed graphical structure, Nash equilibrium, and potential games (Q2417148) (← links)
- On the complexity of nucleolus computation for bipartite \(b\)-matching games (Q2670922) (← links)
- Arboricity games: the core and the nucleolus (Q2687037) (← links)
- The Least-Core and Nucleolus of Path Cooperative Games (Q3196373) (← links)
- A non-cooperative approach to the folk rule in minimum cost spanning tree problems (Q6164740) (← links)
- TU-games with utilities: the prenucleolus and its characterization set (Q6665452) (← links)