The popular assignment problem: when cardinality is more important than popularity

Telikepalli Kavitha, Tamás Király, Jannik Matuschke, Ildikó Schlotter, Ulrike Schmidt-Kraepelin. The popular assignment problem: when cardinality is more important than popularity. In Joseph (Seffi) Naor, Niv Buchbinder, editors, Proceedings of the 2022 ACM-SIAM Symposium on Discrete Algorithms, SODA 2022, Virtual Conference / Alexandria, VA, USA, January 9 - 12, 2022. pages 103-123, SIAM, 2022. [doi]

Authors

Telikepalli Kavitha

This author has not been identified. Look up 'Telikepalli Kavitha' in Google

Tamás Király

This author has not been identified. Look up 'Tamás Király' in Google

Jannik Matuschke

This author has not been identified. Look up 'Jannik Matuschke' in Google

Ildikó Schlotter

This author has not been identified. Look up 'Ildikó Schlotter' in Google

Ulrike Schmidt-Kraepelin

This author has not been identified. Look up 'Ulrike Schmidt-Kraepelin' in Google