{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,10]],"date-time":"2026-02-10T01:56:09Z","timestamp":1770688569409,"version":"3.49.0"},"publisher-location":"New York, NY, USA","reference-count":17,"publisher":"ACM","license":[{"start":{"date-parts":[[2014,6,1]],"date-time":"2014-06-01T00:00:00Z","timestamp":1401580800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/501100000038","name":"Natural Sciences and Engineering Research Council of Canada","doi-asserted-by":"publisher","award":["EP\/K01000X\/1 and EP\/K010042\/1"],"award-info":[{"award-number":["EP\/K01000X\/1 and EP\/K010042\/1"]}],"id":[{"id":"10.13039\/501100000038","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2014,6]]},"DOI":"10.1145\/2600057.2602884","type":"proceedings-article","created":{"date-parts":[[2014,5,30]],"date-time":"2014-05-30T18:18:31Z","timestamp":1401473911000},"page":"431-448","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":8,"title":["Reasoning about optimal stable matchings under partial information"],"prefix":"10.1145","author":[{"given":"Baharak","family":"Rastegari","sequence":"first","affiliation":[{"name":"University of Glasgow, Glasgow, United Kingdom"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Anne","family":"Condon","sequence":"additional","affiliation":[{"name":"University of British Columbia, Vancouver, BC, Canada"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Nicole","family":"Immorlica","sequence":"additional","affiliation":[{"name":"Microsoft, Cambridge, MA, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Robert","family":"Irving","sequence":"additional","affiliation":[{"name":"University of Glasgow, Glasgow, United Kingdom"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kevin","family":"Leyton-Brown","sequence":"additional","affiliation":[{"name":"University of British Columbia, Vancouver, BC, Canada"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2014,6]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1080\/00029890.1962.11989827"},{"key":"e_1_3_2_1_2_1","volume-title":"The stable marriage problem: structure and algorithms","author":"GUSFIELD D.","unstructured":"GUSFIELD , D. AND IRVING , R. W. 1989. The stable marriage problem: structure and algorithms . MIT Press , Cambridge, MA, USA . GUSFIELD, D. AND IRVING, R. W. 1989. The stable marriage problem: structure and algorithms. MIT Press, Cambridge, MA, USA."},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/1498698.1537595"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1016\/0166-218X(92)00179-P"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.dam.2008.01.002"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.5555\/645900.672609"},{"key":"e_1_3_2_1_7_1","series-title":"Lecture Notes in Computer Science Series","volume-title":"Strong stability in the hospitals\/residents problem","author":"IRVING R. W.","unstructured":"IRVING , R. W. , MANLOVE , D. F. , AND SCOTT , S. 2003. Strong stability in the hospitals\/residents problem . In STACS, H. Alt and M. Habib, Eds. Lecture Notes in Computer Science Series , vol. 2607 . Springer-Verlag GmbH , 439--450. IRVING, R. W., MANLOVE, D. F., AND SCOTT, S. 2003. Strong stability in the hospitals\/residents problem. In STACS, H. Alt and M. Habib, Eds. Lecture Notes in Computer Science Series, vol. 2607. Springer-Verlag GmbH, 439--450."},{"key":"e_1_3_2_1_8_1","volume-title":"Mariages Stables","author":"KNUTH D.","unstructured":"KNUTH , D. 1976. Mariages Stables . Montr\u00e9al : Les Presses de l'Universit\u00e9 de Montr\u00e9al. KNUTH, D. 1976. Mariages Stables. Montr\u00e9al: Les Presses de l'Universit\u00e9 de Montr\u00e9al."},{"key":"e_1_3_2_1_9_1","volume-title":"Multidisciplinary Workshop on Advances in Preference Handling.","author":"KONCZAK K.","year":"2005","unstructured":"KONCZAK , K. AND LANG , J. 2005 . Voting procedures with incomplete preferences . Multidisciplinary Workshop on Advances in Preference Handling. KONCZAK, K. AND LANG, J. 2005. Voting procedures with incomplete preferences. Multidisciplinary Workshop on Advances in Preference Handling."},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0166-218X(01)00322-5"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"crossref","unstructured":"MANLOVE D. F. 2013. Algorithmics of matching under preferences. World Scientific.  MANLOVE D. F. 2013. Algorithmics of matching under preferences. World Scientific.","DOI":"10.1142\/8591"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0304-3975(01)00206-7"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/2492002.2482607"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1287\/moor.7.4.617"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1001\/jama.275.13.1054"},{"key":"e_1_3_2_1_17_1","volume-title":"Two-Sided Matching: A Study in Game-Theoretic Modeling and Analysis","author":"ROTH A.","unstructured":"ROTH , A. AND SOTOMAYOR , M. 1990. Two-Sided Matching: A Study in Game-Theoretic Modeling and Analysis . Cambridge University Press . ROTH, A. AND SOTOMAYOR, M. 1990. Two-Sided Matching: A Study in Game-Theoretic Modeling and Analysis. Cambridge University Press."},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"crossref","unstructured":"XIA L. AND CONITZER V. 2011. Determining possible and necessary winners under common  XIA L. AND CONITZER V. 2011. Determining possible and necessary winners under common","DOI":"10.1613\/jair.3186"}],"event":{"name":"EC '14: ACM Conference on Economics and Computation","location":"Palo Alto California USA","acronym":"EC '14","sponsor":["SIGecom Special Interest Group on Economics and Computation"]},"container-title":["Proceedings of the fifteenth ACM conference on Economics and computation"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2600057.2602884","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2600057.2602884","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T07:01:21Z","timestamp":1750230081000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2600057.2602884"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,6]]},"references-count":17,"alternative-id":["10.1145\/2600057.2602884","10.1145\/2600057"],"URL":"https:\/\/doi.org\/10.1145\/2600057.2602884","relation":{},"subject":[],"published":{"date-parts":[[2014,6]]},"assertion":[{"value":"2014-06-01","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}