Pages that link to "Item:Q1972591"
From MaRDI portal
The following pages link to Characterization sets for the nucleolus (Q1972591):
Displaying 10 items.
- On the core and nucleolus of directed acyclic graph games (Q526836) (← links)
- Characterization sets for the nucleolus in balanced games (Q1694788) (← links)
- The nucleolus of arborescence games in directed acyclic graphs (Q1785328) (← links)
- An algorithm to compute the nucleolus of shortest path games (Q1999962) (← links)
- Finding and verifying the nucleolus of cooperative games (Q2235144) (← links)
- A heuristic procedure for computing the nucleolus (Q2329720) (← links)
- On the complexity of nucleolus computation for bipartite \(b\)-matching games (Q2670922) (← links)
- The Complexity of the Nucleolus in Compact Games (Q2828226) (← links)
- Finding nucleolus of flow game (Q5896983) (← links)
- Computing the nucleolus of weighted cooperative matching games in polynomial time (Q5918923) (← links)
