{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,26]],"date-time":"2026-02-26T15:25:12Z","timestamp":1772119512636,"version":"3.50.1"},"reference-count":40,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2023,9,14]],"date-time":"2023-09-14T00:00:00Z","timestamp":1694649600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,9,14]],"date-time":"2023-09-14T00:00:00Z","timestamp":1694649600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"name":"US-Israel Binational Science Foundation (BSF) grant","award":["2018081"],"award-info":[{"award-number":["2018081"]}]},{"name":"US-Israel Binational Science Foundation (BSF) grant","award":["2018081"],"award-info":[{"award-number":["2018081"]}]},{"name":"US-Israel Binational Science Foundation (BSF) grant","award":["2018081"],"award-info":[{"award-number":["2018081"]}]},{"name":"US-Israel Binational Science Foundation (BSF) grant","award":["1838364"],"award-info":[{"award-number":["1838364"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Auton Agent Multi-Agent Syst"],"published-print":{"date-parts":[[2023,12]]},"DOI":"10.1007\/s10458-023-09621-w","type":"journal-article","created":{"date-parts":[[2023,9,14]],"date-time":"2023-09-14T10:57:13Z","timestamp":1694689033000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Effect of asynchronous execution and imperfect communication on max-sum belief propagation"],"prefix":"10.1007","volume":"37","author":[{"given":"Roie","family":"Zivan","sequence":"first","affiliation":[]},{"given":"Ben","family":"Rachmut","sequence":"additional","affiliation":[]},{"given":"Omer","family":"Perry","sequence":"additional","affiliation":[]},{"given":"William","family":"Yeoh","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,9,14]]},"reference":[{"key":"9621_CR1","unstructured":"Rachmut, B., Zivan, R., & Yeoh, W. (2021). Latency-aware local search for distributed constraint optimization. In: Proceedings of the 20th international conference on autonomous agents and multiagent Systems, pp. 1019\u20131027."},{"issue":"6","key":"9621_CR2","doi-asserted-by":"publisher","first-page":"822","DOI":"10.1007\/s10458-018-9395-y","volume":"32","author":"Z Chen","year":"2018","unstructured":"Chen, Z., Deng, Y., Wu, T., & He, Z. (2018). A class of iterative refined max-sum algorithms via non-consecutive value propagation strategies. Autonomous Agents and Multi-Agent Systems, 32(6), 822\u2013860.","journal-title":"Autonomous Agents and Multi-Agent Systems"},{"key":"9621_CR3","doi-asserted-by":"crossref","unstructured":"Cohen, L., Galiki, R., & Zivan, R. (2020). Governing convergence of max-sum on dcops through damping and splitting. Artificial Intelligence Journal (AIJ), 279.","DOI":"10.1016\/j.artint.2019.103212"},{"key":"9621_CR4","volume-title":"Probabilistic reasoning in intelligent systems: networks of plausible inference","author":"J Pearl","year":"1988","unstructured":"Pearl, J. (1988). Probabilistic reasoning in intelligent systems: networks of plausible inference. San Francisco, California: Morgan Kaufmann."},{"key":"9621_CR5","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":"9621_CR6","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: Proceeding of the 7th international conference on autonomous agents and multi-agent systems (AAMAS), pp. 1697\u20131698."},{"key":"9621_CR7","unstructured":"Stranders, R., Farinelli, A., Rogers, A., Jennings, N. R. (2009). Decentralised coordination of mobile sensors using the max-sum algorithm. In: Proceedings of the 21st International Joint Conference on Artificial Intelligence, (IJCAI), pp. 299\u2013304."},{"issue":"9","key":"9621_CR8","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. Computer Journal, 53(9), 1447\u20131461.","journal-title":"Computer Journal"},{"key":"9621_CR9","unstructured":"Rust, P., Picard, G., & Ramparany, F. (2016). Using message-passing DCOP algorithms to solve energy-efficient smart environment configuration problems. In: Proceedings of the 25th international joint conference on artificial intelligence, (IJCAI), pp. 468\u2013474."},{"key":"9621_CR10","unstructured":"Farinelli, A., Rogers, A., Petcu, A., Jennings, N.R. (2008). Decentralised coordination of low-power embedded devices using the max-sum algorithm. In: Proceeding of the 7th International Conference on Autonomous Agents and Multi-Agent Systems (AAMAS), pp. 639\u2013646."},{"issue":"5","key":"9621_CR11","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. Journal of Autonomous Agents and Multi-Agent Systems (JAAMAS), 31(5), 1165\u20131207.","journal-title":"Journal of Autonomous Agents and Multi-Agent Systems (JAAMAS)"},{"issue":"9","key":"9621_CR12","doi-asserted-by":"publisher","first-page":"5860","DOI":"10.1109\/TIT.2013.2259576","volume":"59","author":"N Ruozzi","year":"2013","unstructured":"Ruozzi, N., & Tatikonda, S. (2013). Message-passing algorithms: Reparameterizations and splittings. IEEE Transactions on Information Theory, 59(9), 5860\u20135881.","journal-title":"IEEE Transactions on Information Theory"},{"key":"9621_CR13","doi-asserted-by":"crossref","unstructured":"Deng, Y., & An, B. (2020). Speeding up incomplete gdl-based algorithms for multi-agent optimization with dense local utilities. In: Proceedings of the 29th international joint conference on artificial intelligence, (IJCAI), pp. 31\u201338.","DOI":"10.24963\/ijcai.2020\/5"},{"key":"9621_CR14","unstructured":"Zivan, R., Perry, O., Rachmut, B., & Yeoh, W. (2021). The effect of asynchronous execution and message latency on max-sum. In: 27th International Conference on Principles and Practice of Constraint Programming (CP 2021). Schloss Dagstuhl-Leibniz-Zentrum f\u00fcr Informatik."},{"key":"9621_CR15","doi-asserted-by":"crossref","unstructured":"Zivan, R., Lev, O., & Galiki, R. (2020). Beyond trees: Analysis and convergence of belief propagation in graphs with multiple cycles. In: Proceedings of the 34th international conference of the association for the advancement of artificial intelligence (AAAI), pp. 7333\u20137340.","DOI":"10.1609\/aaai.v34i05.6227"},{"key":"9621_CR16","unstructured":"Murphy, K.P., Weiss, Y., & Jordan, M.I. (1999). Loopy belief propagation for approximate inference: An empirical study. In: UAI \u201999: proceedings of the fifteenth conference on uncertainty in artificial intelligence, Stockholm, Sweden, July 30\u2013August 1, 1999, pp. 467\u2013475."},{"issue":"1","key":"9621_CR17","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1162\/089976600300015880","volume":"12","author":"Y Weiss","year":"2000","unstructured":"Weiss, Y. (2000). Correctness of local probability propagation in graphical models with loops. Neural Computation, 12(1), 1\u201341.","journal-title":"Neural Computation"},{"key":"9621_CR18","doi-asserted-by":"crossref","unstructured":"Forney, G.D., Kschischang, F.R., Marcus, B., & Tuncel, S. (2001). Iterative decoding of tail-biting trellises and connections with symbolic dynamics. In: Marcus, B., Rosenthal, J. (eds.) Codes, systems, and graphical models, pp. 239\u2013264.","DOI":"10.1007\/978-1-4613-0165-3_13"},{"key":"9621_CR19","doi-asserted-by":"publisher","first-page":"11008","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, 11008.","journal-title":"Journal of Statistical Mechanics: Theory and Experiment"},{"issue":"2","key":"9621_CR20","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":"9621_CR21","unstructured":"Zivan, R., & Peled, H. (2012). Max\/min-sum distributed constraint optimization through value propagation on an alternating DAG. In: AAMAS, pp. 265\u2013272."},{"key":"9621_CR22","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":"9621_CR23","doi-asserted-by":"crossref","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.","DOI":"10.1007\/978-3-319-10428-7_47"},{"issue":"11","key":"9621_CR24","doi-asserted-by":"publisher","first-page":"1639","DOI":"10.1093\/comjnl\/bxy021","volume":"61","author":"MM Khan","year":"2018","unstructured":"Khan, M. M., Tran-Thanh, L., Ramchurn, S. D., & Jennings, N. R. (2018). Speeding up gdl-based message passing algorithms for large-scale dcops. The Computer Journal, 61(11), 1639\u20131666.","journal-title":"The Computer Journal"},{"key":"9621_CR25","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."},{"issue":"3","key":"9621_CR26","doi-asserted-by":"publisher","first-page":"337","DOI":"10.1007\/s10458-013-9225-1","volume":"28","author":"A Farinelli","year":"2014","unstructured":"Farinelli, A., Rogers, A., & Jennings, N. R. (2014). Agent-based decentralised coordination for sensor networks using the max-sum algorithm. Journal of Autonomous Agents and Multi-Agent Systems (JAAMAS), 28(3), 337\u2013380.","journal-title":"Journal of Autonomous Agents and Multi-Agent Systems (JAAMAS)"},{"issue":"16\u201317","key":"9621_CR27","doi-asserted-by":"publisher","first-page":"1457","DOI":"10.1016\/j.artint.2009.07.003","volume":"173","author":"R Marinescu","year":"2009","unstructured":"Marinescu, R., & Dechter, R. (2009). AND\/OR branch-and-bound search for combinatorial optimization in graphical models. Artificial Intelligence, 173(16\u201317), 1457\u20131491.","journal-title":"Artificial Intelligence"},{"key":"9621_CR28","doi-asserted-by":"publisher","first-page":"705","DOI":"10.1613\/jair.1.11400","volume":"64","author":"DT Nguyen","year":"2019","unstructured":"Nguyen, D. T., Yeoh, W., Lau, H. C., & Zivan, R. (2019). Distributed Gibbs: A linear-space sampling-based DCOP algorithm. Journal of Artificial Intelligence Research, 64, 705\u2013748.","journal-title":"Journal of Artificial Intelligence Research"},{"key":"9621_CR29","unstructured":"Petcu, A., & Faltings, B. (2005). A scalable method for multiagent constraint optimization. In: Proceedings of the 21st international joint conference on artificial intelligence, (IJCAI), pp. 266\u2013271."},{"key":"9621_CR30","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. Journal of Artificial Intelligence Research, 38, 85\u2013133.","journal-title":"Journal of Artificial Intelligence Research"},{"issue":"2","key":"9621_CR31","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"},{"issue":"1","key":"9621_CR32","doi-asserted-by":"publisher","first-page":"13","DOI":"10.1007\/s10458-019-09436-8","volume":"34","author":"R Zivan","year":"2020","unstructured":"Zivan, R., Parash, T., Cohen-Lavi, L., & Naveh, Y. (2020). Applying max-sum to asymmetric distributed constraint optimization problems. Journal of Autonomous Agents and Multi Agent Systems (JAAMAS), 34(1), 13.","journal-title":"Journal of Autonomous Agents and Multi Agent Systems (JAAMAS)"},{"key":"9621_CR33","doi-asserted-by":"publisher","first-page":"415","DOI":"10.1007\/s10472-006-9033-2","volume":"46","author":"R Zivan","year":"2006","unstructured":"Zivan, R., & Meisels, A. (2006). Message delay and discsp search algorithms. Annals of Mathematics and Artificial Intelligence (AMAI), 46, 415\u2013439.","journal-title":"Annals of Mathematics and Artificial Intelligence (AMAI)"},{"key":"9621_CR34","doi-asserted-by":"publisher","first-page":"186","DOI":"10.1016\/j.artint.2012.09.002","volume":"193","author":"A Netzer","year":"2012","unstructured":"Netzer, A., Grubshtein, A., & Meisels, A. (2012). Concurrent forward bounding for distributed constraint optimization problems. Artificial Intelligence Journal (AIJ), 193, 186\u2013216.","journal-title":"Artificial Intelligence Journal (AIJ)"},{"key":"9621_CR35","doi-asserted-by":"crossref","unstructured":"Cohen, E., Zivan, R., & Lev, O. (2023). Separate but equal: Equality in belief propagation for single cycle graphs. In: Proceedings of the 36th international conference of the association for the advancement of artificial intelligence (AAAI).","DOI":"10.1609\/aaai.v37i4.25506"},{"key":"9621_CR36","doi-asserted-by":"crossref","unstructured":"Mayuga-Marcillo, L., Urquiza-Aguiar, L., & Paredes-Paredes, M. (2018). Wireless Channel 802.11 in NS-3","DOI":"10.20944\/preprints201809.0367.v1"},{"key":"9621_CR37","doi-asserted-by":"crossref","unstructured":"Amewuda, A.B., Katsriku, F.A., & Abdulai, J.-D. (2018). Implementation and evaluation of wlan 802.11ac for residential networks in ns-3. Journal of Computer Networks and Communications, 2018.","DOI":"10.1155\/2018\/3518352"},{"issue":"1\u20132","key":"9621_CR38","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"},{"issue":"5439","key":"9621_CR39","doi-asserted-by":"publisher","first-page":"509","DOI":"10.1126\/science.286.5439.509","volume":"286","author":"A-L Barab\u00e1si","year":"1999","unstructured":"Barab\u00e1si, A.-L., & Albert, R. (1999). Emergence of scaling in random networks. Science, 286(5439), 509\u2013512.","journal-title":"Science"},{"key":"9621_CR40","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."}],"container-title":["Autonomous Agents and Multi-Agent Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10458-023-09621-w.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10458-023-09621-w\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10458-023-09621-w.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,12,17]],"date-time":"2023-12-17T23:54:55Z","timestamp":1702857295000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10458-023-09621-w"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,9,14]]},"references-count":40,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2023,12]]}},"alternative-id":["9621"],"URL":"https:\/\/doi.org\/10.1007\/s10458-023-09621-w","relation":{"has-preprint":[{"id-type":"doi","id":"10.21203\/rs.3.rs-2611342\/v1","asserted-by":"object"}]},"ISSN":["1387-2532","1573-7454"],"issn-type":[{"value":"1387-2532","type":"print"},{"value":"1573-7454","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,9,14]]},"assertion":[{"value":"27 July 2023","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"14 September 2023","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors declare no competing interests.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}},{"value":"Not applicable.","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"Ethical approval"}}],"article-number":"40"}}