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

DOI10.1016/J.TCS.2024.114476MaRDI QIDQ6129697zbMATH OpenOpenAlexFDO

Authors Jochen Könemann, Justin Toth, Felix Zhou

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)

Recommendations

• On the complexity of nucleolus computation for bipartite \(b\)-matching games
• A general framework for computing the nucleolus via dynamic programming
• Matching Games: The Least Core and the Nucleolus
• On solution concepts for matching games
• Computing solutions for matching games

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)