Skip to main content
Conference Proceedings

Computing the Nucleolus of Weighted Cooperative Matching Games in Polynomial Time

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (2019) 11480 LNCS 413-426
DOI: 10.1007/978-3-030-17953-3_31
1Citations
Citations of this article
1Readers
Mendeley users who have this article in their library.
Get full text

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ättler, Mathematical Programming, 1998].

Author supplied keywords

Cite

CITATION STYLE

APA

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

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free