Showing cs.GTShow all
2 papers · 1 filter
cs.GT2026
Stable Matchings with Minimum Utility Gap
Yao Sheng, Yu Yokoi
We introduce the Stable Matching Problem with Minimum Utility Gap, which seeks a stable matching in which the utilities received by individual agents are as balanced as possible. O…
cs.GT2024
Popular Maximum-Utility Matchings with Matroid Constraints
Gergely Csáji, Tamás Király, Kenjiro Takazawa +1
We investigate weighted settings of popular matching problems with matroid constraints. The concept of popularity was originally defined for matchings in bipartite graphs, where ve…