A procedure to compute the nucleolus of the assignment game
From MaRDI portal
Publication:2450756
DOI10.1016/j.orl.2013.09.005zbMath1287.91013OpenAlexW2009789971MaRDI QIDQ2450756
F. Javier Martínez-de-Albéniz, Neus Ybern, Carles Rafels
Publication date: 15 May 2014
Published in: Operations Research Letters (Search for Journal in Brave)
Full work available at URL: http://hdl.handle.net/2445/118803
Related Items (7)
Computing Near-Optimal Stable Cost Allocations for Cooperative Games by Lagrangian Relaxation ⋮ A survey on assignment markets ⋮ Does it make sense to analyse a two-sided market as a multi-choice game? ⋮ A note on assignment games with the same nucleolus ⋮ An axiomatization of the nucleolus of assignment markets ⋮ Multi-sided assignment games on \(m\)-partite graphs ⋮ A heuristic procedure for computing the nucleolus
Cites Work
This page was built for publication: A procedure to compute the nucleolus of the assignment game