Pages that link to "Item:Q707152"
From MaRDI portal
The following pages link to Computing the nucleolus of cyclic permutation games (Q707152):
Displaying 11 items.
- The kernel is in the least core for permutation games (Q302128) (← links)
- Finding the nucleoli of large cooperative games (Q320842) (← links)
- A unifying model for matrix-based pairing situations (Q477792) (← links)
- A polynomial time algorithm for computing the nucleolus for a class of disjunctive games with a permission structure (Q637584) (← links)
- An algorithm for computing the nucleolus of disjunctive non-negative additive games with an acyclic permission structure (Q992684) (← links)
- Computing the nucleolus of some combinatorially-structured games. (Q1587940) (← links)
- Finding and verifying the nucleolus of cooperative games (Q2235144) (← links)
- A heuristic procedure for computing the nucleolus (Q2329720) (← links)
- A procedure to compute the nucleolus of the assignment game (Q2450756) (← links)
- The complexity of the nucleolus in compact games (Q2828226) (← links)
- TU-games with utilities: the prenucleolus and its characterization set (Q6665452) (← links)