Pages that link to "Item:Q5704127"

The following pages link to Matching Games: The Least Core and the Nucleolus (Q5704127):

Displaying 31 items.

• Efficient stabilization of cooperative matching games (Q526875) (← links)
• On the complexity of core, kernel, and bargaining set (Q650525) (← links)
• Computing solutions for matching games (Q662281) (← links)
• Path cooperative games (Q724748) (← links)
• Computing the least-core and nucleolus for threshold cardinality matching games (Q897924) (← links)
• On core stability, vital coalitions, and extendability (Q1036591) (← links)
• The stable fixtures problem with payments (Q1651275) (← links)
• Characterization sets for the nucleolus in balanced games (Q1694788) (← links)
• The nucleolus of arborescence games in directed acyclic graphs (Q1785328) (← links)
• Simple games versus weighted voting games: bounding the critical threshold value (Q1986594) (← links)
• An algorithm to compute the nucleolus of shortest path games (Q1999962) (← links)
• Answers set programs for non-transferable utility games: expressiveness, complexity and applications (Q2060739) (← links)
• Network disconnection games: a game theoretic approach to checkpoint evaluation in networks (Q2064296) (← links)
• The general graph matching game: approximate core (Q2078093) (← links)
• On the population monotonicity of independent set games (Q2084006) (← links)
• Computing the nucleolus of weighted voting games in pseudo-polynomial time (Q2089798) (← links)
• Population monotonicity in matching games (Q2136163) (← 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)
• Approximating the least core value and least core of cooperative games with supermodular costs (Q2445844) (← links)
• Computing an element in the lexicographic kernel of a game (Q2474551) (← 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)
• Computing Near-Optimal Stable Cost Allocations for Cooperative Games by Lagrangian Relaxation (Q2960364) (← links)
• The Least-Core and Nucleolus of Path Cooperative Games (Q3196373) (← links)
• Simultaneous Penalization and Subsidization for Stabilizing Grand Cooperation (Q4971567) (← links)
• Finding nucleolus of flow game (Q5896983) (← links)
• Computing the nucleolus of weighted cooperative matching games in polynomial time (Q5918923) (← links)
• The complexity of matching games: a survey (Q6488787) (← links)
• Algorithmic solutions for maximizing shareable costs (Q6659082) (← links)