Computing the Nucleolus of Weighted Cooperative Matching Games in Polynomial Time
share
We provide an efficient algorithm for computing the nucleolus for an instance of a weighted cooperative matching game. This resolves a long-standing open question of [Kern and Paulusma, Mathematics of Operations Research, 2003].
READ FULL TEXT