{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,2]],"date-time":"2025-11-02T16:45:09Z","timestamp":1762101909671,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783662533536"},{"type":"electronic","value":"9783662533543"}],"license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"content-version":"unspecified","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":[[2016]]},"DOI":"10.1007\/978-3-662-53354-3_16","type":"book-chapter","created":{"date-parts":[[2016,9,3]],"date-time":"2016-09-03T22:43:34Z","timestamp":1472942614000},"page":"195-206","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":9,"title":["Stable Matching with Uncertain Linear\u00a0Preferences"],"prefix":"10.1007","author":[{"given":"Haris","family":"Aziz","sequence":"first","affiliation":[]},{"given":"P\u00e9ter","family":"Bir\u00f3","sequence":"additional","affiliation":[]},{"given":"Serge","family":"Gaspers","sequence":"additional","affiliation":[]},{"given":"Ronald","family":"de Haan","sequence":"additional","affiliation":[]},{"given":"Nicholas","family":"Mattei","sequence":"additional","affiliation":[]},{"given":"Baharak","family":"Rastegari","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2016,9,1]]},"reference":[{"key":"16_CR1","unstructured":"Aziz, H., Bir\u00f3, P., Gaspers, S., de Haan, R., Mattei, N., Rastegari, B.: Stable matching with uncertain linear preferences. Technical Report 1607.02917, Cornell University Library. http:\/\/arxiv.org\/abs\/1607.02917"},{"key":"16_CR2","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, pp. 645\u2013653 (2014)","DOI":"10.1609\/aaai.v28i1.8829"},{"key":"16_CR3","doi-asserted-by":"publisher","first-page":"295","DOI":"10.1016\/j.jet.2015.01.008","volume":"157","author":"L Ehlers","year":"2015","unstructured":"Ehlers, L., Mass\u00f3, J.: Matching markets under (in)complete information. J. Econ. Theor. 157, 295\u2013314 (2015)","journal-title":"J. Econ. Theor."},{"key":"16_CR4","volume-title":"The Stable Marriage Problem: Structure and Algorithms","author":"D Gusfield","year":"1989","unstructured":"Gusfield, D., Irving, R.: The Stable Marriage Problem: Structure and Algorithms. MIT Press, Cambridge (1989)"},{"issue":"3","key":"16_CR5","doi-asserted-by":"publisher","first-page":"30","DOI":"10.1145\/1273340.1273346","volume":"3","author":"MM Halld\u00f3rsson","year":"2007","unstructured":"Halld\u00f3rsson, M.M., Iwama, K., Miyazaki, S., Yanagisawa, H.: Improved approximation results for the stable marriage problem. ACM Trans. Algorithms 3(3), 30 (2007)","journal-title":"ACM Trans. Algorithms"},{"key":"16_CR6","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.artint.2012.04.009","volume":"189","author":"N Hazon","year":"2012","unstructured":"Hazon, N., Aumann, Y., Kraus, S., Wooldridge, M.: On the evaluation of electionoutcomes under uncertainty. Artif. Intell. 189, 1\u201318 (2012)","journal-title":"Artif. Intell."},{"key":"16_CR7","doi-asserted-by":"publisher","first-page":"261","DOI":"10.1016\/0166-218X(92)00179-P","volume":"48","author":"R Irving","year":"1994","unstructured":"Irving, R.: Stable marriage and indifference. Discrete Appl. Math. 48, 261\u2013272 (1994)","journal-title":"Discrete Appl. Math."},{"key":"16_CR8","doi-asserted-by":"crossref","unstructured":"Li, Y., Conitzer, V.: Cooperative game solution concepts that maximize stability under noise. In: AAAI, pp. 979\u2013985 (2015)","DOI":"10.1609\/aaai.v29i1.9300"},{"key":"16_CR9","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 Publishing Company, Hackensack (2013)"},{"key":"16_CR10","doi-asserted-by":"crossref","unstructured":"Rastegari, B., Condon, A., Immorlica, N., Irving, R., Leyton-Brown, K.: Reasoning about optimal stable matching under partial information. In: Proceedings of the ACM Conference on Electronic Commerce (EC), pp. 431\u2013448. ACM (2014)","DOI":"10.1145\/2600057.2602884"},{"key":"16_CR11","doi-asserted-by":"publisher","DOI":"10.1017\/CCOL052139015X","volume-title":"Two-Sided Matching: A Study in Game Theoretic Modelling and Analysis","author":"AE Roth","year":"1990","unstructured":"Roth, A.E., Sotomayor, M.A.O.: Two-Sided Matching: A Study in Game Theoretic Modelling and Analysis. Cambridge University Press, Cambridge (1990)"},{"issue":"3","key":"16_CR12","doi-asserted-by":"publisher","first-page":"1127","DOI":"10.1063\/1.533181","volume":"41","author":"DJA Welsh","year":"2000","unstructured":"Welsh, D.J.A., Merino, C.: The Potts model and the Tutte polynomial. J. Math. Phys. 41(3), 1127\u20131152 (2000)","journal-title":"J. Math. Phys."}],"container-title":["Lecture Notes in Computer Science","Algorithmic Game Theory"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-662-53354-3_16","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,7,7]],"date-time":"2022-07-07T18:50:16Z","timestamp":1657219816000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-662-53354-3_16"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783662533536","9783662533543"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/978-3-662-53354-3_16","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2016]]},"assertion":[{"value":"1 September 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"SAGT","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Symposium on Algorithmic Game Theory","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Liverpool","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":"2016","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"19 September 2016","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"21 September 2016","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"9","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"sagt2016","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}