Abstract
For an instance of a weighted cooperative matching game, we give a compact description of the leastcore polytope leading to an efficient algorithm for computing the nucleolus. This resolves a long-standing open question of [Kern and Paulusma, Mathematics of Operations Research, 2003].
Joint work with Jochen Könemann and Justin Toth.