{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,3]],"date-time":"2026-04-03T22:35:51Z","timestamp":1775255751744,"version":"3.50.1"},"publisher-location":"Cham","reference-count":30,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783030030971","type":"print"},{"value":"9783030030988","type":"electronic"}],"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-03098-8_7","type":"book-chapter","created":{"date-parts":[[2018,10,23]],"date-time":"2018-10-23T08:27:33Z","timestamp":1540283253000},"page":"106-122","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Solving Multiagent Constraint Optimization Problems on the Constraint Composite Graph"],"prefix":"10.1007","author":[{"given":"Ferdinando","family":"Fioretto","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7874-4518","authenticated-orcid":false,"given":"Hong","family":"Xu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sven","family":"Koenig","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"T. K. Satish","family":"Kumar","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2018,10,24]]},"reference":[{"issue":"5439","key":"7_CR1","doi-asserted-by":"publisher","first-page":"509","DOI":"10.1126\/science.286.5439.509","volume":"286","author":"AL Barab\u00e1si","year":"1999","unstructured":"Barab\u00e1si, A.L., Albert, R.: Emergence of scaling in random networks. Science 286(5439), 509\u2013512 (1999)","journal-title":"Science"},{"issue":"3","key":"7_CR2","doi-asserted-by":"publisher","first-page":"292","DOI":"10.1016\/j.dam.2007.03.026","volume":"156","author":"M Chleb\u00edk","year":"2008","unstructured":"Chleb\u00edk, M., Chleb\u00edkov\u00e1, J.: Crown reductions for the minimum weighted vertex cover problem. Discret. Appl. Math. 156(3), 292\u2013312 (2008)","journal-title":"Discret. Appl. Math."},{"key":"7_CR3","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"1505","DOI":"10.1007\/978-3-319-71679-4_8","volume-title":"Autonomous Agents and Multiagent Systems","author":"L Cohen","year":"2017","unstructured":"Cohen, L., Zivan, R.: Max-sum revisited: the real power of damping. In: Sukthankar, G., Rodriguez-Aguilar, J.A. (eds.) AAMAS 2017. LNCS (LNAI), vol. 10643, pp. 1505\u20131507. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-71679-4_8"},{"key":"7_CR4","doi-asserted-by":"publisher","first-page":"2980","DOI":"10.1038\/srep02980","volume":"3","author":"M De Domenico","year":"2013","unstructured":"De Domenico, M., Lima, A., Mougel, P., Musolesi, M.: The anatomy of a scientific rumor. Sci. Rep. 3, 2980 (2013)","journal-title":"Sci. Rep."},{"key":"7_CR5","doi-asserted-by":"crossref","unstructured":"Farinelli, A., Rogers, A., Petcu, A., Jennings, N.: Decentralised coordination of low-power embedded devices using the Max-sum algorithm. In: Proceedings of the International Conference on Autonomous Agents and Multiagent Systems (AAMAS), pp. 639\u2013646 (2008)","DOI":"10.65109\/KQUE1089"},{"key":"7_CR6","doi-asserted-by":"publisher","first-page":"623","DOI":"10.1613\/jair.5565","volume":"61","author":"F Fioretto","year":"2018","unstructured":"Fioretto, F., Pontelli, E., Yeoh, W.: Distributed constraint optimization problems and applications: a survey. J. Artif. Intell. Res. 61, 623\u2013698 (2018)","journal-title":"J. Artif. Intell. Res."},{"key":"7_CR7","doi-asserted-by":"crossref","unstructured":"Fioretto, F., Yeoh, W., Pontelli, E.: Multi-variable agents decomposition for DCOPs. In: Proceedings of the AAAI Conference on Artificial Intelligence (AAAI), pp. 2480\u20132486 (2016)","DOI":"10.1609\/aaai.v30i1.10127"},{"key":"7_CR8","doi-asserted-by":"crossref","unstructured":"Fioretto, F., Yeoh, W., Pontelli, E.: A multiagent system approach to scheduling devices in smart homes. In: Proceedings of the International Conference on Autonomous Agents and Multiagent Systems (AAMAS), pp. 981\u2013989 (2017)","DOI":"10.65109\/QAHH7466"},{"key":"7_CR9","doi-asserted-by":"crossref","unstructured":"Fioretto, F., Yeoh, W., Pontelli, E., Ma, Y., Ranade, S.: A DCOP approach to the economic dispatch with demand response. In: Proceedings of the International Conference on Autonomous Agents and Multiagent Systems (AAMAS), pp. 981\u2013989 (2017)","DOI":"10.65109\/QNTB8377"},{"key":"7_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"688","DOI":"10.1007\/978-3-319-98334-9_44","volume-title":"Principles and Practice of Constraint Programming","author":"KD Hoang","year":"2018","unstructured":"Hoang, K.D., Fioretto, F., Yeoh, W., Pontelli, E., Zivan, R.: A large neighboring search schema for multi-agent optimization. In: Hooker, J. (ed.) CP 2018. LNCS, vol. 11008, pp. 688\u2013706. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-98334-9_44"},{"key":"7_CR11","doi-asserted-by":"crossref","unstructured":"Kiekintveld, C., Yin, Z., Kumar, A., Tambe, M.: Asynchronous algorithms for approximate distributed constraint optimization with quality bounds. In: Proceedings of the International Conference on Autonomous Agents and Multiagent Systems (AAMAS), pp. 133\u2013140 (2010)","DOI":"10.65109\/WZHW7839"},{"issue":"2","key":"7_CR12","doi-asserted-by":"publisher","first-page":"498","DOI":"10.1109\/18.910572","volume":"47","author":"FR Kschischang","year":"2001","unstructured":"Kschischang, F.R., Frey, B.J., Loeliger, H.A.: Factor graphs and the sum-product algorithm. IEEE Trans. Inf. Theory 47(2), 498\u2013519 (2001)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"7_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"282","DOI":"10.1007\/978-3-540-85958-1_19","volume-title":"Principles and Practice of Constraint Programming","author":"TKS Kumar","year":"2008","unstructured":"Kumar, T.K.S.: A framework for hybrid tractability results in Boolean weighted constraint satisfaction problems. In: Stuckey, P.J. (ed.) CP 2008. LNCS, vol. 5202, pp. 282\u2013297. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-85958-1_19"},{"key":"7_CR14","unstructured":"Kumar, T.K.S.: Lifting techniques for weighted constraint satisfaction problems. In: Proceedings of the International Symposium on Artificial Intelligence and Mathematics (ISAIM) (2008)"},{"key":"7_CR15","unstructured":"Kumar, T.K.S.: Kernelization, generation of bounds, and the scope of incremental computation for weighted constraint satisfaction problems. In: Proceedings of the International Symposium on Artificial Intelligence and Mathematics (ISAIM) (2016)"},{"key":"7_CR16","unstructured":"Maheswaran, R., Pearce, J., Tambe, M.: Distributed algorithms for DCOP: a graphical game-based approach. In: Proceedings of the Conference on Parallel and Distributed Computing Systems (PDCS), pp. 432\u2013439 (2004)"},{"issue":"1\u20132","key":"7_CR17","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1016\/j.artint.2004.09.003","volume":"161","author":"P Modi","year":"2005","unstructured":"Modi, P., Shen, W.M., Tambe, M., Yokoo, M.: ADOPT: asynchronous distributed constraint optimization with quality guarantees. Artif. Intell. 161(1\u20132), 149\u2013180 (2005)","journal-title":"Artif. Intell."},{"issue":"1","key":"7_CR18","doi-asserted-by":"publisher","first-page":"232","DOI":"10.1007\/BF01580444","volume":"8","author":"GL Nemhauser","year":"1975","unstructured":"Nemhauser, G.L., Trotter, L.E.: Vertex packings: structural properties and algorithms. Math. Program. 8(1), 232\u2013248 (1975)","journal-title":"Math. Program."},{"key":"7_CR19","unstructured":"Pearce, J., Tambe, M.: Quality guarantees on k-optimal solutions for distributed constraint optimization problems. In: Proceedings of the International Joint Conference on Artificial Intelligence (IJCAI), pp. 1446\u20131451 (2007)"},{"key":"7_CR20","doi-asserted-by":"crossref","unstructured":"Petcu, A., Faltings, B.: A scalable method for multiagent constraint optimization. In: Proceedings of the International Joint Conference on Artificial Intelligence (IJCAI), pp. 1413\u20131420 (2005)","DOI":"10.1007\/11600930_71"},{"key":"7_CR21","unstructured":"Petcu, A., Faltings, B., Mailler, R.: PC-DPOP: a new partial centralization algorithm for distributed optimization. In: Proceedings of the International Joint Conference on Artificial Intelligence (IJCAI), pp. 167\u2013172 (2007)"},{"key":"7_CR22","unstructured":"Rust, P., Picard, G., Ramparany, F.: Using message-passing DCOP algorithms to solve energy-efficient smart environment configuration problems. In: Proceedings of the International Joint Conference on Artificial Intelligence (IJCAI), pp. 468\u2013474 (2016)"},{"key":"7_CR23","doi-asserted-by":"crossref","unstructured":"Silva, G., Reis, L., Terceiro, A., Meirelles, P., Kon, F.: Implementing federated social networking: report from the trenches. In: Proceedings of the International Symposium on Open Collaboration (OpenSym), pp. 8:1\u20138:10 (2017)","DOI":"10.1145\/3125433.3125455"},{"issue":"3","key":"7_CR24","doi-asserted-by":"publisher","first-page":"439","DOI":"10.1007\/s10458-010-9132-7","volume":"22","author":"M Vinyals","year":"2011","unstructured":"Vinyals, M., Rodr\u00edguez-Aguilar, J., Cerquides, J.: Constructing a unifying theory of dynamic programming DCOP algorithms via the generalized distributive law. J. Auton. Agents Multi-Agent Syst. 22(3), 439\u2013464 (2011)","journal-title":"J. Auton. Agents Multi-Agent Syst."},{"key":"7_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"387","DOI":"10.1007\/978-3-319-59776-8_31","volume-title":"Integration of AI and OR Techniques in Constraint Programming","author":"H Xu","year":"2017","unstructured":"Xu, H., Satish Kumar, T.K., Koenig, S.: The Nemhauser-Trotter reduction and lifted message passing for the weighted CSP. In: Salvagnin, D., Lombardi, M. (eds.) CPAIOR 2017. LNCS, vol. 10335, pp. 387\u2013402. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-59776-8_31"},{"key":"7_CR26","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1613\/jair.2849","volume":"38","author":"W Yeoh","year":"2010","unstructured":"Yeoh, W., Felner, A., Koenig, S.: BnB-ADOPT: an asynchronous branch-and-bound DCOP algorithm. J. Artif. Intell. Res. 38, 85\u2013133 (2010)","journal-title":"J. Artif. Intell. Res."},{"issue":"1\u20132","key":"7_CR27","doi-asserted-by":"publisher","first-page":"55","DOI":"10.1016\/j.artint.2004.10.004","volume":"161","author":"W Zhang","year":"2005","unstructured":"Zhang, W., Wang, G., Xing, Z., Wittenberg, L.: Distributed stochastic search and distributed breakout: properties, comparison and applications to constraint optimization problems in sensor networks. Artif. Intell. 161(1\u20132), 55\u201387 (2005)","journal-title":"Artif. Intell."},{"key":"7_CR28","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.artint.2014.03.002","volume":"212","author":"R Zivan","year":"2014","unstructured":"Zivan, R., Okamoto, S., Peled, H.: Explorative anytime local search for distributed constraint optimization. Artif. Intell. 212, 1\u201326 (2014)","journal-title":"Artif. Intell."},{"key":"7_CR29","unstructured":"Zivan, R., Parash, T., Naveh, Y.: Applying max-sum to asymmetric distributed constraint optimization. In: Proceedings of the International Joint Conference on Artificial Intelligence (IJCAI), pp. 432\u2013439 (2015)"},{"issue":"3","key":"7_CR30","doi-asserted-by":"publisher","first-page":"495","DOI":"10.1007\/s10458-014-9255-3","volume":"29","author":"R Zivan","year":"2015","unstructured":"Zivan, R., Yedidsion, H., Okamoto, S., Glinton, R., Sycara, K.: Distributed constraint optimization for teams of mobile sensing agents. J. Auton. Agents Multi-Agent Syst. 29(3), 495\u2013536 (2015)","journal-title":"J. Auton. Agents Multi-Agent Syst."}],"container-title":["Lecture Notes in Computer Science","PRIMA 2018: Principles and Practice of Multi-Agent Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-03098-8_7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,4,3]],"date-time":"2026-04-03T21:15:28Z","timestamp":1775250928000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-03098-8_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783030030971","9783030030988"],"references-count":30,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-03098-8_7","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018]]},"assertion":[{"value":"24 October 2018","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"PRIMA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Principles and Practice of Multi-Agent Systems","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Tokyo","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Japan","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":"29 October 2018","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2 November 2018","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"21","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"prima2018","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/2018.prima-conference.org\/","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":"103","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":"25","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":"33","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":"24% - 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":"5","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)"}}]}}