The following pages link to Finding nucleolus of flow game (Q5896983):
Displayed 15 items.
- Finding the nucleoli of large cooperative games (Q320842) (← links)
- On the core and nucleolus of directed acyclic graph games (Q526836) (← links)
- On the complexity of core, kernel, and bargaining set (Q650525) (← links)
- Path cooperative games (Q724748) (← links)
- Computing the least-core and nucleolus for threshold cardinality matching games (Q897924) (← 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)
- Coalitional games induced by matching problems: complexity and islands of tractability for the Shapley value (Q2289024) (← links)
- Network strength games: the core and the nucleolus (Q2297643) (← links)
- A heuristic procedure for computing the nucleolus (Q2329720) (← links)
- The Complexity of the Nucleolus in Compact Games (Q2828226) (← links)
- The least square B-nucleolus for fuzzy cooperative games (Q2988439) (← links)
- The Least-Core and Nucleolus of Path Cooperative Games (Q3196373) (← links)
- Computing the nucleolus of weighted cooperative matching games in polynomial time (Q5918923) (← links)