Computing the Nucleolus of Weighted Cooperative Matching Games in Polynomial Time
classification
💻 cs.GT
keywords
computingcooperativematchingnucleolusweightedalgorithmefficientfaigle
read the original 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].
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.