Computing the nucleolus of weighted cooperative matching games in polynomial time

• 成果类型: Article
• 署名作者: Konemann, Jochen; Pashkovich, Kanstantsin; Toth, Justin
• 署名单位: University of Waterloo; University of Ottawa
• 刊物名称: MATHEMATICAL PROGRAMMING
• ISSN/ISSBN: 0025-5610
• DOI: 10.1007/s10107-020-01483-4
• 发表日期: 2020
• 页码: 555-581
• 关键词: least core; algorithm; kernel

摘要

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 (Math Programm, 83: 555-569, 1998).