{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T10:25:34Z","timestamp":1743071134682,"version":"3.40.3"},"publisher-location":"Cham","reference-count":34,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783031206139"},{"type":"electronic","value":"9783031206146"}],"license":[{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2022]]},"DOI":"10.1007\/978-3-031-20614-6_23","type":"book-chapter","created":{"date-parts":[[2022,12,10]],"date-time":"2022-12-10T16:02:37Z","timestamp":1670688157000},"page":"403-420","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Resource Allocation to\u00a0Agents with\u00a0Restrictions: Maximizing Likelihood with\u00a0Minimum Compromise"],"prefix":"10.1007","author":[{"given":"Yohai","family":"Trabelsi","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Abhijin","family":"Adiga","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sarit","family":"Kraus","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"S. S.","family":"Ravi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2022,12,11]]},"reference":[{"key":"23_CR1","doi-asserted-by":"publisher","unstructured":"Bach, F., et al.: Learning with submodular functions: a convex optimization perspective. Found. Trends\u00ae Mach. Learn. 6(2\u20133), 145\u2013373 (2013). https:\/\/doi.org\/10.1561\/2200000039","DOI":"10.1561\/2200000039"},{"key":"23_CR2","unstructured":"Bian, A.A., Buhmann, J.M., Krause, A., Tschiatschek, S.: Guarantees for greedy maximization of non-submodular functions with applications. In: Proceedings of the 34th ICML, vol. 70, pp. 498\u2013507. PMLR (2017)"},{"issue":"1","key":"23_CR3","first-page":"3","volume":"30","author":"Y Chevaleyre","year":"2006","unstructured":"Chevaleyre, Y., et al.: Issues in multiagent resource allocation. Informatica 30(1), 3\u201331 (2006)","journal-title":"Informatica"},{"key":"23_CR4","volume-title":"Introduction to Algorithms","author":"TH Cormen","year":"2009","unstructured":"Cormen, T.H., Leiserson, C.E., Rivest, R.L., Stein, C.: Introduction to Algorithms. MIT Press, Cambridge (2009)"},{"key":"23_CR5","doi-asserted-by":"publisher","first-page":"505","DOI":"10.1613\/jair.2102","volume":"27","author":"DA Dolgov","year":"2006","unstructured":"Dolgov, D.A., Durfee, E.H.: Resource allocation among agents with MDP-induced preferences. J. Artif. Intell. Res. 27, 505\u2013549 (2006)","journal-title":"J. Artif. Intell. Res."},{"key":"23_CR6","doi-asserted-by":"publisher","first-page":"517","DOI":"10.4153\/CJM-1958-052-0","volume":"10","author":"AL Dulmage","year":"1958","unstructured":"Dulmage, A.L., Mendelsohn, N.S.: Coverings of bipartite graphs. Can. J. Math. 10, 517\u2013534 (1958)","journal-title":"Can. J. Math."},{"key":"23_CR7","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511761942","volume-title":"Networks, Crowds and Markets: Reasoning About a Highly Connected World","author":"D Easley","year":"2010","unstructured":"Easley, D., Kleinberg, J.: Networks, Crowds and Markets: Reasoning About a Highly Connected World. Cambridge University Press, New York (2010)"},{"issue":"1","key":"23_CR8","doi-asserted-by":"publisher","first-page":"127","DOI":"10.1007\/BF01584082","volume":"1","author":"J Edmonds","year":"1971","unstructured":"Edmonds, J.: Matroids and the greedy algorithm. Math. Program. 1(1), 127\u2013136 (1971). https:\/\/doi.org\/10.1007\/BF01584082","journal-title":"Math. Program."},{"key":"23_CR9","doi-asserted-by":"publisher","first-page":"187","DOI":"10.1007\/978-0-387-85820-3_6","volume-title":"Recommender Systems Handbook","author":"A Felfernig","year":"2011","unstructured":"Felfernig, A., Friedrich, G., Jannach, D., Zanker, M.: Developing constraint-based recommenders. In: Ricci, F., Rokach, L., Shapira, B., Kantor, P.B. (eds.) Recommender Systems Handbook, pp. 187\u2013215. Springer, Boston (2011). https:\/\/doi.org\/10.1007\/978-0-387-85820-3_6"},{"issue":"5","key":"23_CR10","doi-asserted-by":"publisher","first-page":"1291","DOI":"10.1007\/s10618-020-00675-y","volume":"34","author":"D Garc\u00eda-Soriano","year":"2020","unstructured":"Garc\u00eda-Soriano, D., Bonchi, F.: Fair-by-design matching. Data Min. Knowl. Disc. 34(5), 1291\u20131335 (2020). https:\/\/doi.org\/10.1007\/s10618-020-00675-y","journal-title":"Data Min. Knowl. Disc."},{"key":"23_CR11","volume-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"MR Garey","year":"1979","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman and Co., San Francisco (1979)"},{"key":"23_CR12","unstructured":"Ghoseiri, K., Haghani, A., Hamed, M., et al.: Real-time rideshare matching problem. Technical report, Mid-Atlantic Universities Transportation Center (2010)"},{"key":"23_CR13","unstructured":"Gilbert, F.: A guide to sharing farm equipment (2018). https:\/\/projects.sare.org\/wp-content\/uploads\/Sharing-Guide-2018-_-Web.pdf"},{"key":"23_CR14","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"236","DOI":"10.1007\/3-540-45023-8_23","volume-title":"Multi-Agent Systems and Applications III","author":"V Gorodetski","year":"2003","unstructured":"Gorodetski, V., Karsaev, O., Konushy, V.: Multi-agent system for resource allocation and scheduling. In: Ma\u0159\u00edk, V., P\u011bchou\u010dek, M., M\u00fcller, J. (eds.) CEEMAS 2003. LNCS (LNAI), vol. 2691, pp. 236\u2013246. Springer, Heidelberg (2003). https:\/\/doi.org\/10.1007\/3-540-45023-8_23"},{"issue":"4","key":"23_CR15","doi-asserted-by":"publisher","first-page":"225","DOI":"10.1137\/0202019","volume":"2","author":"JE Hopcroft","year":"1973","unstructured":"Hopcroft, J.E., Karp, R.M.: An $$n^{5\/2}$$ algorithm for maximum matchings in bipartite graphs. SIAM J. Comput. 2(4), 225\u2013231 (1973)","journal-title":"SIAM J. Comput."},{"issue":"4","key":"23_CR16","doi-asserted-by":"publisher","first-page":"602","DOI":"10.1145\/1198513.1198520","volume":"2","author":"RW Irving","year":"2006","unstructured":"Irving, R.W., Kavitha, T., Mehlhorn, K., Michail, D., Paluch, K.E.: Rank-maximal matchings. ACM Trans. Algorithms (TALG) 2(4), 602\u2013610 (2006)","journal-title":"ACM Trans. Algorithms (TALG)"},{"key":"23_CR17","unstructured":"Izenberg, D., Marwaha, S., Tepper, J.: Medical students who don\u2019t match through CaRMS: \u201cit\u2019s like a scarlet letter\u201d (2018). Healthy Debate: https:\/\/healthydebate.ca\/2018\/03\/topic\/medical-students-carms\/"},{"issue":"1\u20132","key":"23_CR18","doi-asserted-by":"publisher","first-page":"121","DOI":"10.1007\/BF01010403","volume":"48","author":"M Jerrum","year":"1987","unstructured":"Jerrum, M.: Two-dimensional Monomer-Dimer systems are computationally intractable. J. Stat. Phys. 48(1\u20132), 121\u2013134 (1987). https:\/\/doi.org\/10.1007\/BF01010403","journal-title":"J. Stat. Phys."},{"issue":"4","key":"23_CR19","doi-asserted-by":"publisher","first-page":"565","DOI":"10.1140\/epjb\/e2009-00315-0","volume":"71","author":"L L\u00fc","year":"2009","unstructured":"L\u00fc, L., Medo, M., Zhang, Y.C.: The role of a matchmaker in buyer-vendor interactions. Eur. Phys. J. B 71(4), 565\u2013571 (2009). https:\/\/doi.org\/10.1140\/epjb\/e2009-00315-0","journal-title":"Eur. Phys. J. B"},{"issue":"1","key":"23_CR20","doi-asserted-by":"publisher","first-page":"265","DOI":"10.1007\/BF01588971","volume":"14","author":"GL Nemhauser","year":"1978","unstructured":"Nemhauser, G.L., Wolsey, L.A., Fisher, M.L.: An analysis of approximations for maximizing submodular set functions-I. Math. Program. 14(1), 265\u2013294 (1978). https:\/\/doi.org\/10.1007\/BF01588971","journal-title":"Math. Program."},{"issue":"1\u20133","key":"23_CR21","doi-asserted-by":"publisher","first-page":"65","DOI":"10.1007\/s10472-012-9328-4","volume":"68","author":"TT Nguyen","year":"2013","unstructured":"Nguyen, T.T., Roos, M., Rothe, J.: A survey of approximability and inapproximability results for social welfare optimization in multiagent resource allocation. Ann. Math. Artif. Intell. 68(1\u20133), 65\u201390 (2013). https:\/\/doi.org\/10.1007\/s10472-012-9328-4","journal-title":"Ann. Math. Artif. Intell."},{"key":"23_CR22","volume-title":"A Course in Game Theory","author":"MJ Osborne","year":"1994","unstructured":"Osborne, M.J., Rubinstein, A.: A Course in Game Theory. The MIT Press, Cambridge (1994)"},{"issue":"4","key":"23_CR23","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/2037661.2037665","volume":"29","author":"AG Parameswaran","year":"2011","unstructured":"Parameswaran, A.G., Venetis, P., Garcia-Molina, H.: Recommendation systems with complex constraints: a course recommendation perspective. ACM Trans. Inf. Syst. 29(4), 1\u201333 (2011)","journal-title":"ACM Trans. Inf. Syst."},{"key":"23_CR24","doi-asserted-by":"publisher","first-page":"42","DOI":"10.1016\/j.cor.2014.07.012","volume":"53","author":"AE Phillips","year":"2015","unstructured":"Phillips, A.E., Waterer, H., Ehrgott, M., Ryan, D.M.: Integer programming methods for large-scale practical classroom assignment problems. Comput. Oper. Res. 53, 42\u201353 (2015)","journal-title":"Comput. Oper. Res."},{"key":"23_CR25","unstructured":"Pulleyblank, W.R.: Matchings and extensions. In: Handbook of Combinatorics, vol. 1, pp. 179\u2013232 (1995)"},{"key":"23_CR26","doi-asserted-by":"crossref","unstructured":"Rakhra, M., Singh, R.: Internet based resource sharing platform development for agriculture machinery and tools in Punjab, India. In: Proceedings of the 8th International Conference on Reliability, Infocom Technologies and Optimization (Trends and Future Directions) (ICRITO), pp. 636\u2013642 (2020)","DOI":"10.1109\/ICRITO48877.2020.9197908"},{"issue":"2","key":"23_CR27","doi-asserted-by":"publisher","first-page":"425","DOI":"10.2307\/1913160","volume":"54","author":"AE Roth","year":"1986","unstructured":"Roth, A.E.: On the allocation of residents to rural hospitals: a general property of two-sided matching markets. Econom.: J. Econom. Soc. 54(2), 425\u2013427 (1986)","journal-title":"Econom.: J. Econom. Soc."},{"key":"23_CR28","doi-asserted-by":"crossref","unstructured":"Trabelsi, Y., Adiga, A., Kraus, S., Ravi, S.S.: Resource allocation to agents with restrictions: maximizing likelihood with minimum compromise. arXiv Report, August 2022","DOI":"10.1007\/978-3-031-20614-6_23"},{"issue":"3","key":"23_CR29","doi-asserted-by":"publisher","first-page":"410","DOI":"10.1137\/0208032","volume":"8","author":"LG Valiant","year":"1979","unstructured":"Valiant, L.G.: The complexity of enumeration and reliability problems. SIAM J. Comput. 8(3), 410\u2013421 (1979)","journal-title":"SIAM J. Comput."},{"key":"23_CR30","doi-asserted-by":"publisher","first-page":"104168","DOI":"10.1016\/j.dib.2019.104168","volume":"25","author":"S Varone","year":"2019","unstructured":"Varone, S., Beffa, C.: Dataset on a problem of assigning activities to children, with various optimization constraints. Data Brief 25, 104168 (2019)","journal-title":"Data Brief"},{"issue":"560","key":"23_CR31","doi-asserted-by":"publisher","first-page":"235","DOI":"10.1017\/mag.2020.45","volume":"104","author":"LM Wapner","year":"2020","unstructured":"Wapner, L.M.: GPS navigation apps and the price of anarchy. Math. Gaz. 104(560), 235\u2013240 (2020)","journal-title":"Math. Gaz."},{"key":"23_CR32","unstructured":"Zahedi, Z., Sengupta, S., Kambhampati, S.: Why not give this work to them? Explaining AI-moderated task-allocation outcomes using negotiation trees. arXiv: 2002.01640 (2020)"},{"issue":"4","key":"23_CR33","doi-asserted-by":"publisher","first-page":"574","DOI":"10.1007\/s10601-010-9098-8","volume":"15","author":"M Zanker","year":"2010","unstructured":"Zanker, M., Jessenitschnig, M., Schmid, W.: Preference reasoning with soft constraints in constraint-based recommender systems. Constraints Int. J. 15(4), 574\u2013595 (2010). https:\/\/doi.org\/10.1007\/s10601-010-9098-8","journal-title":"Constraints Int. J."},{"issue":"3","key":"23_CR34","doi-asserted-by":"publisher","first-page":"955","DOI":"10.1016\/j.ipm.2019.02.002","volume":"56","author":"W Zhou","year":"2019","unstructured":"Zhou, W., Han, W.: Personalized recommendation via user preference matching. Inf. Process. Manag. 56(3), 955\u2013968 (2019)","journal-title":"Inf. Process. Manag."}],"container-title":["Lecture Notes in Computer Science","Multi-Agent Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-20614-6_23","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,3,17]],"date-time":"2023-03-17T03:36:28Z","timestamp":1679024188000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-20614-6_23"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783031206139","9783031206146"],"references-count":34,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-20614-6_23","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2022]]},"assertion":[{"value":"11 December 2022","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"EUMAS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"European Conference on Multi-Agent Systems","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"D\u00fcsseldorf","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Germany","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2022","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"14 September 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"16 September 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"19","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"eumas2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/ccc.cs.hhu.de\/eumas2022\/","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":"36","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":"23","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":"64% - 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":"3","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)"}}]}}