Approximating Stable Matchings with Ties of Bounded Size

Jochen Könemann, Kanstantsin Pashkovich, Natig Tofigzade. Approximating Stable Matchings with Ties of Bounded Size. In Tobias Harks, Max Klimm, editors, Algorithmic Game Theory - 13th International Symposium, SAGT 2020, Augsburg, Germany, September 16-18, 2020, Proceedings. Volume 12283 of Lecture Notes in Computer Science, pages 178-192, Springer, 2020. [doi]

Authors

Jochen Könemann

This author has not been identified. Look up 'Jochen Könemann' in Google

Kanstantsin Pashkovich

This author has not been identified. Look up 'Kanstantsin Pashkovich' in Google

Natig Tofigzade

This author has not been identified. Look up 'Natig Tofigzade' in Google