{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,23]],"date-time":"2025-10-23T05:30:58Z","timestamp":1761197458781},"reference-count":44,"publisher":"Springer Science and Business Media LLC","issue":"5","license":[{"start":{"date-parts":[[2017,3,10]],"date-time":"2017-03-10T00:00:00Z","timestamp":1489104000000},"content-version":"unspecified","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":[[2017,9]]},"DOI":"10.1007\/s10458-017-9360-1","type":"journal-article","created":{"date-parts":[[2017,3,10]],"date-time":"2017-03-10T13:56:59Z","timestamp":1489154219000},"page":"1165-1207","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":24,"title":["Balancing exploration and exploitation in incomplete Min\/Max-sum inference for distributed constraint optimization"],"prefix":"10.1007","volume":"31","author":[{"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","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hilla","family":"Peled","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Steven","family":"Okamoto","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2017,3,10]]},"reference":[{"issue":"2","key":"9360_CR1","doi-asserted-by":"crossref","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":"9360_CR2","unstructured":"Arshad, M., & Silaghi, M. C. (2004). Distributed simulated annealing. Distributed constraint problem solving and reasoning in multi-agent systems, frontiers in artificial intelligence and applications series, 112 November 2004."},{"issue":"1\u20132","key":"9360_CR3","doi-asserted-by":"crossref","first-page":"117","DOI":"10.1016\/j.artint.2004.09.002","volume":"161","author":"R Bejar","year":"2005","unstructured":"Bejar, R., Domshlak, C., Fernandez, C., Gomes, K., Krishnamachari, B., Selman, B., et al. (2005). Sensor networks and distributed CSP: Communication, computation and complexity. Artificial Intelligence, 161(1\u20132), 117\u2013148.","journal-title":"Artificial Intelligence"},{"key":"9360_CR4","unstructured":"Brito, I., & Meseguer, P. (2010). Improving dpop with function filtering. In AAMAS (pp. 141\u2013148)."},{"issue":"2","key":"9360_CR5","doi-asserted-by":"crossref","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"},{"issue":"1\u20132","key":"9360_CR6","doi-asserted-by":"crossref","first-page":"41","DOI":"10.1016\/S0004-3702(99)00059-4","volume":"113","author":"R Dechter","year":"1999","unstructured":"Dechter, R. (1999). Bucket elimination: A unifying framework for reasoning. Artificial Intelligence, 113(1\u20132), 41\u201385.","journal-title":"Artificial Intelligence"},{"key":"9360_CR7","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":"9360_CR8","unstructured":"Gershman, A., Grubshtein, A., Rokach, L., Meisels, A., & Zivan, R. (2008). Scheduling meetings by agents. In DCR workshop at AAMAS 2008, Estoril, Portugal, May."},{"key":"9360_CR9","doi-asserted-by":"crossref","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":"9360_CR10","unstructured":"Globerson, A., & Jaakkola, T. (2007). Fixing max-product: Convergent message passing algorithms for map lp-relaxations. In NIPS."},{"key":"9360_CR11","unstructured":"Hatano, D., & Hirayama, K. (2013). Deqed: An efficient divide-and-coordinate algorithm for dcop. In IJCAI."},{"issue":"12","key":"9360_CR12","doi-asserted-by":"crossref","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-dual message-passing for approximate inference. IEEE Transactions on Information Theory, 56(12), 6294\u20136316.","journal-title":"IEEE Transactions on Information Theory"},{"issue":"4\u20135","key":"9360_CR13","doi-asserted-by":"crossref","first-page":"287","DOI":"10.1007\/s10732-006-8248-z","volume":"12","author":"F Heras","year":"2006","unstructured":"Heras, F., & Larrosa, J. (2006). Intelligent variable orderings and re-orderings in dac-based solvers for WCSP. Journal of Heuristics, 12(4\u20135), 287\u2013306.","journal-title":"Journal of Heuristics"},{"key":"9360_CR14","doi-asserted-by":"crossref","unstructured":"Hirayama, K., & Yokoo, M. (2000). An approach to over-constrained distributed constraint satisfaction problems: Distributed hierarchical constraint satisfaction. In Proceedings of the third international joint conference on autonomous agents and multiagent systems (pp. 135\u2013142).","DOI":"10.1109\/ICMAS.2000.858445"},{"key":"9360_CR15","doi-asserted-by":"crossref","unstructured":"Khot, S. (2002). On the power of unique 2-prover 1-round games. In Proceedings of the thirty-fourth annual ACM symposium on theory of computing (pp. 767\u2013775).","DOI":"10.1145\/509907.510017"},{"key":"9360_CR16","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":"9360_CR17","doi-asserted-by":"crossref","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":"9360_CR18","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/j.artint.2004.05.004","volume":"159","author":"J Larrosa","year":"2004","unstructured":"Larrosa, J., & Schiex, T. (2004). Solving weighted csp by maintaining arc consistency. Artificial Intelligence, 159, 1\u201326.","journal-title":"Artificial Intelligence"},{"key":"9360_CR19","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":"9360_CR20","unstructured":"Maheswaran, R. T., Pearce, J. P., & Tambe, M. (2004). Distributed algorithms for dcop: A graphical-game-based approach. In PDCS) (pp. 432\u2013439), September 2004."},{"key":"9360_CR21","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 (pp. 310\u2013317)."},{"issue":"1\u20132","key":"9360_CR22","doi-asserted-by":"crossref","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":"9360_CR23","doi-asserted-by":"crossref","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, 193, 186\u2013216.","journal-title":"Artificial Intelligence"},{"key":"9360_CR24","doi-asserted-by":"crossref","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 6876 (pp. 660\u2013674).","DOI":"10.1007\/978-3-642-23786-7_50"},{"key":"9360_CR25","unstructured":"Pearce, J. P., & Tambe, M. (2007). Quality guarantees on k-optimal solutions for distributed constraint optimization problems. In IJCAI (pp. 1446\u20131451), Hyderabad, India, January 2007."},{"key":"9360_CR26","unstructured":"Petcu, A., & Faltings, B. (2005). A scalable method for multiagent constraint optimization. In IJCAI (pp. 266\u2013271)."},{"key":"9360_CR27","doi-asserted-by":"crossref","unstructured":"Petcu, A., & Faltings, B. (2005). Approximations in distributed optimization. In P. van Beek (Ed.), CP 2005, LNCS 3709 (pp. 802\u2013806).","DOI":"10.1007\/11564751_68"},{"issue":"9","key":"9360_CR28","doi-asserted-by":"crossref","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"},{"key":"9360_CR29","volume-title":"Modern heuristic techniques for combinatorial problems","year":"1993","unstructured":"Reeves, C. R. (Ed.). (1993). Modern heuristic techniques for combinatorial problems. New York, NY: Wiley."},{"issue":"2","key":"9360_CR30","doi-asserted-by":"crossref","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":"9360_CR31","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":"9360_CR32","doi-asserted-by":"crossref","unstructured":"Smith, M., & Mailler, R. (2010). Getting what you pay for: Is exploration in distributed hill climbing really worth it? In IAT (pp. 319\u2013326).","DOI":"10.1109\/WI-IAT.2010.31"},{"key":"9360_CR33","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":"9360_CR34","unstructured":"Stranders, R., Farinelli, A., Rogers, A., & Jennings, N. R. (2009). Decentralized coordination of continuously valued control parameters using the max-sum algorithm. In AAMAS (pp. 601\u2013608)."},{"key":"9360_CR35","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":"9360_CR36","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":"9360_CR37","doi-asserted-by":"crossref","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":"9360_CR38","unstructured":"Vinyals, M., Shieh, E., Cerquides, J., Rodriguez-Aguilar, J. A., Yin, Z., Tambe, M., & Bowring, E. (2011). Quality guarantees for region optimal dcop algorithms. In AAMAS (pp. 133\u2013140). Tapei."},{"key":"9360_CR39","first-page":"1887","volume":"7","author":"C Yanover","year":"2006","unstructured":"Yanover, C., Meltzer, T., & Weiss, Y. (2006). Linear programming relaxations and belief propagation: An empirical study. Journal of Machine Learning Research, 7, 1887\u20131907.","journal-title":"Journal of Machine Learning Research"},{"key":"9360_CR40","doi-asserted-by":"crossref","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":"9360_CR41","doi-asserted-by":"crossref","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":"9360_CR42","doi-asserted-by":"crossref","unstructured":"Zivan, R., Okamoto, S., & Peled, H. (2014). Explorative anytime local search for distributed constraint optimization. Artificial Intelligence, 212, 1\u201326.","DOI":"10.1016\/j.artint.2014.03.002"},{"key":"9360_CR43","unstructured":"Zivan, R., & Peled, H. (2012). Max\/min-sum distributed constraint optimization through value propagation on an alternating DAG. In AAMAS (pp. 265\u2013272)."},{"issue":"3","key":"9360_CR44","doi-asserted-by":"crossref","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. P. (2015). Distributed constraint optimization for teams of mobile sensing agents. Autonomous Agents and Multi-Agent Systems, 29(3), 495\u2013536.","journal-title":"Autonomous Agents and Multi-Agent Systems"}],"container-title":["Autonomous Agents and Multi-Agent Systems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10458-017-9360-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10458-017-9360-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10458-017-9360-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,9,19]],"date-time":"2019-09-19T15:43:14Z","timestamp":1568907794000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10458-017-9360-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,3,10]]},"references-count":44,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2017,9]]}},"alternative-id":["9360"],"URL":"https:\/\/doi.org\/10.1007\/s10458-017-9360-1","relation":{},"ISSN":["1387-2532","1573-7454"],"issn-type":[{"value":"1387-2532","type":"print"},{"value":"1573-7454","type":"electronic"}],"subject":[],"published":{"date-parts":[[2017,3,10]]}}}