Pages that link to "Item:Q1869507"
From MaRDI portal
The following pages link to On the nucleolus of neighbor games (Q1869507):
Displaying 12 items.
- Finding the nucleoli of large cooperative games (Q320842) (← links)
- An algorithm for computing the nucleolus of disjunctive non-negative additive games with an acyclic permission structure (Q992684) (← links)
- The nucleolus of homogeneous games with steps (Q1324689) (← links)
- An algorithm for finding the nucleolus of assignment games (Q1327070) (← links)
- Operations research games: A survey. (With comments and rejoinder) (Q1348703) (← links)
- Neighbor games and the leximax solution (Q1416784) (← links)
- Computing the nucleolus of weighted voting games in pseudo-polynomial time (Q2089798) (← links)
- Clique games: a family of games with coincidence between the nucleolus and the Shapley value (Q2173166) (← links)
- Finding and verifying the nucleolus of cooperative games (Q2235144) (← links)
- A heuristic procedure for computing the nucleolus (Q2329720) (← links)
- Core stability in chain-component additive games (Q2483120) (← links)
- TU-games with utilities: the prenucleolus and its characterization set (Q6665452) (← links)