Computational Complexity of k-Stable Matchings - researchr publication authors

researchr

You are not signed in
Sign in
Sign up

Haris Aziz 0001, Gergely Csáji, Ágnes Cseh. Computational Complexity of k-Stable Matchings. In Argyrios Deligkas, Aris Filos-Ratsikas, editors, Algorithmic Game Theory - 16th International Symposium, SAGT 2023, Egham, UK, September 4-7, 2023, Proceedings. Volume 14238 of Lecture Notes in Computer Science, pages 311-328, Springer, 2023. [doi]

This author has not been identified. Look up 'Haris Aziz 0001' in GoogleThis author has not been identified. Look up 'Gergely Csáji' in GoogleThis author has not been identified. Look up 'Ágnes Cseh' in Google

runs on WebDSL