4 citations · 5 across the 3 of their papers we have counts for
3 papers · 1 filter
On the Complexity of Nucleolus Computation for Bipartite b-Matching Games
Jochen Koenemann, Justin Toth, Felix Zhou
We explore the complexity of nucleolus computation in b-matching games on bipartite graphs. We show that computing the nucleolus of a simple b-matching game is NP-hard even on bipa…
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…
Approximating Stable Matchings with Ties of Bounded Size
Jochen Koenemann, Kanstantsin Pashkovich, Natig Tofigzade
Finding a stable matching is one of the central problems in algorithmic game theory. If participants are allowed to have ties and incomplete preferences, computing a stable matchin…