{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,30]],"date-time":"2026-06-30T00:20:37Z","timestamp":1782778837005,"version":"3.54.5"},"publisher-location":"Cham","reference-count":18,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783030877552","type":"print"},{"value":"9783030877569","type":"electronic"}],"license":[{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2021]]},"DOI":"10.1007\/978-3-030-87756-9_18","type":"book-chapter","created":{"date-parts":[[2021,10,26]],"date-time":"2021-10-26T23:05:40Z","timestamp":1635289540000},"page":"273-288","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["On Reachable Assignments in Cycles"],"prefix":"10.1007","author":[{"given":"Luis","family":"M\u00fcller","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Matthias","family":"Bentert","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2021,10,27]]},"reference":[{"key":"18_CR1","doi-asserted-by":"crossref","unstructured":"Abraham, D.J., Blum, A., Sandholm, T.: Clearing algorithms for barter exchange markets: enabling nationwide kidney exchanges. In: Proceedings of the 8th ACM Conference on Electronic Commerce (EC \u201907), pp. 295\u2013304. ACM (2007)","DOI":"10.1145\/1250910.1250954"},{"key":"18_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1163","DOI":"10.1007\/11602613_115","volume-title":"Algorithms and Computation","author":"DJ Abraham","year":"2005","unstructured":"Abraham, D.J., Cechl\u00e1rov\u00e1, K., Manlove, D.F., Mehlhorn, K.: Pareto optimality in house allocation problems. In: Deng, X., Du, D.-Z. (eds.) ISAAC 2005. LNCS, vol. 3827, pp. 1163\u20131175. Springer, Heidelberg (2005). https:\/\/doi.org\/10.1007\/11602613_115"},{"key":"18_CR3","unstructured":"Bentert, M., Chen, J., Froese, V., Woeginger, G.J.: Good things come to those who swap objects on paths. CoRR abs\/1905.04219 (2019)"},{"key":"18_CR4","unstructured":"Bentert, M., Mal\u00edk, J., Weller, M.: Tree containment with soft polytomies. In: Proceedings of the 16th Scandinavian Symposium and Workshops on Algorithm Theory (SWAT \u201918), LIPIcs, vol. 101, pp. 9:1\u20139:14. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik (2018)"},{"issue":"5","key":"18_CR5","doi-asserted-by":"publisher","first-page":"591","DOI":"10.1007\/s10458-019-09417-x","volume":"33","author":"A Beynier","year":"2019","unstructured":"Beynier, A., et al.: Local envy-freeness in house allocation problems. Auton. Agents Multi-Agent Syst. 33(5), 591\u2013627 (2019). https:\/\/doi.org\/10.1007\/s10458-019-09417-x","journal-title":"Auton. Agents Multi-Agent Syst."},{"key":"18_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"100","DOI":"10.1007\/978-3-030-35389-6_8","volume-title":"Web and Internet Economics","author":"F Brandt","year":"2019","unstructured":"Brandt, F., Wilczynski, A.: On the convergence of swap dynamics to pareto-optimal matchings. In: Caragiannis, I., Mirrokni, V., Nikolova, E. (eds.) WINE 2019. LNCS, vol. 11920, pp. 100\u2013113. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-35389-6_8"},{"key":"18_CR7","unstructured":"Bredereck, R., Kaczmarczyk, A., Niedermeier, R.: Envy-free allocations respecting social networks. In: Proceedings of the 17th International Conference on Autonomous Agents and Multiagent Systems (AAMAS \u201918), pp. 283\u2013291. International Foundation for Autonomous Agents and Multiagent Systems (ACM) (2018)"},{"key":"18_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"72","DOI":"10.1007\/978-3-642-17493-3_9","volume-title":"Parameterized and Exact Computation","author":"K Cechl\u00e1rov\u00e1","year":"2010","unstructured":"Cechl\u00e1rov\u00e1, K., Schlotter, I.: Computing the deficiency of housing markets with duplicate houses. In: Raman, V., Saurabh, S. (eds.) IPEC 2010. LNCS, vol. 6478, pp. 72\u201383. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-17493-3_9"},{"key":"18_CR9","unstructured":"Chevaleyre, Y., Endriss, U., Maudet, N.: Allocating goods on a graph to eliminate envy. In: Proceedings of the 22nd Conference on Artificial Intelligence (AAAI \u201907), pp. 700\u2013705. AAAI Press (2007)"},{"key":"18_CR10","series-title":"Graduate Texts in Mathematics","volume-title":"Graph Theory","author":"R Diestel","year":"2012","unstructured":"Diestel, R.: Graph Theory. Graduate Texts in Mathematics, vol. 173, 4th edn. Springer, Heidelberg (2012)","edition":"4"},{"key":"18_CR11","doi-asserted-by":"crossref","unstructured":"Gourv\u00e8s, L., Lesca, J., Wilczynski, A.: Object allocation via swaps along a social network. In: Proceedings of the 26th International Joint Conference on Artificial Intelligence (IJCAI \u201917), pp. 213\u2013219 (2017)","DOI":"10.24963\/ijcai.2017\/31"},{"issue":"4","key":"18_CR12","doi-asserted-by":"crossref","first-page":"295","DOI":"10.4310\/CIS.2009.v9.n4.a1","volume":"9","author":"D Gusfield","year":"2009","unstructured":"Gusfield, D., Wu, Y.: The three-state perfect phylogeny problem reduces to 2-SAT. Commun. Inf. Syst. 9(4), 295\u2013302 (2009)","journal-title":"Commun. Inf. Syst."},{"issue":"2","key":"18_CR13","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s10458-020-09477-4","volume":"34","author":"S Huang","year":"2020","unstructured":"Huang, S., Xiao, M.: Object reachability via swaps under strict and weak preferences. Auton. Agents Multi-Agent Syst. 34(2), 1\u201333 (2020). https:\/\/doi.org\/10.1007\/s10458-020-09477-4","journal-title":"Auton. Agents Multi-Agent Syst."},{"key":"18_CR14","doi-asserted-by":"crossref","unstructured":"Igarashi, A., Peters, D.: Pareto-optimal allocation of indivisible goods with connectivity constraints. In: Proceedings of the 33rd AAAI Conference on Artificial Intelligence (AAAI \u201919), pp. 2045\u20132052. AAAI Press (2019)","DOI":"10.1609\/aaai.v33i01.33012045"},{"issue":"2","key":"18_CR15","doi-asserted-by":"publisher","first-page":"127","DOI":"10.1016\/0165-1765(82)90003-9","volume":"9","author":"AE Roth","year":"1982","unstructured":"Roth, A.E.: Incentive compatibility in a market with indivisible goods. Econ. Lett. 9(2), 127\u2013132 (1982)","journal-title":"Econ. Lett."},{"key":"18_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"213","DOI":"10.1007\/978-3-319-99660-8_19","volume-title":"Algorithmic Game Theory","author":"A Saffidine","year":"2018","unstructured":"Saffidine, A., Wilczynski, A.: Constrained swap dynamics over a social network in distributed resource reallocation. In: Deng, X. (ed.) SAGT 2018. LNCS, vol. 11059, pp. 213\u2013225. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-99660-8_19"},{"issue":"1","key":"18_CR17","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1016\/0304-4068(74)90033-0","volume":"1","author":"L Shapley","year":"1974","unstructured":"Shapley, L., Scarf, H.: On cores and indivisibility. J. Math. Econ. 1(1), 23\u201337 (1974)","journal-title":"J. Math. Econ."},{"issue":"2","key":"18_CR18","doi-asserted-by":"publisher","first-page":"425","DOI":"10.1016\/j.geb.2009.10.010","volume":"69","author":"T S\u00f6nmez","year":"2010","unstructured":"S\u00f6nmez, T., \u00dcnver, M.U.: House allocation with existing tenants: a characterization. Games Econ. Behav. 69(2), 425\u2013445 (2010)","journal-title":"Games Econ. Behav."}],"container-title":["Lecture Notes in Computer Science","Algorithmic Decision Theory"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-87756-9_18","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,1,13]],"date-time":"2023-01-13T22:01:43Z","timestamp":1673647303000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-87756-9_18"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030877552","9783030877569"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-87756-9_18","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021]]},"assertion":[{"value":"27 October 2021","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ADT","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Algorithmic Decision Theory","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Toulouse","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"France","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2021","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"3 November 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"5 November 2021","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"7","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"aldt2021","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.irit.fr\/ADT2021\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Double-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"58","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":"27","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":"0","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":"47% - 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":"7","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)"}}]}}