{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T07:44:50Z","timestamp":1740123890049,"version":"3.37.3"},"reference-count":44,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2021,4,20]],"date-time":"2021-04-20T00:00:00Z","timestamp":1618876800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,4,20]],"date-time":"2021-04-20T00:00:00Z","timestamp":1618876800000},"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":["Ann Math Artif Intell"],"published-print":{"date-parts":[[2022,1]]},"DOI":"10.1007\/s10472-021-09735-5","type":"journal-article","created":{"date-parts":[[2021,4,20]],"date-time":"2021-04-20T10:35:46Z","timestamp":1618914946000},"page":"31-73","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Integrating domain and constraint privacy reasoning in the distributed stochastic algorithm with breakouts"],"prefix":"10.1007","volume":"90","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-1539-9846","authenticated-orcid":false,"given":"Julien","family":"Vion","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ren\u00e9","family":"Mandiau","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sylvain","family":"Piechowiak","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Marius","family":"Silaghi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2021,4,20]]},"reference":[{"doi-asserted-by":"publisher","unstructured":"Adam, N.R., Worthmann, J.C.: Security-control methods for statistical databases: A comparative study. In: ACM Computing Surveys. issn: 0360-0300. https:\/\/doi.org\/10.1145\/76894.76895, vol. 21.4, pp 515\u2013556 (1989)","key":"9735_CR1","DOI":"10.1145\/76894.76895"},{"unstructured":"Arshad, M., Silaghi, M.C.: Distributed simulated annealing. In: Distributed Constraint Problem Solving and Reasoning in Multi-Agent Systems, p 112 (2004)","key":"9735_CR2"},{"unstructured":"Bon\u00e9r, J., The Akka Team at Lightbend: Akka: Build powerful reactive, concurrent, and distributed applications more easily. akka.io (2009)","key":"9735_CR3"},{"doi-asserted-by":"crossref","unstructured":"Brito, I., Meisels, A., Meseguer, P., Zivan, R.: Distributed constraint satisfaction with partially known constraints. In: Constraints, vol. 14.2, pp 199\u2013234 (2009)","key":"9735_CR4","DOI":"10.1007\/s10601-008-9048-x"},{"unstructured":"Collin, Z., Dechter, R., Katz, S.: On the feasibility of distributed constraint satisfaction. In: Mylopoulos, J., Reiter, R. (eds.) Proceedings of the 12th International Joint Conference on Artificial Intelligence. Sydney, Australia, August 24-30, 1991, pp 318\u2013324. Morgan Kaufmann, Burlington (1991)","key":"9735_CR5"},{"doi-asserted-by":"crossref","unstructured":"Cr\u00e9pin, L., Demazeau, Y., Boissier, O., Jacquenet, F.: Privacy preservation in a decentralized calendar system. In: Proc. 7th Itl Conf on Practical Applications of Agents and Multi-Agent Systems (PAAMS). vol. 55. Advances in Intelligent and Soft Computing, pp 529\u2013537 (2009)","key":"9735_CR6","DOI":"10.1007\/978-3-642-00487-2_56"},{"doi-asserted-by":"crossref","unstructured":"Doshi, P., Matsui, T., Silaghi, M., Yokoo, M., Zanker, M.: Distributed private constraint optimization. In: Proc. IEEE\/WIC\/ACM Itl Conf on Intelligent Agent Technology, pp 277\u2013281. IEEE Computer Society, Washington (2008)","key":"9735_CR7","DOI":"10.1109\/WIIAT.2008.426"},{"doi-asserted-by":"crossref","unstructured":"Faltings, B., L\u00e9aut\u00e9, T., Petcu, A.: Privacy guarantees through distributed constraint satisfaction. In: Proc. IEEE\/WIC\/ACM Itl Conf on Intelligent Agent Technology, vol. 2, pp 350\u2013358. IEEE Computer Society, Washington (2008)","key":"9735_CR8","DOI":"10.1109\/WIIAT.2008.177"},{"doi-asserted-by":"crossref","unstructured":"Faltings, B., Macho-Gonzalez, S.: Open constraint programming. In: Artificial Intelligence 161.1. Distributed Constraint Satisfaction. issn: 0004-3702, pp 181\u2013208 (2005)","key":"9735_CR9","DOI":"10.1016\/j.artint.2004.10.005"},{"unstructured":"Fluckiger, A., Verman, M., Berstein, A.: Improving approximate algorithms for dcops using ranks. In: International Workshop on Optimisation in Multi-Agent Systems, Singapore (2016)","key":"9735_CR10"},{"unstructured":"Freuder, E.C., Minca, M., Wallace, R.J.: Privacy\/efficiency tradeoffs in distributed meeting scheduling by constraint-based agents. In: IJCAI Workshop on Distributed Constraint Reasoning, pp. 63\u201372 (2001)","key":"9735_CR11"},{"doi-asserted-by":"crossref","unstructured":"Galinier, P., Hao, J. K.: A general approach for constraint solving by local search. In: Journal of Mathematical Modelling and Algorithms 3, vol. 1, pp 73\u201388 (2004)","key":"9735_CR12","DOI":"10.1023\/B:JMMA.0000026709.24659.da"},{"doi-asserted-by":"crossref","unstructured":"Greenstadt, R., Grosz, B., Smith, M.D.: SSDPOP: Improving the privacy of DCOP with secret sharing. In: Proc. of the 6th Itl joint conference on Autonomous agents and multiagent systems. IFAAMAS, p 171 (2007)","key":"9735_CR13","DOI":"10.1145\/1329125.1329333"},{"unstructured":"Greenstadt, R., Pearce, J.P., Tambe, M.: Analysis of privacy loss in distributed constraint optimization. In: Proc 21st Nat. Conf. on Artificial Intelligence and the 18th Innovative Applications of Artificial Intelligence Conf, pp 647\u2013653. AAAI Press (2006)","key":"9735_CR14"},{"unstructured":"Grinshpoun, T.: When You Say (DCOP) Privacy, What Do Mean? - Categorization of DCOP Privacy and Insights on Internal Constraint Privacy. In: Joaquim, F., Fred, A.L.N. (eds.) Proc. of the 4Th Itl Conference on Agents and Artificial Intelligence (ICAART), pp 380\u2013386. SciTePress, Portugal (2012)","key":"9735_CR15"},{"doi-asserted-by":"crossref","unstructured":"Grinshpoun, T., Grubshtein, A., Zivan, R., Netzer, A., Meisels, A.: Asymmetric Distributed Constraint Optimization Problems. In: Journal of Artificial Intelligence Research, vol. 47, pp 613\u2013647 (2013)","key":"9735_CR16","DOI":"10.1613\/jair.3945"},{"doi-asserted-by":"crossref","unstructured":"Grinshpoun, T., Tassa, T.: P-SyncBB: A privacy preserving branch and bound dcop algorithm. In: Journal of Artificial Intelligence Research (JAIR), vol. 57, pp 621\u2013660 (2016)","key":"9735_CR17","DOI":"10.1613\/jair.5322"},{"doi-asserted-by":"crossref","unstructured":"Grinshpoun, T., Tassa, T., Levit, V., Zivan, R.: Privacy preserving region optimal algorithms for symmetric and asymmetric DCOPs. In: Artificial Intelligence, vol. 266, pp 27\u201350 (2019)","key":"9735_CR18","DOI":"10.1016\/j.artint.2018.08.002"},{"unstructured":"Hamadi, Y., Bessiere, C., Quinqueton, J.: Backtracking in Distributed Constraint Networks. In: Proc. of 13Th European Conf. on Artificial Intelligence (ECAI). Brighton, UK, pp 219\u2013223 (1998)","key":"9735_CR19"},{"doi-asserted-by":"crossref","unstructured":"Hebrard, E., Marx, D., O\u2019Sullivan, B., Razgon, I.: Soft constraints of difference and equality. In: Journal of Artificial Intelligence Research. issn: 1076\u20139757, vol. 41.2, pp 97\u2013130 (2011)","key":"9735_CR20","DOI":"10.1613\/jair.3197"},{"unstructured":"Hewitt, C., Bishop, P., Steiger, R.: A universal modular ACTOR formalism for artificial intelligence (1973)","key":"9735_CR21"},{"doi-asserted-by":"crossref","unstructured":"Hirayama, K., Yokoo, M.: Distributed Partial Constraint Satisfaction Problem, Principles and Practice of Constraint Programming -. In: CP97, Third International Conference, Linz, Austria, October 29 - November 1 1997 Proceedings. Ed. by Gert Smolka. vol. 1330 Lecture Notes in Computer Science, pp 222\u2013236. Springer (1997)","key":"9735_CR22","DOI":"10.1007\/BFb0017442"},{"doi-asserted-by":"crossref","unstructured":"Hirayama, K., Yokoo, M.: The distributed breakout algorithms. In: Artificial Intelligence, vol. 161.1-2, pp 89\u2013115 (2005)","key":"9735_CR23","DOI":"10.1016\/j.artint.2004.08.004"},{"doi-asserted-by":"crossref","unstructured":"L\u00e9aut\u00e9, T., Faltings, B.: Protecting privacy through distributed computation in multi-agent decision making. In: Journal Artificial Intelligence Research (JAIR), vol. 47, pp 649\u2013695 (2013)","key":"9735_CR24","DOI":"10.1613\/jair.3983"},{"unstructured":"Maheswaran, R.T., Pearce, J.P., Tambe, M.: Distributed algorithms for DCOP: A graphical-game-based approach. In: Proceedings of ISCA 17th PDCS, pp 432\u2013439 (2004)","key":"9735_CR25"},{"doi-asserted-by":"crossref","unstructured":"Mairy, J.-B., Deville, Y., Lecoutre, C.: The smart table constraint. In: Michel, L. (ed.) Proc. 12th CPAIOR. isbn: 978-3-319-18008-3, pp 271\u2013287. Springer International Publishing, New York (2015)","key":"9735_CR26","DOI":"10.1007\/978-3-319-18008-3_19"},{"doi-asserted-by":"crossref","unstructured":"Minton, S., Johnston, M. D., Philips, A. B., Laird, P.: Minimizing conicts: A heuristic repair method for constraint-satisfaction and scheduling problems. In: Artificial Intelligence, vol. 58.1-3, pp 161\u2013205 (1992)","key":"9735_CR27","DOI":"10.1016\/0004-3702(92)90007-K"},{"unstructured":"Morris, P.: The breakout method for escaping from local minima. In: Proceedings of AAAI\u201993, pp 40\u201345 (1993)","key":"9735_CR28"},{"unstructured":"Okamoto, S., Zivan, R., Nahon, A.: Distributed Breakout: Beyond Satisfaction. In: Proc. 25th IJCAI, pp 447\u2013453 (2016)","key":"9735_CR29"},{"unstructured":"Petcu, A, Faltings, B: A scalable method for multiagent constraint optimization. In: Kaelbling, LP, Saffiotti, A (eds.) IJCAI-05, Proceedings of the Nineteenth International Joint Conference on Artificial Intelligence, Edinburgh, Scotland, UK, July 30 - August 5, 2005, pp 266\u2013271. Professional Book Center (2005)","key":"9735_CR30"},{"doi-asserted-by":"crossref","unstructured":"Savaux, J., Vion, J., Piechowiak, S., Mandiau, R., Matsui, T., Hirayama, K., Yokoo, M., Elmane, S., Silaghi, M.: Privacy stochastic games in distributed constraint reasoning. In: Annals of Mathematics and Artificial Intelligence, vol. 88.7, pp 691\u2013715 (2020)","key":"9735_CR31","DOI":"10.1007\/s10472-019-09628-8"},{"unstructured":"Savaux, J., Vion, J., Piechowiak, S., Mandiau, R., Matsui, T., Hirayama, K., Yokoo, M., Elmane, S., Silaghi, M.: Utilitarian approach to privacy in distributed constraint optimization problems. In: Proc. 30th FLAIRS, pp 454\u2013459 (2017)","key":"9735_CR32"},{"unstructured":"Silaghi, M., Mitra, D.: Distributed constraint satisfaction and optimization with privacy enforcement. In: Intelligent Agent Technology (IAT), pp 531\u2013535. IEEE (2004)","key":"9735_CR33"},{"doi-asserted-by":"publisher","unstructured":"Sweeney, L.: K-anonymity: A model for protecting privacy. In: International Journal of Uncertainty, Fuzziness and Knowledge-Based Systems. issn: 0218-4885. https:\/\/doi.org\/10.1142\/S0218488502001648, vol. 10.5, pp 557\u2013570 (2002)","key":"9735_CR34","DOI":"10.1142\/S0218488502001648"},{"doi-asserted-by":"crossref","unstructured":"Tassa, T., Zivan, R., Grinshpoun, T.: Privacy preserving implementation of the max-sum algorithm and its variances. In: JAIR, vol. 59, pp 311\u2013349 (2017)","key":"9735_CR35","DOI":"10.1613\/jair.5504"},{"unstructured":"Vion, J.: Concrete: A CSP Solving API for the JVM. http:\/\/github.com\/concretecp(2006)","key":"9735_CR36"},{"unstructured":"Vion, J., Mandiau, R., Piechowiak, S., Silaghi, M.C.: Privacy for the distributed stochastic algorithm with breakouts. In: Proc. Itl Symposium on Artificial Intelligence and Mathematics (ISAIM) (2020)","key":"9735_CR37"},{"doi-asserted-by":"crossref","unstructured":"Wallace, R.J., Freuder, E.C.: Anytime Algorithms for Constraint Satisfaction and SAT Problems. In: ACM SIGART Bulletin, vol. 7.2, pp 7\u201310 (1996)","key":"9735_CR38","DOI":"10.1145\/242587.242589"},{"unstructured":"Walsh, T.: Stochastic constraint programming. In: Proceedings of the 15th european conference on artificial intelligence, pp 111\u2013115. IOS Press (2002)","key":"9735_CR39"},{"doi-asserted-by":"crossref","unstructured":"Yokoo, M., Durfee, E.H., Ishida, T., Kuwabara, K.: The distributed constraint satisfaction problem: formalization and algorithms. In: IEEE Transactions on Knowledge and Data Engineering, vol. 10.5, pp 673\u2013685 (1998)","key":"9735_CR40","DOI":"10.1109\/69.729707"},{"unstructured":"Yokoo, M., Hirayama, K.: Distributed breakout algorithm for solving distributed constraint satisfaction problems. In: Proc. of the 2nd Itl Conf on Multi-Agent Systems, pp 401\u2013408. AAAI Press (1996)","key":"9735_CR41"},{"unstructured":"Zhang, W., Wang, G., Wittenburg, L.: Distributed stochastic search for constraint satisfaction and optimization: Parallelism, phase transitions and performance. In: Proceedings of AAAI Workshop on Probabilistic Approaches in Search. Alberta, Canada (2002)","key":"9735_CR42"},{"doi-asserted-by":"crossref","unstructured":"Zhang, W., Wang, G., Xing, Z., Wittenburg, L.: Distributed stochastic search and distributed breakout: Properties, comparison and applications to constraint optimization problems in sensor networks. In: Artificial Intelligence, vol. 161.1-2, pp 55\u201387 (2005)","key":"9735_CR43","DOI":"10.1016\/j.artint.2004.10.004"},{"doi-asserted-by":"crossref","unstructured":"Zivan, R., Okamoto, S., Peled, H.: Explorative anytime local search for distributed constraint optimization. In: Artificial Intelligence, vol. 212, pp 1\u201326 (2014)","key":"9735_CR44","DOI":"10.1016\/j.artint.2014.03.002"}],"container-title":["Annals of Mathematics and Artificial Intelligence"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10472-021-09735-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10472-021-09735-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10472-021-09735-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,1,19]],"date-time":"2022-01-19T00:16:46Z","timestamp":1642551406000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10472-021-09735-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,4,20]]},"references-count":44,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2022,1]]}},"alternative-id":["9735"],"URL":"https:\/\/doi.org\/10.1007\/s10472-021-09735-5","relation":{},"ISSN":["1012-2443","1573-7470"],"issn-type":[{"type":"print","value":"1012-2443"},{"type":"electronic","value":"1573-7470"}],"subject":[],"published":{"date-parts":[[2021,4,20]]},"assertion":[{"value":"1 March 2021","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"20 April 2021","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}