Talks
Fall 2017
![](https://old.simons.berkeley.edu/sites/default/files/styles/workshop_main/public/opt7large-01.png?itok=MmjWP0n3)
Computing the Nucleolus of Weighted Cooperative Matching Games in Polynomial Time
Monday, November 6th, 2017, 12:00 pm–12:30 pm
For an instance of a weighted cooperative matching game, we give a compact description of the leastcore polytope leading to an efficient algorithm for computing the nucleolus. This resolves a long-standing open question of [Kern and Paulusma, Mathematics of Operations Research, 2003].
Joint work with Jochen Könemann and Justin Toth.