![Bridging Continuous and Discrete Optimization_hi-res logo](/sites/default/files/styles/workshop_banner_sm_1x/public/2023-01/Bridging%20Continuous%20and%20Discrete%20Optimization_hi-res.png.jpg?itok=b7fmT0eV)
Abstract
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.