Pages that link to "Item:Q1972596"

The following pages link to Computing the nucleolus of min-cost spanning tree games is NP-hard. (Q1972596):

Displaying 20 items.

• On the core and nucleolus of directed acyclic graph games (Q526836) (← links)
• Path cooperative games (Q724748) (← links)
• Computing the least-core and nucleolus for threshold cardinality matching games (Q897924) (← links)
• Fair cost allocations under conflicts - a game-theoretic point of view - (Q924627) (← links)
• Computational complexity in additive hedonic games (Q1046065) (← links)
• Characterization sets for the nucleolus in balanced games (Q1694788) (← links)
• The nucleolus of arborescence games in directed acyclic graphs (Q1785328) (← links)
• NP-completeness in hedonic games (Q1886742) (← links)
• Computation of the Shapley value of minimum cost spanning tree games: P-hardness and polynomial cases (Q1926641) (← links)
• An algorithm to compute the nucleolus of shortest path games (Q1999962) (← links)
• Network disconnection games: a game theoretic approach to checkpoint evaluation in networks (Q2064296) (← links)
• Computing the nucleolus of weighted voting games in pseudo-polynomial time (Q2089798) (← links)
• On the complexity of nucleolus computation for bipartite \(b\)-matching games (Q2670922) (← links)
• Arboricity games: the core and the nucleolus (Q2687037) (← links)
• The Complexity of the Nucleolus in Compact Games (Q2828226) (← links)
• The Least-Core and Nucleolus of Path Cooperative Games (Q3196373) (← links)
• COALITION FORMATION GAMES: A SURVEY (Q3444827) (← links)
• Finding nucleolus of flow game (Q5896983) (← links)
• An efficient characterization of submodular spanning tree games (Q5918917) (← links)
• Computing the nucleolus of weighted cooperative matching games in polynomial time (Q5918923) (← links)