Computing the nucleolus of weighted cooperative matching games in polynomial time
2020
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).
- Correction
- Cite
- Save
- Machine Reading By IdeaReader
50
References
0
Citations
NaN
KQI