Understanding popular matchings via stable matchings
Year of publication: |
2020
|
---|---|
Authors: | Cseh, Ágnes ; Faenza, Yuri ; Kavitha, Telikepalli ; Powers, Vladlena |
Publisher: |
Budapest : Hungarian Academy of Sciences, Institute of Economics, Centre for Economic and Regional Studies |
Subject: | popular matching | NP-completeness | polynomial algorithm | stable matching |
Series: | CERS-IE Working Papers ; CERS-IE WP - 2020/3 |
---|---|
Type of publication: | Book / Working Paper |
Type of publication (narrower categories): | Working Paper |
Language: | English |
Other identifiers: | 1697702090 [GVK] hdl:10419/222072 [Handle] RePEc:has:discpr:2003 [RePEc] |
Classification: | C63 - Computational Techniques ; C78 - Bargaining Theory; Matching Theory |
Source: |
-
Popular matchings in complete graphs
Cseh, Ágnes, (2020)
-
Understanding popular matchings via stable matchings
Cseh, Ágnes, (2020)
-
Popular matchings in complete graphs
Cseh, Ágnes, (2020)
- More ...
-
Understanding popular matchings via stable matchings
Cseh, Ágnes, (2020)
-
Quasi-popular matchings, optimality, and extended formulations
Faenza, Yuri, (2022)
-
Popular matchings with two-sided preferences and one-sided ties
Cseh, Ágnes, (2017)
- More ...