{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,4]],"date-time":"2026-04-04T04:59:59Z","timestamp":1775278799564,"version":"3.50.1"},"publisher-location":"Cham","reference-count":22,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783030046118","type":"print"},{"value":"9783030046125","type":"electronic"}],"license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2018]]},"DOI":"10.1007\/978-3-030-04612-5_21","type":"book-chapter","created":{"date-parts":[[2018,11,20]],"date-time":"2018-11-20T10:09:45Z","timestamp":1542708585000},"page":"312-326","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Stable Marriage with Groups of Similar Agents"],"prefix":"10.1007","author":[{"given":"Kitty","family":"Meeks","sequence":"first","affiliation":[]},{"given":"Baharak","family":"Rastegari","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2018,11,21]]},"reference":[{"key":"21_CR1","doi-asserted-by":"crossref","unstructured":"Aziz, H., de Keijzer, B.: Complexity of coalition structure generation. In: Proceedings of the 10th International Conference on Autonomous Agents and Multiagent Systems, AAMAS 2011, pp. 191\u2013198 (2011)","DOI":"10.65109\/KVYX5768"},{"key":"21_CR2","doi-asserted-by":"crossref","unstructured":"Bhatnagar, N., Greenberg, S., Randall, D.: Sampling stable marriages: why spouse-swapping won\u2019t work. In: Proceedings of the 19th ACM\/SIAM Symposium on Discrete Algorithms, SODA 2008, pp. 1223\u20131232. ACM-SIAM (2008)","DOI":"10.1137\/1.9780898716474"},{"key":"21_CR3","doi-asserted-by":"publisher","first-page":"1828","DOI":"10.1016\/j.tcs.2010.02.003","volume":"411","author":"P Bir\u00f3","year":"2010","unstructured":"Bir\u00f3, P., Manlove, D., Mittal, S.: Size versus stability in the marriage problem. Theor. Comput. Sci. 411, 1828\u20131841 (2010)","journal-title":"Theor. Comput. Sci."},{"key":"21_CR4","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1016\/j.tcs.2012.02.029","volume":"437","author":"P Chebolu","year":"2012","unstructured":"Chebolu, P., Goldberg, L.A., Martin, R.: The complexity of approximately counting stable matchings. Theor. Comput. Sci. 437, 35\u201368 (2012)","journal-title":"Theor. Comput. Sci."},{"issue":"5","key":"21_CR5","doi-asserted-by":"publisher","first-page":"1579","DOI":"10.1016\/j.jcss.2012.02.003","volume":"78","author":"P Chebolu","year":"2012","unstructured":"Chebolu, P., Goldberg, L.A., Martin, R.: The complexity of approximately counting stable roommate assignments. J. Comput. Syst. Sci. 78(5), 1579\u20131605 (2012)","journal-title":"J. Comput. Syst. Sci."},{"issue":"1","key":"21_CR6","doi-asserted-by":"publisher","first-page":"175","DOI":"10.1086\/498585","volume":"114","author":"E Choo","year":"2006","unstructured":"Choo, E., Siow, A.: Who marries whom and why. J. Polit. Econ. 114(1), 175\u2013201 (2006)","journal-title":"J. Polit. Econ."},{"key":"21_CR7","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-21275-3","volume-title":"Parameterized Algorithms","author":"M Cygan","year":"2015","unstructured":"Cygan, M., et al.: Parameterized Algorithms. Springer, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-21275-3"},{"key":"21_CR8","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4471-5559-1","volume-title":"Fundamentals of Parameterized Complexity","author":"RG Downey","year":"2013","unstructured":"Downey, R.G., Fellows, M.R.: Fundamentals of Parameterized Complexity. Springer, London (2013). https:\/\/doi.org\/10.1007\/978-1-4471-5559-1"},{"issue":"1","key":"21_CR9","doi-asserted-by":"publisher","first-page":"153","DOI":"10.3982\/ECTA10011","volume":"81","author":"F Echenique","year":"2013","unstructured":"Echenique, F., Lee, S., Shum, M., Yenmez, M.B.: The revealed preference theory of stable and extremal stable matchings. Econometrica 81(1), 153\u2013171 (2013)","journal-title":"Econometrica"},{"key":"21_CR10","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-29953-X","volume-title":"Parameterized Complexity Theory","author":"J Flum","year":"2006","unstructured":"Flum, J., Grohe, M.: Parameterized Complexity Theory. Springer, Heidelberg (2006). https:\/\/doi.org\/10.1007\/3-540-29953-X"},{"key":"21_CR11","doi-asserted-by":"publisher","first-page":"9","DOI":"10.1080\/00029890.1962.11989827","volume":"69","author":"D Gale","year":"1962","unstructured":"Gale, D., Shapley, L.: College admissions and the stability of marriage. Am. Math. Mon. 69, 9\u201315 (1962)","journal-title":"Am. Math. Mon."},{"key":"21_CR12","unstructured":"Gupta, S., Roy, S., Saurabh, S., Zehavi, M.: Balanced stable marriage: how close is close enough. Technical report 1707.09545, CoRR, Cornell University Library (2017)"},{"key":"21_CR13","unstructured":"Gupta, S., Saurabh, S., Zehavi, M.: On treewidth and stable marriage. Technical report 1707.05404, CoRR, Cornell University Library (2017)"},{"issue":"15","key":"21_CR14","doi-asserted-by":"publisher","first-page":"2959","DOI":"10.1016\/j.dam.2008.01.002","volume":"156","author":"R Irving","year":"2008","unstructured":"Irving, R., Manlove, D., Scott, S.: The stable marriage problem with master preference lists. Discret. Appl. Math. 156(15), 2959\u20132977 (2008)","journal-title":"Discret. Appl. Math."},{"key":"21_CR15","doi-asserted-by":"publisher","DOI":"10.1142\/8591","volume-title":"Algorithmics of Matching Under Preferences","author":"D Manlove","year":"2013","unstructured":"Manlove, D.: Algorithmics of Matching Under Preferences. World Scientific, Singapore (2013)"},{"issue":"1\u20132","key":"21_CR16","doi-asserted-by":"publisher","first-page":"261","DOI":"10.1016\/S0304-3975(01)00206-7","volume":"276","author":"D Manlove","year":"2002","unstructured":"Manlove, D., Irving, R., Iwama, K., Miyazaki, S., Morita, Y.: Hard variants of stable marriage. Theor. Comput. Sci. 276(1\u20132), 261\u2013279 (2002)","journal-title":"Theor. Comput. Sci."},{"issue":"1","key":"21_CR17","doi-asserted-by":"publisher","first-page":"170","DOI":"10.1007\/s00453-009-9326-z","volume":"58","author":"D Marx","year":"2010","unstructured":"Marx, D., Schlotter, I.: Parameterized complexity and local search approaches for the stable marriage problem with ties. Algorithmica 58(1), 170\u2013187 (2010)","journal-title":"Algorithmica"},{"key":"21_CR18","unstructured":"Meeks, K., Rastegari, B.: Solving hard stable matching problems involving groups of similar agents. Technical report 1708.04109, CoRR, Cornell University Library (2018)"},{"key":"21_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"320","DOI":"10.1007\/978-3-319-66700-3_25","volume-title":"Algorithmic Game Theory","author":"M Mnich","year":"2017","unstructured":"Mnich, M., Schlotter, I.: Stable marriage with covering constraints\u2013a complete computational trichotomy. In: Bil\u00f2, V., Flammini, M. (eds.) SAGT 2017. LNCS, vol. 10504, pp. 320\u2013332. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-66700-3_25"},{"key":"21_CR20","unstructured":"O\u2019Malley, G.: Algorithmic aspects of stable matching problems. Ph.D. thesis, Department of Computing Science, University of Glasgow (2007)"},{"key":"21_CR21","doi-asserted-by":"crossref","unstructured":"Orlin, J.B.: Max flows in $$\\cal{O}(nm)$$ time, or better. In: Proceedings of the 45th Annual ACM Symposium on Theory of Computing, STOC 2013, pp. 765\u2013774. ACM (2013)","DOI":"10.1145\/2488608.2488705"},{"key":"21_CR22","doi-asserted-by":"crossref","unstructured":"Shrot, T., Aumann, Y., Kraus, S.: On agent types in coalition formation problems. In: Proceedings of the 9th International Conference on Autonomous Agents and Multiagent Systems, AAMAS 2010, pp. 757\u2013764 (2010)","DOI":"10.65109\/LSSD4179"}],"container-title":["Lecture Notes in Computer Science","Web and Internet Economics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-04612-5_21","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,4,4]],"date-time":"2026-04-04T04:15:34Z","timestamp":1775276134000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-04612-5_21"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783030046118","9783030046125"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-04612-5_21","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018]]},"assertion":[{"value":"21 November 2018","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"WINE","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Web and Internet Economics","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Oxford","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"United Kingdom","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2018","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"15 December 2018","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17 December 2018","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"14","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"wine2018","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.cs.ox.ac.uk\/conferences\/wine2018\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Easy Chiar","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"119","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"28","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"8","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"24% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"10","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}