Pages that link to "Item:Q1587940"

The following pages link to Computing the nucleolus of some combinatorially-structured games. (Q1587940):

Displaying 19 items.

• The nucleolus of a standard tree game revisited: a study of its monotonicity and computational properties (Q532713) (← links)
• A polynomial time algorithm for computing the nucleolus for a class of disjunctive games with a permission structure (Q637584) (← links)
• The integer nucleolus of directed simple games: a characterization and an algorithm (Q725102) (← links)
• The nucleolus of trees with revenues (Q857952) (← links)
• Computation of the nucleolus of some bilateral market games (Q1096553) (← links)
• The \({\mathcal B}\)-nucleolus of TU-games (Q1268656) (← links)
• Operations research games: A survey. (With comments and rejoinder) (Q1348703) (← links)
• Note on the computational complexity of least core concepts for min-cost spanning tree games. (Q1403160) (← links)
• On the computation of the nucleolus of a cooperative game (Q1414387) (← links)
• The nucleolus of arborescence games in directed acyclic graphs (Q1785328) (← links)
• A simple procedure to compute the nucleolus of \(\Gamma\)-component additive games (Q1919115) (← links)
• On the core of cost-revenue games: minimum cost spanning tree games with revenues (Q2253991) (← links)
• A procedure to compute the nucleolus of the assignment game (Q2450756) (← links)
• Core stability in chain-component additive games (Q2483120) (← links)
• On the complexity of nucleolus computation for bipartite \(b\)-matching games (Q2670922) (← links)
• On computing the nucleolus of a balanced connected game (Q2757577) (← 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)