Computing the Nucleolus of Weighted Cooperative Matching Games in Polynomial Time

Jochen Koenemann, Kanstantsin Pashkovich, Justin Toth

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].

Knowledge Graph



Sign up or login to leave a comment