Pages that link to "Item:Q1268656"
From MaRDI portal
The following pages link to The \({\mathcal B}\)-nucleolus of TU-games (Q1268656):
Displaying 13 items.
- Finding the nucleoli of large cooperative games (Q320842) (← links)
- On the core and nucleolus of directed acyclic graph games (Q526836) (← links)
- A polynomial time algorithm for computing the nucleolus for a class of disjunctive games with a permission structure (Q637584) (← links)
- The nucleolus of balanced simple flow networks (Q817277) (← links)
- Characterization sets for the nucleolus in balanced games (Q1694788) (← links)
- Considerations on the aggregate monotonicity of the nucleolus and the core-center (Q2040429) (← links)
- The nucleolus and inheritance of properties in communication situations (Q2095955) (← links)
- Finding and verifying the nucleolus of cooperative games (Q2235144) (← links)
- Weighted nucleoli and dually essential coalitions (Q2280044) (← links)
- A heuristic procedure for computing the nucleolus (Q2329720) (← links)
- The prenucleolus for games with restricted cooperation (Q2637411) (← links)
- The Complexity of the Nucleolus in Compact Games (Q2828226) (← links)
- TU-games with utilities: the prenucleolus and its characterization set (Q6665452) (← links)