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

DOI10.1137/1.9781611977073.6MaRDI QIDQ6575076

Ulrike Schmidt-Kraepelin, Telikepalli Kavitha, Jannik Matuschke, Ildikó Schlotter, Tamás Király

Publication date: 19 July 2024

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx)

Related Items (1)

Computational complexity of \(k\)-stable matchings

This page was built for publication: The popular assignment problem: when cardinality is more important than popularity

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6575076)