Popular matchings in complete graphs
Year of publication: |
2020
|
---|---|
Authors: | Cseh, Ágnes ; Kavitha, Telikepalli |
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/4 |
---|---|
Type of publication: | Book / Working Paper |
Type of publication (narrower categories): | Working Paper |
Language: | English |
Other identifiers: | 1697706886 [GVK] hdl:10419/222073 [Handle] RePEc:has:discpr:2004 [RePEc] |
Classification: | C63 - Computational Techniques ; C78 - Bargaining Theory; Matching Theory |
Source: |
-
Understanding popular matchings via stable matchings
Cseh, Ágnes, (2020)
-
Understanding popular matchings via stable matchings
Cseh, Ágnes, (2020)
-
Popular matchings in complete graphs
Cseh, Ágnes, (2020)
- More ...
-
Popular matchings with two-sided preferences and one-sided ties
Cseh, Ágnes, (2017)
-
Popular edges and dominant matchings
Cseh, Ágnes, (2017)
-
Understanding popular matchings via stable matchings
Cseh, Ágnes, (2020)
- More ...