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

DOI10.1137/1.9781611977073.6MaRDI QIDQ6575076zbMATH OpenFDO

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

Publication date 19 July 2024

Full work available at URL https://doi.org/10.1137/1.9781611977073.6

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx)

Cited in

(6)

• Computational complexity of \(k\)-stable matchings
• Popular arborescences and their matroid generalization
• Combinatorial optimization. Abstracts from the workshop held November 10--15, 2024
• Maximum-utility popular matchings with bounded instability
• Popular roommates in simply exponential time
• The popular dimension of 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)