4 citations · 6 across the 5 of their papers we have counts for
1 paper · 1 filter
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…