Popular Maximum-Utility Matchings with Matroid Constraints – new co-authored article by Gergely Csáji in Mathematics of Operations Research journal

Popular Maximum-Utility Matchings with Matroid Constraints Gergely Csáji, Tamás Király, Kenjiro Takazawa, Yu Yokoi Mathematics of Operations Research – Published Online:23 Sep 2025 Abstract We investigate weighted settings of popular matching problems with matroid constraints. The concept of popularity was originally defined for matchings in bipartite graphs, where vertices have preferences over the incident […]