{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,2]],"date-time":"2025-11-02T16:37:16Z","timestamp":1762101436026,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":32,"publisher":"ACM","license":[{"start":{"date-parts":[[2013,6,16]],"date-time":"2013-06-16T00:00:00Z","timestamp":1371340800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2013,6,16]]},"DOI":"10.1145\/2492002.2482607","type":"proceedings-article","created":{"date-parts":[[2013,6,11]],"date-time":"2013-06-11T16:03:50Z","timestamp":1370966630000},"page":"733-750","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":10,"title":["Two-sided matching with partial information"],"prefix":"10.1145","author":[{"given":"Baharak","family":"Rastegari","sequence":"first","affiliation":[{"name":"University of British Columbia, Vancouver, BC, Canada"}],"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":"Northwestern University, Evanston, IL, USA"}],"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":[[2013,6,16]]},"reference":[{"key":"e_1_3_2_1_1_1","unstructured":"Abdulkadiroglu A. and Smez T. 2003. School choice: A mechanism design approach. Discussion papers Columbia University Department of Economics. Abdulkadiroglu A. and Smez T. 2003. School choice: A mechanism design approach. Discussion papers Columbia University Department of Economics."},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/1993574.1993628"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/1160633.1160782"},{"key":"e_1_3_2_1_4_1","first-page":"218","article-title":"When lp is the cure for your matching woes: Improved bounds for stochastic matchings","volume":"2010","author":"Bansal N.","year":"2010","unstructured":"Bansal , N. , Gupta , A. , Li , J. , Mestre , J. , Nagarajan , V. , and Rudra , A. 2010 . When lp is the cure for your matching woes: Improved bounds for stochastic matchings . Algorithms--ESA 2010 , 218 -- 229 . Bansal, N., Gupta, A., Li, J., Mestre, J., Nagarajan, V., and Rudra, A. 2010. When lp is the cure for your matching woes: Improved bounds for stochastic matchings. Algorithms--ESA 2010, 218--229.","journal-title":"Algorithms--ESA"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1080\/00029890.1981.11995301"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.3982\/ECTA10011"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1080\/00029890.1962.11989827"},{"key":"e_1_3_2_1_8_1","volume-title":"SAT","author":"Gent I. P.","year":"2002","unstructured":"Gent , I. P. , Prosser , P. , Smith , B. , and Walsh , T . 2002. SAT encodings of the stable marriage problem with ties and incomplete lists . In SAT 2002 . 133--140. Gent, I. P., Prosser, P., Smith, B., and Walsh, T. 2002. SAT encodings of the stable marriage problem with ties and incomplete lists. In SAT 2002. 133--140."},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1137\/0216010"},{"key":"e_1_3_2_1_10_1","unstructured":"Haeringer G. and Iehle V. 2012. Two-sided matching with one-sided information. Haeringer G. and Iehle V. 2012. Two-sided matching with one-sided information."},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/1993574.1993629"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1016\/0166-218X(92)00179-P"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1137\/0215048"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/28869.28871"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1006\/jagm.2002.1219"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"crossref","unstructured":"Irving R. W. Manlove D. F. and Scott S. 2000. The hospitals\/residents problem with ties. In SWAT. 259--271. Irving R. W. Manlove D. F. and Scott S. 2000. The hospitals\/residents problem with ties. In SWAT. 259--271.","DOI":"10.1007\/3-540-44985-X_24"},{"key":"e_1_3_2_1_17_1","volume-title":"Proceedings of STACS 2003: the 20th International Symposium on Theoretical Aspects of Computer Science, H. Alt and M. Habib, Eds. Lecture Notes in Computer Science Series","volume":"2607","author":"Irving R. W.","unstructured":"Irving , R. W. , Manlove , D. F. , and Scott , S . 2003. Strong stability in the hospitals\/residents problem . In Proceedings of STACS 2003: the 20th International Symposium on Theoretical Aspects of Computer Science, 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 Proceedings of STACS 2003: the 20th International Symposium on Theoretical Aspects of Computer Science, 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_18_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.dam.2008.01.002"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"crossref","unstructured":"Karp R. M. 1972. Reducibility among combinatorial problems. In Complexity of Computer Computations. 85--103. Karp R. M. 1972. Reducibility among combinatorial problems. In Complexity of Computer Computations. 85--103.","DOI":"10.1007\/978-1-4684-2001-2_9"},{"key":"e_1_3_2_1_20_1","volume-title":"CRM proceedings & lecture notes. American Mathematical Society.","author":"Knuth D.","year":"1997","unstructured":"Knuth , D. 1997 . Stable marriage and its relation to other combinatorial problems: an introduction to the mathematical analysis of algorithms . CRM proceedings & lecture notes. American Mathematical Society. Knuth, D. 1997. Stable marriage and its relation to other combinatorial problems: an introduction to the mathematical analysis of algorithms. CRM proceedings & lecture notes. American Mathematical Society."},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"crossref","unstructured":"Lee R. and Schwarz M. 2009. Interviewing in two-sided matching markets. NBER Working Paper No. 14922. Lee R. and Schwarz M. 2009. Interviewing in two-sided matching markets. NBER Working Paper No. 14922.","DOI":"10.3386\/w14922"},{"volume-title":"Stable marriage with ties and unacceptable partners. Tech. rep","author":"Manlove D. F.","key":"e_1_3_2_1_22_1","unstructured":"Manlove , D. F. 1999. Stable marriage with ties and unacceptable partners. Tech. rep ., University of Glasgow , Department of Computing Science. Manlove, D. F. 1999. Stable marriage with ties and unacceptable partners. Tech. rep., University of Glasgow, Department of Computing Science."},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0166-218X(01)00322-5"},{"key":"e_1_3_2_1_24_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_25_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00453-010-9415-z"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0304-3975(01)00206-7"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.3982\/TE816"},{"volume-title":"Markov Decision Processes: Discrete Stochastic Dynamic Programming","author":"Puterman M.","key":"e_1_3_2_1_28_1","unstructured":"Puterman , M. 1994. Markov Decision Processes: Discrete Stochastic Dynamic Programming . John Wiley and Sons , New York . Puterman, M. 1994. Markov Decision Processes: Discrete Stochastic Dynamic Programming. John Wiley and Sons, New York."},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"crossref","unstructured":"Puterman M. and Patrick J. 2010. Encyclopedia of Machine Learning. Chapter Dynamic programming. Puterman M. and Patrick J. 2010. Encyclopedia of Machine Learning. Chapter Dynamic programming.","DOI":"10.1007\/978-0-387-30164-8_237"},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1287\/moor.7.4.617"},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1001\/jama.275.13.1054"},{"key":"e_1_3_2_1_32_1","unstructured":"Roth A. and Sotomayor M. 1992. Two-Sided Matching: A Study in Game-Theoretic Modeling and Analysis. Cambridge University Press. Roth A. and Sotomayor M. 1992. Two-Sided Matching: A Study in Game-Theoretic Modeling and Analysis. Cambridge University Press."}],"event":{"name":"EC '13: ACM Conference on Electronic Commerce","sponsor":["SIGecom Special Interest Group on Economics and Computation"],"location":"Philadelphia Pennsylvania USA","acronym":"EC '13"},"container-title":["Proceedings of the fourteenth ACM conference on Electronic commerce"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2492002.2482607","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2492002.2482607","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T08:39:11Z","timestamp":1750235951000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2492002.2482607"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,6,16]]},"references-count":32,"alternative-id":["10.1145\/2492002.2482607","10.1145\/2492002"],"URL":"https:\/\/doi.org\/10.1145\/2492002.2482607","relation":{},"subject":[],"published":{"date-parts":[[2013,6,16]]},"assertion":[{"value":"2013-06-16","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}