Computing the Nucleolus of Weighted Cooperative Matching Games in Polynomial Time
Jochen Koenemann, Kanstantsin Pashkovich, Justin Toth
TL;DR
This paper presents a polynomial-time algorithm for computing the nucleolus in weighted cooperative matching games, solving a long-standing open problem in cooperative game theory.
Contribution
The authors develop an efficient algorithm that computes the nucleolus for weighted cooperative matching games, addressing a major open question from 1998.
Findings
Polynomial-time algorithm for nucleolus computation
Resolves a long-standing open problem
Advances understanding of cooperative matching games
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].
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
Computing the Nucleolus of Weighted Cooperative Matching Games in Polynomial Time· youtube
Taxonomy
TopicsGame Theory and Voting Systems · Game Theory and Applications