On the complexity of nucleolus computation for bipartite b-matching games

DOI10.1016/J.TCS.2024.114476OpenAlexW4393132206MaRDI QIDQ6129697FDOQ6129697

Jochen Könemann, Felix Zhou, Justin Toth

Publication date: 17 April 2024

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2024.114476

zbMATH Keywords

linear programmingcombinatorial optimizationcomplexity theoryalgorithmic game theorycooperative game theorymatching games

Mathematics Subject Classification ID

Theory of computing (68Qxx)

This page was built for publication: On the complexity of nucleolus computation for bipartite \(b\)-matching games

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6129697)