Pages that link to "Item:Q1972591"
From MaRDI portal
The following pages link to Characterization sets for the nucleolus (Q1972591):
Displaying 23 items.
- On the core and nucleolus of directed acyclic graph games (Q526836) (← links)
- A characterization of the nucleolus for convex games (Q1268632) (← links)
- On the computation of the nucleolus of a cooperative game (Q1414387) (← links)
- On the 1-nucleolus (Q1683941) (← links)
- Characterization sets for the nucleolus in balanced games (Q1694788) (← links)
- The nucleolus of arborescence games in directed acyclic graphs (Q1785328) (← links)
- Computing the nucleolus when the characteristic function is given implicitly: A constraint generation approach (Q1905053) (← links)
- The kernel/nucleolus of a standard tree game (Q1914097) (← links)
- A simple procedure to compute the nucleolus of \(\Gamma\)-component additive games (Q1919115) (← links)
- Nonsymmetric variants of the prekernel and the prenucleolus (Q1938826) (← links)
- Finding the nucleolus of the vehicle routing game with time windows (Q1988954) (← links)
- An algorithm to compute the nucleolus of shortest path games (Q1999962) (← links)
- Finding and verifying the nucleolus of cooperative games (Q2235144) (← links)
- A heuristic procedure for computing the nucleolus (Q2329720) (← links)
- Strongly essential coalitions and the nucleolus of peer group games (Q2572447) (← links)
- On the complexity of nucleolus computation for bipartite \(b\)-matching games (Q2670922) (← links)
- The complexity of the nucleolus in compact games (Q2828226) (← links)
- Analytic solution for the nucleolus of a three-player cooperative game (Q3065628) (← links)
- Fast computation of the leastcore and prenucleolus of cooperative games (Q3598039) (← links)
- (Q4032599) (← links)
- (Q4433635) (← links)
- Finding nucleolus of flow game (Q5896983) (← links)
- Computing the nucleolus of weighted cooperative matching games in polynomial time (Q5918923) (← links)
