The following pages link to (Q3916403):
Displayed 17 items.
- A polynomial time algorithm for computing the nucleolus for a class of disjunctive games with a permission structure (Q637584) (← links)
- Computing the nucleolus of cyclic permutation games (Q707152) (← links)
- The nucleolus of balanced simple flow networks (Q817277) (← links)
- Evolutionary dynamics and equitable core selection in assignment games (Q891334) (← links)
- Fair cost allocations under conflicts - a game-theoretic point of view - (Q924627) (← links)
- Extended cooperative networks games (Q1028468) (← links)
- The \({\mathcal B}\)-nucleolus of TU-games (Q1268656) (← links)
- Characterization sets for the nucleolus in balanced games (Q1694788) (← links)
- The nucleolus of arborescence games in directed acyclic graphs (Q1785328) (← links)
- State space methods in asset pricing (Q1825112) (← links)
- On the nucleolus of neighbor games (Q1869507) (← links)
- The nucleolus and the core-center of multi-sided Böhm-Bawerk assignment markets (Q1935926) (← links)
- An algorithm to compute the nucleolus of shortest path games (Q1999962) (← links)
- Weighted nucleoli and dually essential coalitions (Q2280044) (← links)
- Cooperative networks games with elastic demands (Q3515388) (← links)
- Tarification par des jeux Coopératifs avec Demandes Élastiques (Q4531459) (← links)
- Finding nucleolus of flow game (Q5896983) (← links)