{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T16:53:59Z","timestamp":1743008039094,"version":"3.40.3"},"publisher-location":"Cham","reference-count":18,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030192112"},{"type":"electronic","value":"9783030192129"}],"license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"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":[[2019]]},"DOI":"10.1007\/978-3-030-19212-9_21","type":"book-chapter","created":{"date-parts":[[2019,5,20]],"date-time":"2019-05-20T10:32:32Z","timestamp":1558348352000},"page":"320-336","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["An Approach to Robustness in the Stable Roommates Problem and Its Comparison with the Stable Marriage Problem"],"prefix":"10.1007","author":[{"given":"Begum","family":"Genc","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mohamed","family":"Siala","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Gilles","family":"Simonin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Barry","family":"O\u2019Sullivan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2019,4,28]]},"reference":[{"key":"21_CR1","unstructured":"Ashlagi, I., Gonczarowski, Y.A.: Dating strategies are not obvious. CoRR abs\/1511.00452 (2015)"},{"key":"21_CR2","doi-asserted-by":"crossref","unstructured":"Aziz, H., Bir\u00f3, P., Gaspers, S., de Haan, R., Mattei, N., Rastegari., B.: Stable matching with uncertain linear preferences. CoRR abs\/1607.02917 (2016)","DOI":"10.1007\/978-3-662-53354-3_16"},{"key":"21_CR3","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 2013, pp. 97\u2013105. AAAI Press (2013)"},{"key":"21_CR4","doi-asserted-by":"crossref","unstructured":"Genc, B., Siala, M., O\u2019Sullivan, B., Simonin, G.: Finding robust solutions to stable marriage. In: Proceedings of the Twenty-Sixth International Joint Conference on Artificial Intelligence, IJCAI 2017, Melbourne, Australia, 19\u201325 August 2017, pp. 631\u2013637 (2017)","DOI":"10.24963\/ijcai.2017\/88"},{"key":"21_CR5","doi-asserted-by":"crossref","unstructured":"Genc, B., Siala, M., O\u2019Sullivan, B., Simonin, G.: Finding robust solutions to stable marriage. CoRR abs\/1705.09218 (2017)","DOI":"10.24963\/ijcai.2017\/88"},{"key":"21_CR6","doi-asserted-by":"crossref","unstructured":"Genc, B., Siala, M., Simonin, G., O\u2019Sullivan, B.: Complexity study for the robust stable marriage problem. In: Theoretical Computer Science (2019)","DOI":"10.1016\/j.tcs.2018.12.017"},{"key":"21_CR7","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, Cambridge (1989)"},{"key":"21_CR8","unstructured":"Hebrard, E.: Robust solutions for constraint satisfaction and optimisation under uncertainty. PhD thesis, University of New South Wales (2007)"},{"key":"21_CR9","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"187","DOI":"10.1007\/11402763_14","volume-title":"Recent Advances in Constraints","author":"A Holland","year":"2005","unstructured":"Holland, A., O\u2019Sullivan, B.: Super solutions for combinatorial auctions. In: Faltings, B.V., Petcu, A., Fages, F., Rossi, F. (eds.) CSCLP 2004. LNCS (LNAI), vol. 3419, pp. 187\u2013200. Springer, Heidelberg (2005). \n                    https:\/\/doi.org\/10.1007\/11402763_14"},{"issue":"4","key":"21_CR10","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 \u201cstable roommates\u201d problem. J. Algorithms 6(4), 577\u2013595 (1985)","journal-title":"J. Algorithms"},{"issue":"3","key":"21_CR11","doi-asserted-by":"publisher","first-page":"655","DOI":"10.1137\/0215048","volume":"15","author":"RW Irving","year":"1986","unstructured":"Irving, R.W., Leather, P.: The complexity of counting stable marriages. SIAM J. Comput. 15(3), 655\u2013667 (1986)","journal-title":"SIAM J. Comput."},{"key":"21_CR12","unstructured":"Jacobovic, R.: Perturbation robust stable matching. CoRR abs\/1612.08118 (2016)"},{"issue":"3","key":"21_CR13","doi-asserted-by":"publisher","first-page":"273","DOI":"10.1016\/0166-218X(92)00180-T","volume":"48","author":"A Kolen","year":"1994","unstructured":"Kolen, A., Pesch, E.: Genetic local search in combinatorial optimization. Discret. Appl. Math. 48(3), 273\u2013284 (1994)","journal-title":"Discret. Appl. Math."},{"key":"21_CR14","unstructured":"Lebedev, D., Mathieu, F., Viennot, L., Gai, A.-T., Reynier, J., De Montgolfier,\u00a0F.: On using matching theory to understand P2P network design. In: INOC 2007, International Network Optimization Conference (2007)"},{"key":"21_CR15","unstructured":"Lussier, B., Chatila, R., Ingrand, F., Killijian, M.O., Powell, D.: On fault tolerance and robustness in autonomous systems. In: Proceedings of the Third IARP\/IEEE-RAS\/EURON Joint Workshop on Technical Challenge for Dependable Robots in Human Environments, Manchester, GB, 7\u20139 September 2004"},{"key":"21_CR16","doi-asserted-by":"publisher","first-page":"1441","DOI":"10.1214\/aop\/1176989126","volume":"21","author":"B Pittel","year":"1993","unstructured":"Pittel, B.: The \u201cstable roommates\u201d problem with random preferences. Ann. Probab. 21, 1441\u20131477 (1993)","journal-title":"Ann. Probab."},{"key":"21_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"262","DOI":"10.1007\/978-3-319-66158-2_17","volume-title":"Principles and Practice of Constraint Programming","author":"M Siala","year":"2017","unstructured":"Siala, M., O\u2019Sullivan, B.: Rotation-based formulation for stable matching. In: Beck, J.C. (ed.) CP 2017. LNCS, vol. 10416, pp. 262\u2013277. Springer, Cham (2017). \n                    https:\/\/doi.org\/10.1007\/978-3-319-66158-2_17"},{"key":"21_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1007\/BFb0029740","volume-title":"Parallel Problem Solving from Nature","author":"NLJ Ulder","year":"1991","unstructured":"Ulder, N.L.J., Aarts, E.H.L., Bandelt, H.-J., van Laarhoven, P.J.M., Pesch, E.: Genetic local search algorithms for the traveling salesman problem. In: Schwefel, H.-P., M\u00e4nner, R. (eds.) PPSN 1990. LNCS, vol. 496, pp. 109\u2013116. Springer, Heidelberg (1991). \n                    https:\/\/doi.org\/10.1007\/BFb0029740"}],"container-title":["Lecture Notes in Computer Science","Integration of Constraint Programming, Artificial Intelligence, and Operations Research"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-19212-9_21","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,27]],"date-time":"2019-05-27T19:11:06Z","timestamp":1558984266000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-19212-9_21"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030192112","9783030192129"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-19212-9_21","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2019]]},"assertion":[{"value":"28 April 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"CPAIOR","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Integration of Constraint Programming, Artificial Intelligence, and Operations Research","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Thessaloniki","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Greece","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2019","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"4 June 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"7 June 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"16","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"cpaior2019b","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/cpaior2019.uowm.gr\/","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":"94","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"34","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"9","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"36% - 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":"5.67","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"}}]}}