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ättler, Mathematical Programming, 1998].
CITATION STYLE
Könemann, J., Pashkovich, K., & Toth, J. (2019). Computing the Nucleolus of Weighted Cooperative Matching Games in Polynomial Time. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 11480 LNCS, pp. 413–426). Springer Verlag. https://doi.org/10.1007/978-3-030-17953-3_31
Mendeley helps you to discover research relevant for your work.