2000 character limit reached
Computing the Nucleolus of Weighted Cooperative Matching Games in Polynomial Time (1803.03249v3)
Published 8 Mar 2018 in cs.GT
Abstract: 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 posed in [Faigle, Kern, Fekete, Hochst\"{a}ttler, Mathematical Programming, 1998].