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 5 items.
- On the core and nucleolus of directed acyclic graph games (Q526836) (← links)
- An algorithm to compute the nucleolus of shortest path games (Q1999962) (← links)
- A heuristic procedure for computing the nucleolus (Q2329720) (← links)
- On the complexity of nucleolus computation for bipartite \(b\)-matching games (Q2670922) (← links)
- A non-cooperative approach to the folk rule in minimum cost spanning tree problems (Q6164740) (← links)
