4 citations · 4 across the 1 of their papers we have counts for
Showing cs.GTShow all
2 papers · 1 filter
cs.GT2020★ 4 cited
A General Framework for Computing the Nucleolus Via Dynamic Programming
Jochen Koenemann, Justin Toth
This paper defines a general class of cooperative games for which the nucleolus is efficiently computable. This class includes new members for which the complexity of computing the…
cs.GT2018
Computing the Nucleolus of Weighted Cooperative Matching Games in Polynomial Time
Jochen Koenemann, Kanstantsin Pashkovich, Justin Toth
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,…