{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T12:15:16Z","timestamp":1743077716249,"version":"3.40.3"},"publisher-location":"Cham","reference-count":18,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783031181917"},{"type":"electronic","value":"9783031181924"}],"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.springer.com\/tdm"},{"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.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2022]]},"DOI":"10.1007\/978-3-031-18192-4_23","type":"book-chapter","created":{"date-parts":[[2022,10,12]],"date-time":"2022-10-12T20:25:31Z","timestamp":1665606331000},"page":"280-293","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Bundle Allocation with\u00a0Conflicting Preferences Represented as\u00a0Weighted Directed Acyclic Graphs"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-2261-4081","authenticated-orcid":false,"given":"Sara","family":"Maqrot","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7033-555X","authenticated-orcid":false,"given":"St\u00e9phanie","family":"Roussel","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-9888-9906","authenticated-orcid":false,"given":"Gauthier","family":"Picard","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-8114-4265","authenticated-orcid":false,"given":"C\u00e9dric","family":"Pralet","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2022,10,13]]},"reference":[{"key":"23_CR1","unstructured":"OpenStreetMap Points of Interest (on French Territory) (2021). www.data.gouv.fr\/fr\/datasets\/points-dinterets-openstreetmap\/. Accessed 30 Aug 2021"},{"key":"23_CR2","doi-asserted-by":"publisher","unstructured":"Bouveret, S., Cechl\u00e1rov\u00e1, K., Elkind, E., Igarashi, A., Peters, D.: Fair division of a graph. In: Sierra, C. (ed.) Proceedings of the Twenty-Sixth International Joint Conference on Artificial Intelligence, IJCAI 2017, Melbourne, Australia, August 19\u201325, 2017, pp. 135\u2013141. ijcai.org (2017). https:\/\/doi.org\/10.24963\/ijcai.2017\/20","DOI":"10.24963\/ijcai.2017\/20"},{"key":"23_CR3","doi-asserted-by":"publisher","unstructured":"Caragiannis, I., Kurokawa, D., Moulin, H., Procaccia, A.D., Shah, N., Wang, J.: The unreasonable fairness of maximum Nash welfare. In: Proceedings of the 2016 ACM Conference on Economics and Computation, pp. 305\u2013322. EC 2016, Association for Computing Machinery, New York, NY, USA (2016). https:\/\/doi.org\/10.1145\/2940716.2940726","DOI":"10.1145\/2940716.2940726"},{"key":"23_CR4","unstructured":"Cormen, T.H., Leiserson, C.E., Rivest, R.L., Stein, C.: Introduction to Algorithms, 2nd edn. The MIT Press, Cambridge (2001)"},{"issue":"1","key":"23_CR5","doi-asserted-by":"publisher","first-page":"293","DOI":"10.1016\/j.tcs.2009.09.032","volume":"411","author":"Y Du","year":"2010","unstructured":"Du, Y., Sami, R., Shi, Y.: Path auctions with multiple edge ownership. Theor. Comput. Sci. 411(1), 293\u2013300 (2010). https:\/\/doi.org\/10.1016\/j.tcs.2009.09.032","journal-title":"Theor. Comput. Sci."},{"issue":"3","key":"23_CR6","doi-asserted-by":"publisher","first-page":"818","DOI":"10.1016\/j.ejor.2020.11.033","volume":"292","author":"MS Hughes","year":"2021","unstructured":"Hughes, M.S., Lunday, B.J., Weir, J.D., Hopkinson, K.M.: The multiple shortest path problem with path deconfliction. Eur. J. Oper. Res. 292(3), 818\u2013829 (2021). https:\/\/doi.org\/10.1016\/j.ejor.2020.11.033","journal-title":"Eur. J. Oper. Res."},{"key":"23_CR7","doi-asserted-by":"publisher","unstructured":"Igarashi, A., Peters, D.: Pareto-optimal allocation of indivisible goods with connectivity constraints. In: The Thirty-Third AAAI Conference on Artificial Intelligence, AAAI 2019, pp. 2045\u20132052. AAAI Press (2019). https:\/\/doi.org\/10.1609\/aaai.v33i01.33012045","DOI":"10.1609\/aaai.v33i01.33012045"},{"key":"23_CR8","doi-asserted-by":"publisher","unstructured":"Immorlica, N., Karger, D.R., Nikolova, E., Sami, R.: First-price path auctions. In: Riedl, J., Kearns, M.J., Reiter, M.K. (eds.) Proceedings 6th ACM Conference on Electronic Commerce (EC-2005), Vancouver, BC, Canada, 5\u20138 June 2005, pp. 203\u2013212. ACM (2005). https:\/\/doi.org\/10.1145\/1064009.1064031","DOI":"10.1145\/1064009.1064031"},{"key":"23_CR9","doi-asserted-by":"publisher","unstructured":"Kurokawa, D., Procaccia, A.D., Shah, N.: Leximin allocations in the real world. ACM Trans. Econ. Comput. 6(3\u20134) (2018). https:\/\/doi.org\/10.1145\/3274641","DOI":"10.1145\/3274641"},{"key":"23_CR10","unstructured":"Lema\u00eetre, M., Verfaillie, G., Fargier, H., Lang, J., Bataille, N., Lachiver, J.M.: Equitable allocation of earth observing satellites resources. In: 5th ONERA-DLR Aerospace Symposium (ODAS 2003) (2003)"},{"issue":"1","key":"23_CR11","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1007\/BF01585506","volume":"7","author":"N Megiddo","year":"1974","unstructured":"Megiddo, N.: Optimal flows in networks with multiple sources and sinks. Math. Program. 7(1), 97\u2013107 (1974). https:\/\/doi.org\/10.1007\/BF01585506","journal-title":"Math. Program."},{"key":"23_CR12","doi-asserted-by":"crossref","unstructured":"Moulin, H.: Fair Division and Collective Welfare. MIT Press, Cambridge (2003)","DOI":"10.7551\/mitpress\/2954.001.0001"},{"key":"23_CR13","doi-asserted-by":"crossref","unstructured":"Nisan, N., Roughgarden, T., Tardos, E., Vazirani, V.V.: Algorithmic Game Theory. Cambridge University Press, New York (2007)","DOI":"10.1017\/CBO9780511800481"},{"key":"23_CR14","doi-asserted-by":"crossref","unstructured":"Panagopoulou, P.N., Spirakis, P.G.: Algorithms for pure Nash equilibria in weighted congestion games. ACM J. Exp. Algorithmics 11, 2.7-es (2007)","DOI":"10.1145\/1187436.1216584"},{"key":"23_CR15","unstructured":"Picard, G.: Auction-based and distributed optimization approaches for scheduling observations in satellite constellations with exclusive orbit portions. In: International Conference on Autonomous Agents and Multiagent Systems (AAMAS-22). IFAAMAS (2022)"},{"key":"23_CR16","doi-asserted-by":"publisher","unstructured":"Riera, J.F., Escalona, E., Batall\u00e9, J., Grasa, E., Garc\u00eda-Esp\u00edn, J.A.: Virtual network function scheduling: Concept and challenges. In: 2014 International Conference on Smart Communications in Network Technologies (SaCoNeT), pp. 1\u20135 (2014). https:\/\/doi.org\/10.1109\/SaCoNeT.2014.6867768","DOI":"10.1109\/SaCoNeT.2014.6867768"},{"issue":"2","key":"23_CR17","doi-asserted-by":"publisher","first-page":"295","DOI":"10.1109\/TPDS.2020.3017001","volume":"32","author":"S Yang","year":"2021","unstructured":"Yang, S., Li, F., Trajanovski, S., Yahyapour, R., Fu, X.: Recent advances of resource allocation in network function virtualization. IEEE Trans. Parallel Distrib. Syst. 32(2), 295\u2013314 (2021). https:\/\/doi.org\/10.1109\/TPDS.2020.3017001","journal-title":"IEEE Trans. Parallel Distrib. Syst."},{"key":"23_CR18","doi-asserted-by":"publisher","unstructured":"Zhang, L., Chen, H., Wu, J., Wang, C., Xie, J.: False-name-proof mechanisms for path auctions in social networks. In: ECAI 2016. Frontiers in Artificial Intelligence and Applications, vol. 285, pp. 1485\u20131492. IOS Press (2016). https:\/\/doi.org\/10.3233\/978-1-61499-672-9-1485","DOI":"10.3233\/978-1-61499-672-9-1485"}],"container-title":["Lecture Notes in Computer Science","Advances in Practical Applications of Agents, Multi-Agent Systems, and Complex Systems Simulation. The PAAMS Collection"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-18192-4_23","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,10,12]],"date-time":"2022-10-12T20:32:49Z","timestamp":1665606769000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-18192-4_23"}},"subtitle":["Application to Orbit Slot Ownership"],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783031181917","9783031181924"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-18192-4_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":"13 October 2022","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"PAAMS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Practical Applications of Agents and Multi-Agent Systems","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"L'Aquila","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":"2022","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"13 July 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"15 July 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"20","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"paams2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.paams.net\/","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":"78","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":"35","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":"10","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":"45% - 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":"2","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":"No","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"For the PAAMS 2022 Workshops volume: 39 submitted papers, 25 accepted full papers","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}