Computing the Nucleolus of Weighted Cooperative Matching Games in Polynomial Time

2018/03/08 by Jochen Koenemann, Kanstantsin Pashkovich, Koenemann, Jochen +3 · 1 citation
Economics, Econometrics and Finance · Decision Sciences · #Game Theory and Voting Systems #Game Theory and Applications

paper · pdf · doi:10.48550/arxiv.1803.03249

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].

Cited by

• Faster Algorithms for the Least-Core value and the Nucleolus in Convex Games

Related

• A General Framework for Computing the Nucleolus Via Dynamic Programming
• Computing the Nucleolus of Weighted Voting Games in Pseudo-polynomial Time
• Faster Algorithms for the Least-Core value and the Nucleolus in Convex Games
• Polynomial-Time Algorithms for Computing the Nucleolus: An Assessment
• Finding the Nucleoli of Large Cooperative Games: A Disproof with\n Counter-Example