{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T11:01:34Z","timestamp":1742986894978,"version":"3.40.3"},"publisher-location":"Cham","reference-count":22,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030038397"},{"type":"electronic","value":"9783030038403"}],"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-03840-3_16","type":"book-chapter","created":{"date-parts":[[2018,11,8]],"date-time":"2018-11-08T01:28:57Z","timestamp":1541640537000},"page":"210-224","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Compact Preference Representation via Fuzzy Constraints in Stable Matching Problems: Theoretical and Experimental Studies"],"prefix":"10.1007","author":[{"given":"Maria Silvia","family":"Pini","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Francesca","family":"Rossi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kristen Brent","family":"Venable","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2018,11,9]]},"reference":[{"key":"16_CR1","unstructured":"Abdulkadiroglu: Generalized matching for school choice. Working paper, Duke University (2011)"},{"key":"16_CR2","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-642-03251-6_1","volume-title":"Recent Advances in Constraints","author":"S Bistarelli","year":"2009","unstructured":"Bistarelli, S., Foley, S., O\u2019Sullivan, B., Santini, F.: From marriages to coalitions: a soft CSP approach. In: Oddi, A., Fages, F., Rossi, F. (eds.) CSCLP 2008. LNCS (LNAI), vol. 5655, pp. 1\u201315. Springer, Heidelberg (2009). \nhttps:\/\/doi.org\/10.1007\/978-3-642-03251-6_1"},{"issue":"1\u20132","key":"16_CR3","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/S0304-3975(97)00228-4","volume":"209","author":"HL Bodlaender","year":"1998","unstructured":"Bodlaender, H.L.: A partial k-arboretum of graphs with bounded treewidth. Theor. Comput. Sci. 209(1\u20132), 1\u201345 (1998)","journal-title":"Theor. Comput. Sci."},{"key":"16_CR4","doi-asserted-by":"publisher","first-page":"135","DOI":"10.1613\/jair.1234","volume":"21","author":"C Boutilier","year":"2004","unstructured":"Boutilier, C., Brafman, R.I., Domshlak, C., Hoos, H.H., Poole, D.: CP-nets: a tool for representing and reasoning with conditional ceteris paribus preference statements. JAIR 21, 135\u2013191 (2004)","journal-title":"JAIR"},{"key":"16_CR5","unstructured":"Brafman, R.I., Rossi, F., Salvagnin, D., Venable, K.B., Walsh, T.: Finding the next solution in constraint- and preference-based knowledge representation formalisms. In: Proceedings of KR 2010 (2010)"},{"key":"16_CR6","volume-title":"Handbook of Constraint Programming","author":"R Dechter","year":"2005","unstructured":"Dechter, R.: Tractable structures for CSPs. In: Rossi, F., Van Beek, P., Walsh, T. (eds.) Handbook of Constraint Programming. Elsevier, Amsterdam (2005)"},{"key":"16_CR7","unstructured":"Dechter, R., Flerova, N., Marinescu, R.: Search algorithms for M best solutions for graphical models. In: Proceedings of AAAI 2012. AAAI Press (2012)"},{"key":"16_CR8","volume-title":"Constraint Processing","author":"R Dechter","year":"2003","unstructured":"Dechter, R.: Constraint Processing. Morgan Kaufmann, Burlington (2003)"},{"key":"16_CR9","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. Amer. Math. Monthly 69, 9\u201314 (1962)","journal-title":"Amer. Math. Monthly"},{"key":"16_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"225","DOI":"10.1007\/3-540-45578-7_16","volume-title":"Principles and Practice of Constraint Programming \u2014 CP 2001","author":"IP Gent","year":"2001","unstructured":"Gent, I.P., Irving, R.W., Manlove, D.F., Prosser, P., Smith, B.M.: A constraint programming approach to the stable marriage problem. In: Walsh, T. (ed.) CP 2001. LNCS, vol. 2239, pp. 225\u2013239. Springer, Heidelberg (2001). \nhttps:\/\/doi.org\/10.1007\/3-540-45578-7_16"},{"key":"16_CR11","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. MIT Press, Boston (1989)"},{"key":"16_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"443","DOI":"10.1007\/3-540-48523-6_41","volume-title":"Automata, Languages and Programming","author":"K Iwama","year":"1999","unstructured":"Iwama, K., Miyazaki, S., Morita, Y., Manlove, D.: Stable marriage with incomplete lists and ties. In: Wiedermann, J., van Emde Boas, P., Nielsen, M. (eds.) ICALP 1999. LNCS, vol. 1644, pp. 443\u2013452. Springer, Heidelberg (1999). \nhttps:\/\/doi.org\/10.1007\/3-540-48523-6_41"},{"key":"16_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"155","DOI":"10.1007\/978-3-540-72397-4_12","volume-title":"Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems","author":"DF Manlove","year":"2007","unstructured":"Manlove, D.F., O\u2019Malley, G., Prosser, P., Unsworth, C.: A constraint programming approach to the hospitals\/residents problem. In: Van Hentenryck, P., Wolsey, L. (eds.) CPAIOR 2007. LNCS, vol. 4510, pp. 155\u2013170. Springer, Heidelberg (2007). \nhttps:\/\/doi.org\/10.1007\/978-3-540-72397-4_12"},{"key":"16_CR14","doi-asserted-by":"publisher","DOI":"10.1142\/8591","volume-title":"Algorithmics of Matching Under Preferences","author":"DF Manlove","year":"2013","unstructured":"Manlove, D.F.: Algorithmics of Matching Under Preferences. World Scientific Publishing, Singapore (2013)"},{"key":"16_CR15","volume-title":"Handbook of Constraint Programming","author":"P Meseguer","year":"2005","unstructured":"Meseguer, P., Rossi, F., Schiex, T.: Soft constraints. In: Rossi, F., Van Beek, P., Walsh, T. (eds.) Handbook of Constraint Programming. Elsevier, Amsterdam (2005)"},{"key":"16_CR16","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"390","DOI":"10.1007\/978-3-642-04428-1_34","volume-title":"Algorithmic Decision Theory","author":"E Pilotto","year":"2009","unstructured":"Pilotto, E., Rossi, F., Venable, K.B., Walsh, T.: Compact preference representation in stable marriage problems. In: Rossi, F., Tsoukias, A. (eds.) ADT 2009. LNCS (LNAI), vol. 5783, pp. 390\u2013401. Springer, Heidelberg (2009). \nhttps:\/\/doi.org\/10.1007\/978-3-642-04428-1_34"},{"key":"16_CR17","unstructured":"Pini, M.S., Rossi, F., Venable, K.B.: Stable matching problems with soft constraints. In: Proceedings of AAMAS 2014 - Extended Abstract, pp. 1511\u20131512 (2014)"},{"key":"16_CR18","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"333","DOI":"10.1007\/978-3-319-67504-6_23","volume-title":"Algorithmic Decision Theory","author":"MS Pini","year":"2017","unstructured":"Pini, M.S., Rossi, F., Venable, K.B.: Compact preference representation via fuzzy constraints in stable matching problems. In: Rothe, J. (ed.) ADT 2017. LNCS (LNAI), vol. 10576, pp. 333\u2013338. Springer, Cham (2017). \nhttps:\/\/doi.org\/10.1007\/978-3-319-67504-6_23"},{"key":"16_CR19","doi-asserted-by":"publisher","first-page":"183","DOI":"10.1007\/s10458-010-9121-x","volume":"22","author":"MS Pini","year":"2011","unstructured":"Pini, M.S., Rossi, F., Venable, K.B., Walsh, T.: Manipulation complexity and gender neutrality in stable marriage procedures. Autonomous Agents and Multi-Agent Systems 22, 183\u2013199 (2011)","journal-title":"Autonomous Agents and Multi-Agent Systems"},{"key":"16_CR20","doi-asserted-by":"publisher","first-page":"782","DOI":"10.3390\/a6040782","volume":"6","author":"MS Pini","year":"2013","unstructured":"Pini, M.S., Rossi, F., Venable, K.B., Walsh, T.: Stability, optimality and manipulation in matching problems with weighted preferences. Algorithms 6, 782\u2013804 (2013)","journal-title":"Algorithms"},{"key":"16_CR21","doi-asserted-by":"publisher","first-page":"991","DOI":"10.1086\/261272","volume":"92","author":"AE Roth","year":"1984","unstructured":"Roth, A.E.: The evolution of the labor market for medical interns and residents: a case study in game theory. J. Polit. Econ. 92, 991\u20131016 (1984)","journal-title":"J. Polit. Econ."},{"issue":"9","key":"16_CR22","doi-asserted-by":"publisher","first-page":"1252","DOI":"10.1287\/mnsc.47.9.1252.9784","volume":"47","author":"C-P Teo","year":"2001","unstructured":"Teo, C.-P., Sethuraman, J., Tan, W.-P.: Gale-shapley stable marriage problem revisited: strategic issues and applications. Manag. Sci. 47(9), 1252\u20131267 (2001)","journal-title":"Manag. Sci."}],"container-title":["Lecture Notes in Computer Science","AI*IA 2018 \u2013 Advances in Artificial Intelligence"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-03840-3_16","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,1,9]],"date-time":"2019-01-09T11:31:17Z","timestamp":1547033477000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-03840-3_16"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783030038397","9783030038403"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-03840-3_16","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2018]]},"assertion":[{"value":"AI*IA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference of the Italian Association for Artificial Intelligence","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Trento","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Italy","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":"20 November 2018","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"23 November 2018","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"aiia2018","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/aixia2018.fbk.eu\/index.php\/home\/","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"}},{"value":"Easychair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"210","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"41","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"20% - 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"}},{"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"}},{"value":"2,5","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}}]}}