Computing the nucleolus of cyclic permutation games
From MaRDI portal
Publication:707152
DOI10.1016/j.ejor.2003.02.003zbMath1080.91008OpenAlexW2063810092MaRDI QIDQ707152
Tamás Solymosi, S. H. Tijs, Thirukkannamangai E. S. Raghavan
Publication date: 9 February 2005
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2003.02.003
Related Items
The kernel is in the least core for permutation games ⋮ Finding the nucleoli of large cooperative games ⋮ A unifying model for matrix-based pairing situations ⋮ Finding and verifying the nucleolus of cooperative games ⋮ An algorithm for computing the nucleolus of disjunctive non-negative additive games with an acyclic permission structure ⋮ The Complexity of the Nucleolus in Compact Games ⋮ A heuristic procedure for computing the nucleolus
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Permutation games: Another class of totally balanced games
- An algorithm for finding the nucleolus of assignment games
- The assignment game. I: The core
- On one-sided versus two-sided matching games
- Geometric Properties of the Kernel, Nucleolus, and Related Solution Concepts
- The Nucleolus of a Characteristic Function Game
This page was built for publication: Computing the nucleolus of cyclic permutation games
