The following pages link to (Q4633840):
Displaying 11 items.
- Finding the nucleoli of large cooperative games (Q320842) (← links)
- Computing cooperative solution concepts in coalitional skill games (Q490424) (← 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)
- The nucleolus of arborescence games in directed acyclic graphs (Q1785328) (← links)
- An algorithm to compute the nucleolus of shortest path games (Q1999962) (← links)
- Pseudo polynomial size LP formulation for calculating the least core value of weighted voting games (Q2070558) (← links)
- Computing the nucleolus of weighted voting games in pseudo-polynomial time (Q2089798) (← links)
- Arboricity games: the core and the nucleolus (Q2687037) (← links)
- The Least-Core and Nucleolus of Path Cooperative Games (Q3196373) (← links)
