Narrow search
Showing 1 - 6 of 6
Cover Image
Understanding popular matchings via stable matchings
Cseh, Ágnes; Faenza, Yuri; Kavitha, Telikepalli; … - 2020
graph. Results from the literature seem to suggest that stable and dominant matchings behave, from a complexity theory point …
Persistent link: https://www.econbiz.de/10012211535
Cover Image
Popular matchings in complete graphs
Cseh, Ágnes; Kavitha, Telikepalli - 2020
Our input is a complete graph G on n vertices where each vertex has a strictranking of all other vertices in G. The goal is to construct a matching in G that is "globallystable" or popular. A matching M is popular if M does not lose a head-to-head election againstany matching M': here each...
Persistent link: https://www.econbiz.de/10012211577
Cover Image
Popular matchings with two-sided preferences and one-sided ties
Cseh, Ágnes; Huang, Chien-chung; Kavitha, Telikepalli - 2017
(n2) algorithm (where n = |A B|) for the popular matching problem in this model. Note that this model is quite different …
Persistent link: https://www.econbiz.de/10011757166
Cover Image
Understanding popular matchings via stable matchings
Cseh, Ágnes; Faenza, Yuri; Kavitha, Telikepalli; … - 2020
graph. Results from the literature seem to suggest that stable and dominant matchings behave, from a complexity theory point …
Persistent link: https://www.econbiz.de/10012290306
Cover Image
Popular matchings in complete graphs
Cseh, Ágnes; Kavitha, Telikepalli - 2020
Our input is a complete graph G on n vertices where each vertex has a strictranking of all other vertices in G. The goal is to construct a matching in G that is "globallystable" or popular. A matching M is popular if M does not lose a head-to-head election againstany matching M': here each...
Persistent link: https://www.econbiz.de/10012290307
Cover Image
Quasi-popular matchings, optimality, and extended formulations
Faenza, Yuri; Kavitha, Telikepalli - In: Mathematics of operations research 47 (2022) 1, pp. 427-457
Persistent link: https://www.econbiz.de/10013364875