{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T04:29:06Z","timestamp":1750220946231,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":28,"publisher":"ACM","license":[{"start":{"date-parts":[[2019,6,17]],"date-time":"2019-06-17T00:00:00Z","timestamp":1560729600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/100010663","name":"H2020 European Research Council","doi-asserted-by":"publisher","award":["677651 and 714704"],"award-info":[{"award-number":["677651 and 714704"]}],"id":[{"id":"10.13039\/100010663","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2019,6,17]]},"DOI":"10.1145\/3328526.3329555","type":"proceedings-article","created":{"date-parts":[[2019,6,21]],"date-time":"2019-06-21T12:45:07Z","timestamp":1561121107000},"page":"41-59","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":3,"title":["Matchings under Preferences"],"prefix":"10.1145","author":[{"given":"Jiehua","family":"Chen","sequence":"first","affiliation":[{"name":"University of Warsaw, Warsaw, Poland"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Piotr","family":"Skowron","sequence":"additional","affiliation":[{"name":"University of Warsaw, Warsaw, Poland"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Manuel","family":"Sorge","sequence":"additional","affiliation":[{"name":"University of Warsaw, Warsaw, Poland"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2019,6,17]]},"reference":[{"key":"e_1_3_2_2_1_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10458-011-9184-3"},{"key":"e_1_3_2_2_2_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-53354-3_16"},{"key":"e_1_3_2_2_3_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2012.01.022"},{"key":"e_1_3_2_2_4_1","doi-asserted-by":"publisher","DOI":"10.1007\/s11238-012-9319-2"},{"key":"e_1_3_2_2_5_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-67504-6_22"},{"key":"e_1_3_2_2_6_1","doi-asserted-by":"publisher","DOI":"10.1090\/S0002-9939-1965-0180568-2"},{"key":"e_1_3_2_2_7_1","volume-title":"Proc. ICALP-18","author":"Chen Jiehua","year":"2018","unstructured":"Jiehua Chen , Danny Hermelin , Manuel Sorge , and Harel Yedidsion . 2018 a. How hard is it to satisfy (almost) all roommates? . In Proc. ICALP-18 . 35:1--35:15. Jiehua Chen, Danny Hermelin, Manuel Sorge, and Harel Yedidsion. 2018a. How hard is it to satisfy (almost) all roommates?. In Proc. ICALP-18. 35:1--35:15."},{"key":"e_1_3_2_2_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/3219166.3219168"},{"volume-title":"Parameterized Algorithms","author":"Cygan Marek","key":"e_1_3_2_2_10_1","unstructured":"Marek Cygan , Fedor V. Fomin , Lukasz Kowalik , Daniel Lokshtanov , D\u00e1niel Marx , Marcin Pilipczuk , Michal Pilipczuk , and Saket Saurabh . 2015. Parameterized Algorithms . Springer . Marek Cygan, Fedor V. Fomin, Lukasz Kowalik, Daniel Lokshtanov, D\u00e1niel Marx, Marcin Pilipczuk, Michal Pilipczuk, and Saket Saurabh. 2015. Parameterized Algorithms .Springer."},{"key":"e_1_3_2_2_11_1","volume-title":"Fellows","author":"Downey Rodney G.","year":"2013","unstructured":"Rodney G. Downey and Michael R . Fellows . 2013 . Fundamentals of Parameterized Complexity .Springer. Rodney G. Downey and Michael R. Fellows. 2013. Fundamentals of Parameterized Complexity .Springer."},{"key":"e_1_3_2_2_12_1","volume-title":"Proc. IJCAI-13 . 97--105","author":"Drummond Joanna","year":"2013","unstructured":"Joanna Drummond and Craig Boutilier . 2013 . Elicitation and Approximately Stable Matching with Partial Preferences . In Proc. IJCAI-13 . 97--105 . Joanna Drummond and Craig Boutilier. 2013. Elicitation and Approximately Stable Matching with Partial Preferences. In Proc. IJCAI-13 . 97--105."},{"volume-title":"Parameterized Complexity Theory","author":"Flum J\u00f6rg","key":"e_1_3_2_2_13_1","unstructured":"J\u00f6rg Flum and Martin Grohe . 2006. Parameterized Complexity Theory . Springer . J\u00f6rg Flum and Martin Grohe. 2006. Parameterized Complexity Theory .Springer."},{"key":"e_1_3_2_2_14_1","doi-asserted-by":"publisher","DOI":"10.4169\/amer.math.monthly.120.05.386"},{"key":"e_1_3_2_2_15_1","doi-asserted-by":"publisher","DOI":"10.5555\/3297863.3297933"},{"key":"e_1_3_2_2_16_1","volume-title":"Proc. AAAI-17","author":"Genc B.","year":"2017","unstructured":"B. Genc , M. Siala , G. Simonin , and B. O'Sullivan . 2017 b. Robust Stable Marriage . In Proc. AAAI-17 . 4925--4926. B. Genc, M. Siala, G. Simonin, and B. O'Sullivan. 2017b. Robust Stable Marriage. In Proc. AAAI-17. 4925--4926."},{"key":"e_1_3_2_2_17_1","volume-title":"Irving","author":"Gusfield Dan","year":"1989","unstructured":"Dan Gusfield and Robert W . Irving . 1989 . The Stable Marriage Problem--Structure and Algorithms .MIT Press . Dan Gusfield and Robert W. Irving. 1989. The Stable Marriage Problem--Structure and Algorithms .MIT Press."},{"key":"e_1_3_2_2_18_1","doi-asserted-by":"publisher","DOI":"10.1016\/0166-218X(92)00179-P"},{"key":"e_1_3_2_2_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/28869.28871"},{"key":"e_1_3_2_2_20_1","doi-asserted-by":"publisher","DOI":"10.1093\/biomet\/30.1-2.81"},{"key":"e_1_3_2_2_21_1","unstructured":"Donald Knuth. 1976. Mariages Stables .Les Presses de L'Universit\u00e9 de Montr\u00e9al.  Donald Knuth. 1976. Mariages Stables .Les Presses de L'Universit\u00e9 de Montr\u00e9al."},{"key":"e_1_3_2_2_22_1","volume-title":"Vazirani","author":"Mai Tung","year":"2018","unstructured":"Tung Mai and Vijay V . Vazirani . 2018 a. Finding Stable Matchings That Are Robust to Errors in the Input. In Proc. ESA- 18 . 60:1--60:11. Tung Mai and Vijay V. Vazirani. 2018a. Finding Stable Matchings That Are Robust to Errors in the Input. In Proc. ESA-18 . 60:1--60:11."},{"key":"e_1_3_2_2_24_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0304-3975(01)00206-7"},{"volume-title":"Algorithmics of Matching Under Preferences","author":"Manlove David F.","key":"e_1_3_2_2_25_1","unstructured":"David F. Manlove . 2013. Algorithmics of Matching Under Preferences . Vol. 2 . WorldScientific . David F. Manlove. 2013. Algorithmics of Matching Under Preferences. Vol. 2. WorldScientific."},{"key":"e_1_3_2_2_26_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-04612-5_23"},{"key":"e_1_3_2_2_27_1","volume-title":"Proc. ISAAC-17","author":"Miyazaki Shuichi","year":"2017","unstructured":"Shuichi Miyazaki and Kazuya Okamoto . 2017 . Jointly Stable Matchings . In Proc. ISAAC-17 . 56:1--56:12. Shuichi Miyazaki and Kazuya Okamoto. 2017. Jointly Stable Matchings. In Proc. ISAAC-17. 56:1--56:12."},{"volume-title":"Invitation to Fixed-Parameter Algorithms","author":"Niedermeier Rolf","key":"e_1_3_2_2_28_1","unstructured":"Rolf Niedermeier . 2006. Invitation to Fixed-Parameter Algorithms . Oxford University Press . Rolf Niedermeier. 2006. Invitation to Fixed-Parameter Algorithms .Oxford University Press."},{"volume-title":"Algorithmic Game Theory","author":"Papadimitriou Christos H.","key":"e_1_3_2_2_29_1","unstructured":"Christos H. Papadimitriou . 2007. The Complexity of Finding Nash Equilibria . In Algorithmic Game Theory . Cambridge University Press , 29--51. Christos H. Papadimitriou. 2007. The Complexity of Finding Nash Equilibria. In Algorithmic Game Theory . Cambridge University Press, 29--51."},{"key":"e_1_3_2_2_30_1","doi-asserted-by":"publisher","DOI":"10.3390\/a6040782"}],"event":{"name":"EC '19: ACM Conference on Economics and Computation","sponsor":["SIGecom Special Interest Group on Economics and Computation"],"location":"Phoenix AZ USA","acronym":"EC '19"},"container-title":["Proceedings of the 2019 ACM Conference on Economics and Computation"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3328526.3329555","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3328526.3329555","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T23:53:40Z","timestamp":1750204420000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3328526.3329555"}},"subtitle":["Strength of Stability and Trade-Offs"],"short-title":[],"issued":{"date-parts":[[2019,6,17]]},"references-count":28,"alternative-id":["10.1145\/3328526.3329555","10.1145\/3328526"],"URL":"https:\/\/doi.org\/10.1145\/3328526.3329555","relation":{},"subject":[],"published":{"date-parts":[[2019,6,17]]},"assertion":[{"value":"2019-06-17","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}