{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,16]],"date-time":"2025-10-16T20:38:53Z","timestamp":1760647133969,"version":"3.37.3"},"reference-count":57,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Auton Agent Multi-Agent Syst"],"published-print":{"date-parts":[[2020,4]]},"DOI":"10.1007\/s10458-019-09436-8","type":"journal-article","created":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T23:02:48Z","timestamp":1577919768000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":9,"title":["Applying Max-sum to asymmetric distributed constraint optimization problems"],"prefix":"10.1007","volume":"34","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-1410-8368","authenticated-orcid":false,"given":"Roie","family":"Zivan","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tomer","family":"Parash","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Liel","family":"Cohen-Lavi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yarden","family":"Naveh","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2020,1,1]]},"reference":[{"issue":"2","key":"9436_CR1","doi-asserted-by":"publisher","first-page":"325","DOI":"10.1109\/18.825794","volume":"46","author":"SM Aji","year":"2000","unstructured":"Aji, S. M., & McEliece, R. J. (2000). The generalized distributive law. IEEE Transactions on Information Theory, 46(2), 325\u2013343.","journal-title":"IEEE Transactions on Information Theory"},{"key":"9436_CR2","volume-title":"Linked: How everything is connected to everything else and what it means for business, science, and everyday life","author":"A-L Barab\u00e1si","year":"2003","unstructured":"Barab\u00e1si, A.-L. (2003). Linked: How everything is connected to everything else and what it means for business, science, and everyday life. New York: Plume."},{"key":"9436_CR3","unstructured":"Brito, I., & Meseguer, P. (2010). Improving DPOP with function filtering. In AAMAS (pp. 141\u2013148)."},{"issue":"2","key":"9436_CR4","doi-asserted-by":"publisher","first-page":"199","DOI":"10.1007\/s10601-008-9048-x","volume":"14","author":"I Brito","year":"2009","unstructured":"Brito, I., Meisels, A., Meseguer, P., & Zivan, R. (2009). Distributed constraint satisfaction with partially known constraints. Constraints, 14(2), 199\u2013234.","journal-title":"Constraints"},{"key":"9436_CR5","unstructured":"Cerquides, J., Emonet, R., Picard, G., & Rodr\u00edguez-Aguilar, J. A. (2018). DECIMAXSUM: Using decimation to improve max-sum on cyclic DCOPs. In Artificial intelligence research and development\u2014Current challenges, new trends and applications, CCIA 2018, 21st international conference of the Catalan association for artificial intelligence, Alt Empord\u00e0, Catalonia, Spain, 8\u201310th October 2018 (pp. 27\u201336)."},{"key":"9436_CR6","doi-asserted-by":"crossref","unstructured":"Cohen, L., & Zivan, R. (2017). Max-sum revisited: The real power of damping. In Proceedings of the 16th conference on autonomous agents and multiagent systems, AAMAS 2017, S\u00e3o Paulo, Brazil, May 8\u201312, 2017 (pp. 1505\u20131507).","DOI":"10.1007\/978-3-319-71679-4_8"},{"key":"9436_CR7","doi-asserted-by":"crossref","unstructured":"Cohen, L., & Zivan, R. (2017). Max-sum revisited: The real power of damping. In Workshop on multi agent optimization (OptMAS) at AAMAS 2017, S\u00e3o Paulo, Brazil, May, 2017 (pp. 1505\u20131507).","DOI":"10.1007\/978-3-319-71679-4_8"},{"key":"9436_CR8","doi-asserted-by":"crossref","unstructured":"Cohen, L., & Zivan, R. (2018). Balancing asymmetry in max-sum using split constraint factor graphs. In Principles and practice of constraint programming\u201424th international conference, CP 2018, Lille, France, August 27\u201331, 2018, Proceedings (pp. 669\u2013687).","DOI":"10.1007\/978-3-319-98334-9_43"},{"key":"9436_CR9","unstructured":"Farinelli, A., Rogers, A., Petcu, A., & Jennings, N. R. (2008). Decentralized coordination of low-power embedded devices using the max-sum algorithm. In AAMAS (pp. 639\u2013646)."},{"key":"9436_CR10","unstructured":"Gent, I. P., & Walsh, T. (1999). CSPLib: A benchmark library for constraints. In A shorter version appears in the proceedings of the 5th international conference on principles and practices of constraint programming (CP-99). Technical report APES-09-1999. http:\/\/csplib.cs.strath.ac.uk\/."},{"key":"9436_CR11","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1613\/jair.2591","volume":"34","author":"A Gershman","year":"2009","unstructured":"Gershman, A., Meisels, A., & Zivan, R. (2009). Asynchronous forward bounding. Journal of Artificial Intelligence Research, 34, 25\u201346.","journal-title":"Journal of Artificial Intelligence Research"},{"key":"9436_CR12","unstructured":"Globerson, A., & Jaakkola, T. (2007). Fixing max-product: Convergent message passing algorithms for MAP LP-relaxations. In NIPS."},{"key":"9436_CR13","unstructured":"Greenstadt, R., Grosz, B. J., & Smith, M. D. (2006). SSDPOP: Improving the privacy of DCOP with secret sharing, distributed constraint reasoning workshop (DCR), Providence, Rhode Island, september 2007. In Distributed constraint reasoning workshop (DCR), CP-07. Providence, RI, USA."},{"key":"9436_CR14","unstructured":"Greenstadt, R., Pearce, J., & Tambe, M. (2006). Analysis of privacy loss in distributed constraint optimization. In AAAI-06, Boston, MA, USA (pp. 647\u2013653)."},{"key":"9436_CR15","doi-asserted-by":"publisher","first-page":"613","DOI":"10.1613\/jair.3945","volume":"47","author":"T Grinshpoun","year":"2013","unstructured":"Grinshpoun, T., Grubshtein, A., Zivan, R., Netzer, A., & Meisels, A. (2013). Asymmetric distributed constraint optimization problems. Journal of Artificial Intelligence Research, 47, 613\u2013647.","journal-title":"Journal of Artificial Intelligence Research"},{"key":"9436_CR16","first-page":"1015","volume":"2010","author":"A Grubshtein","year":"2010","unstructured":"Grubshtein, A., Zivan, R., Grinshpon, T., & Meisels, A. (2010). Local search for distributed asymmetric optimization. AAMAS, 2010, 1015\u20131022.","journal-title":"AAMAS"},{"key":"9436_CR17","unstructured":"Hatano, D., & Hirayama, K. (2013). DeQED: An efficient divide-and-coordinate algorithm for DCOP. In IJCAI."},{"issue":"12","key":"9436_CR18","doi-asserted-by":"publisher","first-page":"6294","DOI":"10.1109\/TIT.2010.2079014","volume":"56","author":"T Hazan","year":"2010","unstructured":"Hazan, T., & Shashua, A. (2010). Norm-product belief propagation: Primal\u2013dual message-passing for approximate inference. IEEE Transactions on Information Theory, 56(12), 6294\u20136316.","journal-title":"IEEE Transactions on Information Theory"},{"key":"9436_CR19","unstructured":"Kiekintveld, C., Yin, Z., Kumar, A., & Tambe, M. (2010). Asynchronous algorithms for approximate distributed constraint optimization with quality bounds. In AAMAS (pp. 133\u2013140)."},{"issue":"2","key":"9436_CR20","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1109\/18.910572","volume":"47","author":"FR Kschischang","year":"2001","unstructured":"Kschischang, F. R., Frey, B. J., & Loeliger, H. A. (2001). Factor graphs and the sum-product algorithm. IEEE Transactions on Information Theory, 47(2), 181\u2013208.","journal-title":"IEEE Transactions on Information Theory"},{"key":"9436_CR21","unstructured":"Lazic, N., Frey, B., & Aarabi, P. (2010). Solving the uncapacitated facility location problem using message passing algorithms. In International conference on artificial intelligence and statistics (pp. 429\u2013436)."},{"key":"9436_CR22","unstructured":"Maheswaran, R.\u00a0T., Pearce, J.\u00a0P., & Tambe, M. (2004). Distributed algorithms for DCOP: A graphical-game-based approach. In PDCS (pp. 432\u2013439)."},{"key":"9436_CR23","unstructured":"Maheswaran, R. T., Tambe, M., Bowring, E., Pearce, J. P., & Varakantham, P. (2004). Taking DCOP to the real world: Efficient complete solutions for distributed multi-event scheduling. In 3rd international joint conference on autonomous agents and multiagent systems (AAMAS 2004), 19\u201323 August 2004, New York, NY, USA (pp. 310\u2013317)."},{"key":"9436_CR24","unstructured":"Meisels, A., & Lavee, O. (2004). Using additional information in DisCSP search. In Proceedings of the 5th workshop on distributed constraints reasoning, DCR-04, Toronto."},{"key":"9436_CR25","unstructured":"Modi, J., & Veloso, M. (2004). Multiagent meeting scheduling with rescheduling. In Proceedings of the fifth workshop on distributed constraint reasoning (DCR), CP 2004, Toronto."},{"issue":"1\u20132","key":"9436_CR26","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1016\/j.artint.2004.09.003","volume":"161","author":"PJ Modi","year":"2005","unstructured":"Modi, P. J., Shen, W., Tambe, M., & Yokoo, M. (2005). ADOPT: Asynchronous distributed constraints optimizationwith quality guarantees. Artificial Intelligence, 161(1\u20132), 149\u2013180.","journal-title":"Artificial Intelligence"},{"key":"9436_CR27","unstructured":"Okamoto, S., Zivan, R., & Nahon, A. (2016). Distributed breakout: Beyond satisfaction. In Proceedings of the twenty-fifth international joint conference on artificial intelligence, IJCAI 2016, New York, NY, USA, 9\u201315 July 2016 (pp. 447\u2013453)."},{"key":"9436_CR28","first-page":"660","volume-title":"CP 2011, LNCS","author":"T Okimoto","year":"2011","unstructured":"Okimoto, T., Joe, Y., Iwasaki, A., Yokoo, M., & Faltings, B. (2011). Pseudo-tree-based incomplete algorithm for distributed constraint optimization with quality bounds. In J. Lee (Ed.), CP 2011, LNCS (Vol. 6876, pp. 660\u2013674). Berlin: Springer."},{"key":"9436_CR29","unstructured":"Pearce, J. P., & Tambe, M. (2007). Quality guarantees on k-optimal solutions for distributed constraint optimization problems. In IJCAI, Hyderabad, India (pp. 1446\u20131451)."},{"key":"9436_CR30","unstructured":"Penya-Alba, T., Vinyals, M., Cerquides, J., & Rodr\u00edguez-Aguilar, J. A. (2012). A scalable message-passing algorithm for supply chain formation. In Proceedings of the twenty-sixth AAAI conference on artificial intelligence, July 22\u201326, 2012, Toronto, ON, Canada."},{"key":"9436_CR31","unstructured":"Petcu, A., & Faltings, B. (2005). A scalable method for multiagent constraint optimization. In IJCAI (pp. 266\u2013271)."},{"key":"9436_CR32","unstructured":"Petcu, A. (2007). A class of algorithms for distributed constraint optimization. PhD thesis, Ecole Polytechnique F\u00e9d\u00e9rale de Lausanne (EPFL), Switzerland."},{"key":"9436_CR33","first-page":"802","volume-title":"CP 2005, LNCS","author":"A Petcu","year":"2005","unstructured":"Petcu, A., & Faltings, B. (2005). Approximations in distributed optimization. In P. van Beek (Ed.), CP 2005, LNCS (Vol. 3709, pp. 802\u2013806). Berlin: Springer."},{"key":"9436_CR34","doi-asserted-by":"publisher","first-page":"P11008","DOI":"10.1088\/1742-5468\/2005\/11\/P11008","volume":"11","author":"M Pretti","year":"2005","unstructured":"Pretti, M. (2005). A message-passing algorithm with damping. Journal of Statistical Mechanics: Theory and Experiment, 11, P11008.","journal-title":"Journal of Statistical Mechanics: Theory and Experiment"},{"issue":"9","key":"9436_CR35","doi-asserted-by":"publisher","first-page":"1447","DOI":"10.1093\/comjnl\/bxq022","volume":"53","author":"SD Ramchurn","year":"2010","unstructured":"Ramchurn, S. D., Farinelli, A., Macarthur, K. S., & Jennings, N. R. (2010). Decentralized coordination in robocup rescue. The Computer Journal, 53(9), 1447\u20131461.","journal-title":"The Computer Journal"},{"issue":"2","key":"9436_CR36","doi-asserted-by":"publisher","first-page":"730","DOI":"10.1016\/j.artint.2010.11.001","volume":"175","author":"A Rogers","year":"2011","unstructured":"Rogers, A., Farinelli, A., Stranders, R., & Jennings, N. R. (2011). Bounded approximate decentralized coordination via the max-sum algorithm. Artificial Intelligence, 175(2), 730\u2013759.","journal-title":"Artificial Intelligence"},{"key":"9436_CR37","doi-asserted-by":"crossref","unstructured":"Rollon, E., & Larrosa, J. (2012). Improved bounded max-sum for distributed constraint optimization. In CP (pp. 624\u2013632).","DOI":"10.1007\/978-3-642-33558-7_45"},{"key":"9436_CR38","unstructured":"Rollon, E., & Larrosa, J. (2014). Decomposing utility functions in bounded max-sum for distributed constraint optimization. In: Principles and practice of constraint programming\u201420th international conference, CP 2014, Lyon, France, September 8\u201312, 2014. Proceedings (pp. 646\u2013654)."},{"key":"9436_CR39","doi-asserted-by":"publisher","first-page":"305","DOI":"10.1613\/jair.3680","volume":"45","author":"AM Rush","year":"2012","unstructured":"Rush, A. M., & Collins, M. (2012). A tutorial on dual decomposition and lagrangian relaxation for inference in natural language processing. Journal of Artificial Intelligence Research, 45, 305\u2013362.","journal-title":"Journal of Artificial Intelligence Research"},{"key":"9436_CR40","doi-asserted-by":"crossref","unstructured":"Som, P., & Chockalingam, A. (2010). Damped belief propagation based near-optimal equalization of severely delay-spread UWB MIMO-ISI channels. In 2010 IEEE international conference on communications (ICC). IEEE (pp. 1\u20135).","DOI":"10.1109\/ICC.2010.5502031"},{"key":"9436_CR41","unstructured":"Sontag, D., Meltzer, T., Globerson, A., Jaakkola, T., & Weiss, Y. (2008). Tightening LP relaxations for MAP using message passing. In UAI (pp. 503\u2013510)."},{"key":"9436_CR42","unstructured":"Stranders, R., Farinelli, A., Rogers, A., & Jennings, N. R. (2009). Decentralised coordination of mobile sensors using the max-sum algorithm. In IJCAI 2009, proceedings of the 21st international joint conference on artificial intelligence, Pasadena, California, USA, July 11\u201317, 2009 (pp. 299\u2013304)."},{"key":"9436_CR43","unstructured":"Tarlow, D., Givoni, I., Zemel, R., & Frey, B. (2011). Graph cuts is a max-product algorithm. In Proceedings of the 27th conference on uncertainty in artificial intelligence."},{"key":"9436_CR44","unstructured":"Taylor, M. E., Jain, M., Jin, Y., Yokoo, M., & Tambe, M. (May 2010). When should there be a \u201cme\u201d in \u201cteam\u201d?: Distributed multi-agent optimization under uncertainty. In AAMAS (pp. 109\u2013116)."},{"key":"9436_CR45","unstructured":"Teacy, W. T. L., Farinelli, A., Grabham, N. J., Padhy, P., Rogers, A., & Jennings, N. R. (2008). Max-sum decentralized coordination for sensor systems. In AAMAS (pp. 1697\u20131698)."},{"key":"9436_CR46","unstructured":"Vinyals, M., Pujol, M., Rodr\u00edguez-Aguilar, J. A., & Cerquides, J. (2010). Divide-and-coordinate: DCOPs by agreement. In AAMAS (pp. 149\u2013156)."},{"issue":"3","key":"9436_CR47","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. A., & Cerquides, J. (2011). Constructing a unifying theory of dynamic programming dcop algorithms via the generalized distributive law. Autonomous Agents and Multi-Agent Systems, 22(3), 439\u2013464.","journal-title":"Autonomous Agents and Multi-Agent Systems"},{"key":"9436_CR48","unstructured":"Vinyals, M., Shieh, E., Cerquides, J., Rodriguez-Aguilar, J.\u00a0A., Yin, Z., Tambe, M., & Bowring, E. (2011). Quality guarantees for region optimal DCOP algorithms. In AAMAS, Tapei (pp. 133\u2013140)."},{"key":"9436_CR49","unstructured":"Vinyals, M., Rodr\u00edguez-Aguilar, J.\u00a0A., & Cerquides, J. (2009). Generalizing DPOP: Action-GDL, a new complete algorithm for DCOPs. In 8th international joint conference on autonomous agents and multiagent systems (AAMAS 2009), Budapest, Hungary, May 10\u201315, 2009 (Vol. 2, pp. 1239\u20131240)."},{"key":"9436_CR50","first-page":"1887","volume":"7","author":"C Yanover","year":"2006","unstructured":"Yanover, C., Meltzer, T., & Weiss, Y. (2006). Linear programming relaxations and belief propagation\u2014An empirical study. Journal of Machine Learning Research, 7, 1887\u20131907.","journal-title":"Journal of Machine Learning Research"},{"key":"9436_CR51","unstructured":"Yedidsion, H., Zivan, R., & Farinelli, A. (2014). Explorative max-sum for teams of mobile sensing agents. In International conference on autonomous agents and multi-agent systems, AAMAS \u201914, Paris, France, May 5\u20139, 2014 (pp. 549\u2013556)."},{"key":"9436_CR52","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. (2010). BnB-ADOPT: An asynchronous branch-and-bound DCOP algorithm. Artificial Intelligence Research (JAIR), 38, 85\u2013133.","journal-title":"Artificial Intelligence Research (JAIR)"},{"issue":"1\u20132","key":"9436_CR53","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., Xing, Z., Wang, G., & Wittenburg, L. (2005). Distributed stochastic search and distributed breakout: Properties, comparishon and applications to constraints optimization problems in sensor networks. Artificial Intelligence, 161(1\u20132), 55\u201388.","journal-title":"Artificial Intelligence"},{"key":"9436_CR54","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.artint.2014.03.002","volume":"211","author":"R Zivan","year":"2014","unstructured":"Zivan, R., Okamoto, S., & Peled, H. (2014). Explorative anytime local search for distributed constraint optimization. Artificial Intelligence, 211, 1\u201326.","journal-title":"Artificial Intelligence"},{"key":"9436_CR55","unstructured":"Zivan, R., & Peled, H. (2012). Max\/min\u2013sum distributed constraint optimization through value propagation on an alternating DAG. In AAMAS (pp. 265\u2013272)."},{"issue":"5","key":"9436_CR56","doi-asserted-by":"publisher","first-page":"1165","DOI":"10.1007\/s10458-017-9360-1","volume":"31","author":"R Zivan","year":"2017","unstructured":"Zivan, R., Parash, T., Cohen, L., Peled, H., & Okamoto, S. (2017). Balancing exploration and exploitation in incomplete min\/max-sum inference for distributed constraint optimization. Autonomous Agents and Multi-Agent Systems, 31(5), 1165\u20131207.","journal-title":"Autonomous Agents and Multi-Agent Systems"},{"key":"9436_CR57","unstructured":"Zivan, R., Parash, T., & Naveh, Y. (2015). Applying max-sum to asymmetric distributed constraint optimization. In Proceedings of the twenty-fourth international joint conference on artificial intelligence, IJCAI 2015, Buenos Aires, Argentina, July 25\u201331, 2015 (pp. 432\u2013439)."}],"container-title":["Autonomous Agents and Multi-Agent Systems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10458-019-09436-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10458-019-09436-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10458-019-09436-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,12,31]],"date-time":"2020-12-31T00:49:06Z","timestamp":1609375746000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10458-019-09436-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,1,1]]},"references-count":57,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2020,4]]}},"alternative-id":["9436"],"URL":"https:\/\/doi.org\/10.1007\/s10458-019-09436-8","relation":{},"ISSN":["1387-2532","1573-7454"],"issn-type":[{"type":"print","value":"1387-2532"},{"type":"electronic","value":"1573-7454"}],"subject":[],"published":{"date-parts":[[2020,1,1]]},"assertion":[{"value":"1 January 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}],"article-number":"13"}}