Computing the Nucleolus of Weighted Cooperative Matching Games in Polynomial Time
Computer Science and Game Theory
2019-03-04 v3
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].
Keywords
Cite
@article{arxiv.1803.03249,
title = {Computing the Nucleolus of Weighted Cooperative Matching Games in Polynomial Time},
author = {Jochen Koenemann and Kanstantsin Pashkovich and Justin Toth},
journal= {arXiv preprint arXiv:1803.03249},
year = {2019}
}