{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,4]],"date-time":"2026-04-04T04:59:55Z","timestamp":1775278795304,"version":"3.50.1"},"publisher-location":"Cham","reference-count":21,"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_23","type":"book-chapter","created":{"date-parts":[[2018,11,20]],"date-time":"2018-11-20T10:09:45Z","timestamp":1542708585000},"page":"341-355","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["Robust and Approximately Stable Marriages Under Partial Information"],"prefix":"10.1007","author":[{"given":"Vijay","family":"Menon","sequence":"first","affiliation":[]},{"given":"Kate","family":"Larson","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2018,11,21]]},"reference":[{"key":"23_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/11671411_1","volume-title":"Approximation and Online Algorithms","author":"DJ Abraham","year":"2006","unstructured":"Abraham, D.J., Bir\u00f3, P., Manlove, D.F.: \u201cAlmost stable\u201d matchings in the roommates problem. In: Erlebach, T., Persinao, G. (eds.) WAOA 2005. LNCS, vol. 3879, pp. 1\u201314. Springer, Heidelberg (2006). https:\/\/doi.org\/10.1007\/11671411_1"},{"key":"23_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"195","DOI":"10.1007\/978-3-662-53354-3_16","volume-title":"Algorithmic Game Theory","author":"H Aziz","year":"2016","unstructured":"Aziz, H., Bir\u00f3, P., Gaspers, S., de Haan, R., Mattei, N., Rastegari, B.: Stable matching with uncertain linear\u00a0preferences. In: Gairing, M., Savani, R. (eds.) SAGT 2016. LNCS, vol. 9928, pp. 195\u2013206. Springer, Heidelberg (2016). https:\/\/doi.org\/10.1007\/978-3-662-53354-3_16"},{"key":"23_CR3","doi-asserted-by":"crossref","unstructured":"Baumeister, D., Faliszewski, P., Lang, J., Rothe, J.: Campaigns for lazy voters: truncated ballots. In: Proceedings of the Eleventh International Conference on Autonomous Agents and Multiagent Systems (AAMAS), pp. 577\u2013584 (2012)","DOI":"10.65109\/DWLY5169"},{"issue":"16\u201318","key":"23_CR4","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(16\u201318), 1828\u20131841 (2010)","journal-title":"Theor. Comput. Sci."},{"key":"23_CR5","doi-asserted-by":"crossref","unstructured":"Chiesa, A., Micali, S., Allen Zhu, Z.: Mechanism design with approximate valuations. In: Proceedings of the Third Innovations in Theoretical Computer Science (ITCS), pp. 34\u201338 (2012)","DOI":"10.1145\/2090236.2090240"},{"key":"23_CR6","unstructured":"Drummond, J., Boutilier, C.: Elicitation and approximately stable matching with partial preferences. In: Proceedings of the Twenty-Third International Joint Conference on Artificial Intelligence (IJCAI), pp. 97\u2013105 (2013)"},{"key":"23_CR7","doi-asserted-by":"crossref","unstructured":"Drummond, J., Boutilier, C.: Preference elicitation and interview minimization in stable matchings. In: Proceedings of the Twenty-Eighth AAAI Conference on Artificial Intelligence (AAAI), pp. 645\u2013653 (2014)","DOI":"10.1609\/aaai.v28i1.8829"},{"issue":"1","key":"23_CR8","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.S.: College admissions and the stability of marriage. Am. Math. Mon. 69(1), 9\u201315 (1962)","journal-title":"Am. Math. Mon."},{"key":"23_CR9","series-title":"Foundations of Computing Series","volume-title":"The Stable Marriage Problem - Structure and Algorithms","author":"D Gusfield","year":"1989","unstructured":"Gusfield, D., Irving, R.W.: The Stable Marriage Problem - Structure and Algorithms. Foundations of Computing Series. MIT Press, Cambridge (1989)"},{"key":"23_CR10","unstructured":"Hyafil, N., Boutilier, C.: Regret minimizing equilibria and mechanisms for games with strict type uncertainty. In: Proceedings of the Twentieth Conference on Uncertainty in Artificial Intelligence (UAI), pp. 268\u2013277 (2004)"},{"issue":"4","key":"23_CR11","doi-asserted-by":"publisher","first-page":"577","DOI":"10.1016\/0196-6774(85)90033-1","volume":"6","author":"RW Irving","year":"1985","unstructured":"Irving, R.W.: An efficient algorithm for the stable roommates problem. J. Algorithms 6(4), 577\u2013595 (1985)","journal-title":"J. Algorithms"},{"issue":"3","key":"23_CR12","doi-asserted-by":"publisher","first-page":"261","DOI":"10.1016\/0166-218X(92)00179-P","volume":"48","author":"RW Irving","year":"1994","unstructured":"Irving, R.W.: Stable marriage and indifference. Discrete Appl. Math. 48(3), 261\u2013272 (1994)","journal-title":"Discrete Appl. Math."},{"issue":"3","key":"23_CR13","doi-asserted-by":"publisher","first-page":"279","DOI":"10.1007\/s10878-007-9133-x","volume":"16","author":"RW Irving","year":"2008","unstructured":"Irving, R.W., Manlove, D.: Approximation algorithms for hard variants of the stable marriage and hospitals\/residents problems. J. Comb. Optim. 16(3), 279\u2013292 (2008)","journal-title":"J. Comb. Optim."},{"key":"23_CR14","series-title":"The IBM Research Symposia Series","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1007\/978-1-4684-2001-2_9","volume-title":"Complexity of Computer Computations","author":"RM Karp","year":"1972","unstructured":"Karp, R.M.: Reducibility among combinatorial problems. In: Miller, R.E., Thatcher, J.W., Bohlinger, J.D. (eds.) Complexity of Computer Computations. The IBM Research Symposia Series, pp. 85\u2013103. Springer, Boston (1972). https:\/\/doi.org\/10.1007\/978-1-4684-2001-2_9"},{"key":"23_CR15","unstructured":"Lu, T., Boutilier, C.: Robust approximation and incremental elicitation in voting protocols. In: Proceedings of the Twenty-Second International Joint Conference on Artificial Intelligence (IJCAI), pp. 287\u2013293 (2011)"},{"issue":"1\u20132","key":"23_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.W., 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."},{"key":"23_CR17","doi-asserted-by":"crossref","unstructured":"Manlove, D.F.: Algorithmics of Matching Under Preferences. Series on Theoretical Computer Science, vol. 2. WorldScientific (2013)","DOI":"10.1142\/8591"},{"key":"23_CR18","doi-asserted-by":"publisher","first-page":"926","DOI":"10.1007\/978-3-642-27848-8","volume-title":"Encyclopedia of Algorithms","author":"DF Manlove","year":"2016","unstructured":"Manlove, D.F.: Hospitals\/residents problem. In: Kao, M.Y. (ed.) Encyclopedia of Algorithms, pp. 926\u2013930. Springer, Heidelberg (2016). https:\/\/doi.org\/10.1007\/978-3-642-27848-8"},{"key":"23_CR19","doi-asserted-by":"crossref","unstructured":"Rastegari, B., Condon, A., Immorlica, N., Irving, R., Leyton-Brown, K.: Reasoning about optimal stable matchings under partial information. In: Proceedings of the Fifteenth ACM Conference on Economics and Computation (EC), pp. 431\u2013448 (2014)","DOI":"10.1145\/2600057.2602884"},{"key":"23_CR20","doi-asserted-by":"crossref","unstructured":"Rastegari, B., Condon, A., Immorlica, N., Leyton-Brown, K.: Two-sided matching with partial information. In: Proceedings of the Fourteenth ACM Conference on Electronic Commerce (EC), pp. 733\u2013750 (2013)","DOI":"10.1145\/2492002.2482607"},{"issue":"4","key":"23_CR21","doi-asserted-by":"publisher","first-page":"631","DOI":"10.1007\/BF01933211","volume":"30","author":"JJM Tan","year":"1990","unstructured":"Tan, J.J.M.: A maximum stable matching for the roommates problem. BIT Num. Math. 30(4), 631\u2013640 (1990)","journal-title":"BIT Num. Math."}],"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_23","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,4,4]],"date-time":"2026-04-04T04:15:33Z","timestamp":1775276133000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-04612-5_23"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783030046118","9783030046125"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-04612-5_23","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)"}}]}}