{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T23:46:26Z","timestamp":1740181586189,"version":"3.37.3"},"reference-count":104,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2021,5,11]],"date-time":"2021-05-11T00:00:00Z","timestamp":1620691200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2021,5,11]],"date-time":"2021-05-11T00:00:00Z","timestamp":1620691200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"name":"Samsung Electronics R&D Institute UK"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["SN COMPUT. SCI."],"published-print":{"date-parts":[[2021,7]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>Distributed multi-agent agreement problems (MAPs) are central to many multi-agent systems. However, to date, the issues associated with encounters between self-interested and privacy-preserving agents have received limited attention. Given this, we develop the first distributed negotiation mechanism that enables self-interested agents to reach a socially desirable agreement with limited information leakage. The agents\u2019 optimal negotiation strategies in this mechanism are investigated. Specifically, we propose a reinforcement learning-based approach to train agents to learn their optimal strategies in the proposed mechanism. Also, a heuristic algorithm is designed to find close-to-optimal negotiation strategies with reduced computational costs. We demonstrate the effectiveness and strength of our proposed mechanism through both game theoretical and numerical analysis. We prove theoretically that the proposed mechanism is budget balanced and motivates the agents to participate and follow the rules faithfully. The experimental results confirm that the proposed mechanism significantly outperforms the current state of the art, by increasing the social-welfare and decreasing the privacy leakage.<\/jats:p>","DOI":"10.1007\/s42979-021-00650-4","type":"journal-article","created":{"date-parts":[[2021,5,11]],"date-time":"2021-05-11T14:08:07Z","timestamp":1620742087000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["A Faithful Mechanism for Incremental Multi-Agent Agreement Problems with Self-Interested and Privacy-Preserving Agents"],"prefix":"10.1007","volume":"2","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-1201-3074","authenticated-orcid":false,"given":"Farzaneh","family":"Farhadi","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Nicholas R.","family":"Jennings","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2021,5,11]]},"reference":[{"key":"650_CR1","first-page":"11591","volume":"32","author":"JD Abernethy","year":"2019","unstructured":"Abernethy JD, Cummings R, Kumar B, Taggart S, Morgenstern JH. Learning auctions with robust incentive guarantees. Adv Neural Inf Process Syst. 2019;32:11591\u2013601.","journal-title":"Adv Neural Inf Process Syst"},{"key":"650_CR2","doi-asserted-by":"publisher","first-page":"857","DOI":"10.1016\/j.engappai.2006.10.004","volume":"20","author":"A BenHassine","year":"2007","unstructured":"BenHassine A, Ho TB. An agent-based approach to solve dynamic meeting scheduling problems with preferences. Eng Appl Artif Intell. 2007;20:857\u201373.","journal-title":"Eng Appl Artif Intell"},{"issue":"3","key":"650_CR3","doi-asserted-by":"publisher","first-page":"867","DOI":"10.3982\/TE1529","volume":"10","author":"M Bhargava","year":"2015","unstructured":"Bhargava M, Majumdar D, Sen A. Incentive-compatible voting rules with positively correlated beliefs. Theoretical Economics. 2015;10(3):867\u201385.","journal-title":"Theoretical Economics"},{"key":"650_CR4","unstructured":"Bichler, M.: A roadmap to auction-based negotiation protocols for electronic commerce. In: Proceedings of the 33rd annual Hawaii international conference on system sciences; 2000."},{"key":"650_CR5","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1023\/A:1011489402739","volume":"1","author":"K Binmore","year":"1999","unstructured":"Binmore K, Vulkan N. Applying game theory to automated negotiation. Netnomics. 1999;1:1\u20139.","journal-title":"Netnomics"},{"key":"650_CR6","doi-asserted-by":"crossref","unstructured":"Bogliolo A, Polidori P, Aldini A, Moreira W, Mendes P, Yildiz M, Ballester C, Seigneur J. Virtual currency and reputation-based cooperation incentives in user-centric networks. In: 8th international wireless communications and mobile computing conference (IWCMC); 2012, p. 895\u2013900.","DOI":"10.1109\/IWCMC.2012.6314323"},{"key":"650_CR7","doi-asserted-by":"publisher","DOI":"10.1093\/acprof:oso\/9780199734023.001.0001","volume-title":"An introduction to the theory of mechanism design","author":"T Borgers","year":"2015","unstructured":"Borgers T, Krahmer D, Strausz R. An introduction to the theory of mechanism design. Oxford: Oxford University Press; 2015."},{"key":"650_CR8","unstructured":"Brito I, Meseguer P. Privacy in distributed meeting scheduling. In: Proceedings of the 11th conference on artificial intelligence research and development; 2008, p. 118\u201327."},{"issue":"3","key":"650_CR9","doi-asserted-by":"publisher","first-page":"285","DOI":"10.1080\/15501320701260816","volume":"4","author":"RR Brooks","year":"2008","unstructured":"Brooks RR. Distributed sensor networks: a multiagent perspective. Int J Distrib Sens Netw. 2008;4(3):285.","journal-title":"Int J Distrib Sens Netw"},{"issue":"2","key":"650_CR10","doi-asserted-by":"publisher","first-page":"314","DOI":"10.1287\/opre.2016.1544","volume":"65","author":"E Budish","year":"2017","unstructured":"Budish E, Cachon G, Kessler J, Othman A. Course match: a large-scale implementation of approximate competitive equilibrium from equal incomes for combinatorial allocation. Oper Res. 2017;65(2):314\u201336.","journal-title":"Oper Res"},{"key":"650_CR11","unstructured":"Bui HH, Venkatesh S, Kieronska D. A multi-agent incremental negotiation scheme for meetings scheduling. In: Proceedings of Third Australian and New Zealand conference on intelligent information systems. ANZIIS-95; 1995, p. 175\u2013180."},{"key":"650_CR12","doi-asserted-by":"crossref","unstructured":"Buttyan L, Hubaux JP. Nuglets: a virtual currency to stimulate cooperation in self-organized mobile ad hoc networks. Technical report; 2001.","DOI":"10.1109\/35.894385"},{"key":"650_CR13","doi-asserted-by":"crossref","unstructured":"Chen Z, Wu T, Deng Y, Zhang C. An ant-based algorithm to solve distributed constraint optimization problems. In: AAAI; 2018.","DOI":"10.1609\/aaai.v32i1.11580"},{"issue":"1","key":"650_CR14","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/S1474-0346(03)00019-3","volume":"17","author":"HW Chun","year":"2003","unstructured":"Chun HW, Wong RY. N$$^*$$ an agent-based negotiation algorithm for dynamic scheduling and rescheduling. Adv Eng Inform. 2003;17(1):1\u201322.","journal-title":"Adv Eng Inform"},{"key":"650_CR15","unstructured":"Crawford E, Veloso M. Mechanism design for multi-agent meeting scheduling including time preferences, availability, and value of presence. In: Proceedings. IEEE\/WIC\/ACM international conference on intelligent agent technology, 2004. (IAT 2004); 2004, p. 253\u2013259."},{"key":"650_CR16","doi-asserted-by":"crossref","unstructured":"Crawford E, Veloso M. Negotiation in semi-cooperative agreement problems. In: 2008 IEEE\/WIC\/ACM international conference on web intelligence and intelligent agent technology, vol.\u00a02; 2008, p. 252\u2013258.","DOI":"10.1109\/WIIAT.2008.417"},{"key":"650_CR17","first-page":"89","volume":"7","author":"J Creedy","year":"2004","unstructured":"Creedy J, Scutella R. The role of the unit of analysis in tax policy return evaluations of inequality and social welfare. Australian J Labour Econ (AJLE). 2004;7:89\u2013108.","journal-title":"Australian J Labour Econ (AJLE)"},{"key":"650_CR18","unstructured":"Davin J. Hierarchical variable ordering for multiagent agreement problems. In: In AAMAS; 2006, p. 1433\u20131435."},{"key":"650_CR19","unstructured":"Defago X, Hassine A, Ho T. Agent-based approach to dynamic meeting scheduling problems. In: AAMAS; 2004, p. 1132\u20131139."},{"key":"650_CR20","doi-asserted-by":"crossref","unstructured":"Dongjun L, Spong MW. Agreement with non-uniform information delays. In: American control conference (ACC); 2006.","DOI":"10.1109\/ACC.2006.1655447"},{"key":"650_CR21","doi-asserted-by":"crossref","unstructured":"Doshi P, Matsui T, Silaghi M, Yokoo M, Zanker M. Distributed private constraint optimization. In: Proceedings of the international conference on intelligent agent technology (IAT); 2008, p. 277\u201381.","DOI":"10.1109\/WIIAT.2008.426"},{"key":"650_CR22","unstructured":"Ephrati E, Zlotkin G, Rosenschein JS. A nonmanipulable meeting scheduling system. In: International workshop on distributed artificial intelligence; 1994."},{"key":"650_CR23","first-page":"30","volume-title":"Agent-mediated electronic commerce VI. Theories for and engineering of distributed mechanisms and systems","author":"B Faltings","year":"2005","unstructured":"Faltings B. A budget-balanced, incentive-compatible scheme for social choice. In: Faratin P, Rodriguez-Aguilar JA, editors. Agent-mediated electronic commerce VI. Theories for and engineering of distributed mechanisms and systems. Berlin: Springer; 2005. p. 30\u201343."},{"key":"650_CR24","doi-asserted-by":"crossref","unstructured":"Faltings B, Leaute T, Petcu A. Privacy guarantees through distributed constraint satisfaction. In: Web intelligence and intelligent agent technology; 2008, p. 350\u20138.","DOI":"10.1109\/WIIAT.2008.177"},{"key":"650_CR25","doi-asserted-by":"publisher","first-page":"464","DOI":"10.1109\/TAC.2018.2823270","volume":"64","author":"F Farhadi","year":"2019","unstructured":"Farhadi F, Golestani SJ, Teneketzis D. A surrogate optimization-based mechanism for resource allocation and routing in networks with strategic agents. IEEE Trans Autom Control. 2019;64:464\u201379.","journal-title":"IEEE Trans Autom Control"},{"key":"650_CR26","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1007\/978-3-030-66412-1_10","volume-title":"Multi-agent systems and agreement technologies","author":"F Farhadi","year":"2020","unstructured":"Farhadi F, Jennings NR. A faithful mechanism for privacy-sensitive distributed constraint satisfaction problems. In: Bassiliades N, Chalkiadakis G, de Jonge D, editors. Multi-agent systems and agreement technologies. Cham: Springer International Publishing; 2020. p. 143\u201358."},{"key":"650_CR27","doi-asserted-by":"publisher","first-page":"914","DOI":"10.1007\/s13235-018-0284-4","volume":"9","author":"F Farhadi","year":"2019","unstructured":"Farhadi F, Tavafoghi H, Teneketzis D, Golestani SJ. An efficient dynamic allocation mechanism for security in networks of interdependent strategic agents. Dyn Games Appl. 2019;9:914\u201341.","journal-title":"Dyn Games Appl"},{"key":"650_CR28","first-page":"173","volume":"18","author":"J Feigenbaum","year":"2002","unstructured":"Feigenbaum J, Papadimitriou C, Sami R, Shenker S. A bgp-based mechanism for lowest-cost routing. Distrib Comput. 2002;18:173\u201382.","journal-title":"Distrib Comput"},{"key":"650_CR29","doi-asserted-by":"crossref","unstructured":"Feigenbaum J, Shenker S. Distributed algorithmic mechanism design: recent results and future directions. In: Proceedings of the 6th international workshop on discrete algorithms and methods for mobile computing and communications, DIALM\u201902, p. 1\u201313. Association for Computing Machinery, New York, NY, USA; 2002.","DOI":"10.1145\/570810.570812"},{"key":"650_CR30","doi-asserted-by":"publisher","first-page":"264","DOI":"10.1111\/j.0824-7935.2004.00238.x","volume":"20","author":"MS Franzin","year":"2004","unstructured":"Franzin MS, Rossi F, Freuder EC, Wallace R. Multi-agent constraint systems with preferences: efficiency, solution quality, and privacy loss. Comput Intell. 2004;20:264\u201386.","journal-title":"Comput Intell"},{"key":"650_CR31","unstructured":"Freuder EC, Minca M, Wallace RJ. Privacy\/efficiency tradeoffs in distributed meeting scheduling by constraint-based agents. In: Proceedings of IJCAI DCR; 2001."},{"key":"650_CR32","doi-asserted-by":"crossref","unstructured":"Geibel P. Reinforcement learning for mdps with constraints. In: Machine learning: ECML; 2006, p. 646\u201353.","DOI":"10.1007\/11871842_63"},{"key":"650_CR33","first-page":"688","volume":"84","author":"A Gershkov","year":"2016","unstructured":"Gershkov A, Moldovanu B, Shi X. Optimal voting rules. Rev Econ Stud. 2016;84:688\u2013717.","journal-title":"Rev Econ Stud"},{"key":"650_CR34","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1613\/jair.2591","volume":"34","author":"A Gershman","year":"2009","unstructured":"Gershman A, Meisels A, Zivan R. Asynchronous forward bounding for distributed cops. J Artif Intell Res. 2009;34:61\u201388.","journal-title":"J Artif Intell Res"},{"key":"650_CR35","unstructured":"Gorokh A, Banerjee S, Iyer K. Near-efficient allocation using artificial currency in repeated settings. In: Proceedings of the 12th international conference on web and internet economics, WINE '16."},{"key":"650_CR36","doi-asserted-by":"crossref","unstructured":"Gorokh A, Banerjee S, Iyer K. From monetary to non-monetary mechanism design via artificial currencies. SSRN Electron J 2017;563\u20134","DOI":"10.2139\/ssrn.2964082"},{"key":"650_CR37","doi-asserted-by":"crossref","unstructured":"Greenstadt R, Grosz B, Smith M. Ssdpop: improving the privacy of dcop with secret sharing. In: AAMAS\u201907\u2014Proceedings of the 6th international joint conference on autonomous agents and multiagent systems, proceedings of the international conference on autonomous agents; 2007, p. 1098\u2013100.","DOI":"10.1145\/1329125.1329333"},{"key":"650_CR38","unstructured":"Greenstadt R, Pearce JP, Tambe M. Analysis of privacy loss in distributed constraint optimization. In: National conference on artificial intelligence; 2006. AAAI Press, New York, p. 647\u201353."},{"key":"650_CR39","unstructured":"Grinshpoun T. When you say (dcop) privacy, what do you mean?\u2014categorization of dcop privacy and insights on internal constraint privacy. In: Proceedings of the 4th international conference on agents and artificial intelligence\u2014vol. 2: ICAART; 2012, p. 380\u201386."},{"key":"650_CR40","doi-asserted-by":"publisher","first-page":"621","DOI":"10.1613\/jair.5322","volume":"57","author":"T Grinshpoun","year":"2016","unstructured":"Grinshpoun T, Tassa T. P-syncbb: a privacy preserving branch and bound dcop algorithm. J Artif Intell Res. 2016;57:621\u201360.","journal-title":"J Artif Intell Res"},{"key":"650_CR41","first-page":"222","volume-title":"Principles and practice of constraint programming","author":"K Hirayama","year":"1997","unstructured":"Hirayama K, Yokoo M. Distributed partial constraint satisfaction problem. In: Principles and practice of constraint programming. New York: Springer; 1997. p. 222\u201336."},{"key":"650_CR42","unstructured":"Hoang K, Hou P, Fioretto F, Yeoh W, Zivan R, Yokoo, M.: Infinite-horizon proactive dynamic dcops. In: Proceedings of the 16th conference on autonomous agents and multiagent systems (AAMAS); 2017, pp 212\u2013220"},{"key":"650_CR43","doi-asserted-by":"crossref","unstructured":"Huang Z, Kannan S. The exponential mechanism for social welfare: private, truthful, and nearly optimal. In: IEEE 53rd annual symposium on foundations of computer science; 2012, p. 140\u20139","DOI":"10.1109\/FOCS.2012.36"},{"key":"650_CR44","doi-asserted-by":"publisher","first-page":"350","DOI":"10.1049\/el:19950245","volume":"31","author":"N Jennings","year":"1995","unstructured":"Jennings N, Jackson A. Agent-based meeting scheduling: a design and implementation. Electron Lett. 1995;31:350\u20132.","journal-title":"Electron Lett"},{"key":"650_CR45","doi-asserted-by":"publisher","first-page":"88","DOI":"10.1007\/978-3-319-22047-5_8","volume-title":"Big data computing and communications","author":"T Jung","year":"2015","unstructured":"Jung T, Li XY, Han J. A framework for optimization in big data: privacy-preserving multi-agent greedy algorithm. In: Wang Y, Xiong H, Argamon S, Li X, Li J, editors. Big data computing and communications. New York: Springer International Publishing; 2015. p. 88\u2013102."},{"issue":"4","key":"650_CR46","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3158373","volume":"18","author":"D Kekulluoglu","year":"2018","unstructured":"Kekulluoglu D, Kokciyan N, Yolum P. Preserving privacy as social responsibility in online social networks. ACM Trans Internet Technol. 2018;18(4):1\u201322.","journal-title":"ACM Trans Internet Technol"},{"key":"650_CR47","doi-asserted-by":"crossref","unstructured":"Lakkaraju K, Gasser L. A unified framework for multi-agent agreement. In: AAMAS; 2007, p. 1\u20133.","DOI":"10.1145\/1329125.1329151"},{"key":"650_CR48","first-page":"17","volume":"3","author":"T Leaute","year":"2009","unstructured":"Leaute T, Faltings B. Privacy-preserving multi-agent constraint satisfaction. Int Conf Comput Sci Eng. 2009;3:17\u201325.","journal-title":"Int Conf Comput Sci Eng"},{"key":"650_CR49","doi-asserted-by":"publisher","first-page":"649","DOI":"10.1613\/jair.3983","volume":"47","author":"T Leaute","year":"2014","unstructured":"Leaute T, Faltings B. Protecting privacy through distributed computation in multi-agent decision making. J Artif Intell Res. 2014;47:649\u201395.","journal-title":"J Artif Intell Res"},{"key":"650_CR50","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1061\/(ASCE)CP.1943-5487.0000434","volume":"29","author":"SS Leu","year":"2015","unstructured":"Leu SS, Son PVH, Nhung PTH. Hybrid Bayesian fuzzy-game model for improving the negotiation effectiveness of construction material procurement. J Comput Civ Eng. 2015;29:1\u201312.","journal-title":"J Comput Civ Eng"},{"key":"650_CR51","doi-asserted-by":"publisher","first-page":"58","DOI":"10.1007\/978-3-642-35311-6_5","volume-title":"Internet Netw Econ","author":"S Leung","year":"2012","unstructured":"Leung S, Lui E. Bayesian mechanism design with efficiency, privacy, and approximate truthfulness. In: Goldberg PW, editor. Internet Netw Econ. Berlin: Springer; 2012. p. 58\u201371."},{"key":"650_CR52","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1016\/j.artint.2017.07.003","volume":"252","author":"O Litov","year":"2017","unstructured":"Litov O, Meisels A. Forward bounding on pseudo-trees for dcops and adcops. Artif Intell. 2017;252:83\u201399.","journal-title":"Artif Intell"},{"key":"650_CR53","doi-asserted-by":"crossref","unstructured":"Macarthur, K.S., Stranders, R., Ramchurn, S.D., Jennings, N.R.: A distributed anytime algorithm for dynamic task allocation in multi-agent systems. In: Proceedings of the 25th AAAI conference on artificial intelligence, AAAI\u201911; 2011, p. 701\u20136","DOI":"10.1609\/aaai.v25i1.7866"},{"key":"650_CR54","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1007\/s10458-006-5951-y","volume":"13","author":"R Maheswaran","year":"2006","unstructured":"Maheswaran R, Pearce J, Bowring E, Varakantham P, Tambe M. Privacy loss in distributed constraint reasoning: a quantitative framework for analysis and its applications. Auton Agent Multi-Agent Syst. 2006;13:27\u201360.","journal-title":"Auton Agent Multi-Agent Syst"},{"key":"650_CR55","unstructured":"Mahmud S, Choudhury M, Khan MM, Tran-Thanh L, Jennings NR: Aed: an anytime evolutionary dcop algorithm. In: Proceedings of the 19th international conference on autonomous agents and multiagent systems, AAMAS\u201920, p. 825\u201333. International foundation for autonomous agents and multiagent systems, Richland, SC (2020)"},{"key":"650_CR56","doi-asserted-by":"publisher","first-page":"523","DOI":"10.1111\/j.1468-0262.2004.00499.x","volume":"72","author":"D Majumdar","year":"2004","unstructured":"Majumdar D, Sen A. Ordinally Bayesian incentive compatible voting rules. Econometrica. 2004;72:523\u201340.","journal-title":"Econometrica"},{"key":"650_CR57","unstructured":"Meisels A, Lavee O: Using additional information in discsps search. In: DCR (2004)"},{"issue":"5","key":"650_CR58","doi-asserted-by":"publisher","first-page":"1617","DOI":"10.1111\/j.1468-0262.2004.00546.x","volume":"72","author":"C Mezzetti","year":"2004","unstructured":"Mezzetti C. Mechanism design with interdependent valuations: efficiency. Econometrica. 2004;72(5):1617\u201326. https:\/\/doi.org\/10.1111\/j.1468-0262.2004.00546.x.","journal-title":"Econometrica"},{"issue":"4","key":"650_CR59","doi-asserted-by":"publisher","first-page":"4238","DOI":"10.1109\/TPWRS.2017.2771945","volume":"33","author":"S Mhanna","year":"2018","unstructured":"Mhanna S, Chapman AC, Verbic G. A faithful and tractable distributed mechanism for residential electricity pricing. IEEE Trans Power Syst. 2018;33(4):4238\u201352.","journal-title":"IEEE Trans Power Syst"},{"issue":"3","key":"650_CR60","doi-asserted-by":"publisher","first-page":"1743","DOI":"10.1109\/TSG.2015.2429152","volume":"7","author":"S Mhanna","year":"2016","unstructured":"Mhanna S, Verbic G, Chapman AC. A faithful distributed mechanism for demand response aggregation. IEEE Trans Smart Grid. 2016;7(3):1743\u201353.","journal-title":"IEEE Trans Smart Grid"},{"key":"650_CR61","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1016\/j.artint.2004.09.003","volume":"161","author":"PJ Modi","year":"2005","unstructured":"Modi PJ, Shen WM, Tambe M, Yokoo M. Adopt: asynchronous distributed constraint optimization with quality guarantees. Artif Intell. 2005;161:149\u201380.","journal-title":"Artif Intell"},{"key":"650_CR62","doi-asserted-by":"crossref","unstructured":"Modi, P.J., Veloso, M.: Bumping strategies for the multiagent agreement problem. In: Proceedings of the Fourth International Joint Conference on Autonomous Agents and Multiagent Systems, AAMAS \u201905; 2005, p. 390\u20136. Association for Computing Machinery, New York, NY, USA.","DOI":"10.1145\/1082473.1082533"},{"key":"650_CR63","unstructured":"Nakamoto S. Bitcoin: a peer-to-peer electronic cash system. Technical report; 2009"},{"issue":"1","key":"650_CR64","doi-asserted-by":"publisher","first-page":"705","DOI":"10.1613\/jair.1.11400","volume":"64","author":"DT Nguyen","year":"2019","unstructured":"Nguyen DT, Yeoh W, Lau HC, Zivan R. Distributed gibbs: a linear-space sampling-based dcop algorithm. J Artif Intell Res. 2019;64(1):705\u201348.","journal-title":"J Artif Intell Res"},{"key":"650_CR65","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4939-2864-4_548","volume-title":"Mechanism design and differential privacy","author":"K Nisim","year":"2016","unstructured":"Nisim K, Xiao D. Mechanism design and differential privacy. New York: Springer; 2016."},{"key":"650_CR66","doi-asserted-by":"crossref","unstructured":"Nissim K, Orlandi C, Smorodinsky R. Privacy-aware mechanism design. In: Proceedings of the 13th ACM conference on electronic commerce, EC\u201912; 2012, p. 774\u2013789. Association for Computing Machinery","DOI":"10.1145\/2229012.2229073"},{"key":"650_CR67","unstructured":"Okamoto S, Zivan R, Nahon A. Distributed breakout: beyond satisfaction. In: IJCAI; 2016, p. 447\u201353."},{"key":"650_CR68","doi-asserted-by":"publisher","unstructured":"Singer Y. Budget feasible mechanisms In: 2010 IEEE 51st Annual Symposium on Foundations of Computer Science. 2010. p. 765\u2013774. https:\/\/doi.org\/10.1109\/FOCS.2010.78.","DOI":"10.1109\/FOCS.2010.78"},{"key":"650_CR69","unstructured":"Parkes DC, Kalagnanam JR, Eso M. Achieving budget-balance with vickrey-based payment schemes in exchanges. In: 17th IJCAI; 2001"},{"key":"650_CR70","unstructured":"Parkes DC, Shneidman J. Distributed implementations of vickrey-clarke-groves mechanisms. In: AAMAS; 2004, p. 261\u20138"},{"key":"650_CR71","doi-asserted-by":"crossref","unstructured":"Pascal C, Panescu D. On applying discsp for scheduling in holonic systems. In: 20th international conference on system theory, control and computing; 2016, p. 423\u20138.","DOI":"10.1109\/ICSTCC.2016.7790702"},{"issue":"3","key":"650_CR72","doi-asserted-by":"publisher","first-page":"175","DOI":"10.1002\/mde.1180","volume":"25","author":"P Pecorino","year":"2004","unstructured":"Pecorino P. Negotiation games: applying game theory to bargaining and arbitration. Manag Decis Econ. 2004;25(3):175\u20136.","journal-title":"Manag Decis Econ"},{"key":"650_CR73","doi-asserted-by":"crossref","unstructured":"Peng D, Yang S, Wu F, Chen G, Tang S, Luo T. Resisting three-dimensional manipulations in distributed wireless spectrum auctions. In: 2015 IEEE conference on computer communications (INFOCOM); 2015, p. 2056\u201364.","DOI":"10.1109\/INFOCOM.2015.7218590"},{"key":"650_CR74","unstructured":"Petcu A, Faltings B. A scalable method for multiagent constraint optimization. In: Proceedings of the 19th international joint conference on artificial intelligence, IJCAI\u201905;2005, p. 266\u201371. Morgan Kaufmann Publishers Inc., San Francisco, CA, USA."},{"key":"650_CR75","unstructured":"Petcu A, Faltings B.:Superstabilizing, fault-containing distributed combinatorial optimization. In: Proceedings of the 20th national conference on artificial intelligence\u2014Vol. 1, AAAI\u201905; 2005, p. 449\u2013454. AAAI Press."},{"key":"650_CR76","doi-asserted-by":"publisher","first-page":"705","DOI":"10.1613\/jair.2500","volume":"32","author":"A Petcu","year":"2008","unstructured":"Petcu A, Faltings B, Parkes DC. M-dpop: faithful distributed implementation of efficient social choice problems. J Artif Intell Res. 2008;32:705\u201355.","journal-title":"J Artif Intell Res"},{"key":"650_CR77","first-page":"e4","volume":"3","author":"C Prendergast","year":"2016","unstructured":"Prendergast C. The allocation of food to food banks. EAI Endorsed Trans Serious Games. 2016;3:e4.","journal-title":"EAI Endorsed Trans Serious Games"},{"key":"650_CR78","doi-asserted-by":"crossref","unstructured":"Procaccia AD, Tennenholtz M. Approximate mechanism design without money. In: Proceedings of the 10th ACM conference on electronic commerce (EC); 2009.","DOI":"10.1145\/1566374.1566401"},{"key":"650_CR79","unstructured":"Pultowicz P. Multi-agent negotiation and optimization in decentralized logistics. Ph.D. thesis, University of Vienna; 2017."},{"key":"650_CR80","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. Bounded approximate decentralised coordination via the max-sum algorithm. Artif Intell. 2011;175:730\u201359.","journal-title":"Artif Intell"},{"key":"650_CR81","doi-asserted-by":"publisher","first-page":"97","DOI":"10.2307\/1912531","volume":"50","author":"A Rubinstein","year":"1982","unstructured":"Rubinstein A. Perfect equilibrium in a bargaining model. Econometrica. 1982;50:97\u2013109.","journal-title":"Econometrica"},{"key":"650_CR82","doi-asserted-by":"publisher","first-page":"55","DOI":"10.1023\/A:1008639617029","volume":"7","author":"S Sen","year":"1998","unstructured":"Sen S, Durfee EH. A formal study of distributed meeting scheduling. Group Decis Negot. 1998;7:55\u201368.","journal-title":"Group Decis Negot"},{"key":"650_CR83","doi-asserted-by":"crossref","unstructured":"Shneidman J, Parkes DC. Specification faithfulness in networks with rational nodes. In: Proceedings of the twenty-third annual ACM symposium on principles of distributed computing. Association for Computing Machinery; 2004, p. 88\u201397.","DOI":"10.1145\/1011767.1011781"},{"key":"650_CR84","unstructured":"Silaghi M, Faltings B. A comparison of distributed constraint satisfaction approaches with respect to privacy. In: DCR; 2002."},{"key":"650_CR85","unstructured":"Silaghi MC, Mitra D. Distributed constraint satisfaction and optimization with privacy enforcement. In: Intelligent agent technology; 2004, p. 531\u20135."},{"key":"650_CR86","first-page":"207","volume":"9","author":"DK Singh","year":"2017","unstructured":"Singh DK, Mazumdar BD. Agent mediated negotiation in e-commerce: a review. Int J Modern Trends Eng Res. 2017;9:207\u201316.","journal-title":"Int J Modern Trends Eng Res"},{"key":"650_CR87","first-page":"2413","volume":"10","author":"AL Strehl","year":"2009","unstructured":"Strehl AL, Li L, Littman ML. Reinforcement learning in finite mdps: Pac analysis. J Mach Learn Res. 2009;10:2413\u201344.","journal-title":"J Mach Learn Res"},{"issue":"1","key":"650_CR88","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/2821512","volume":"11","author":"JM Such","year":"2016","unstructured":"Such JM, Rovatsos M. Privacy policy negotiation in social media. ACM Trans Auton Adapt Syst. 2016;11(1):1\u201329. https:\/\/doi.org\/10.1145\/2821512.","journal-title":"ACM Trans Auton Adapt Syst"},{"key":"650_CR89","unstructured":"Sultanik E, Lass R, Regli W. Dynamic configuration of agent organizations. In: Proceedings of the 21st international joint conference on artificial intelligence\u2014Vol. 1, IJCAI 2009; 2009, p. 305\u201311."},{"key":"650_CR90","unstructured":"Tanaka T, Farokhi F, Langbort C. A faithful distributed implementation of dual decomposition and average consensus algorithms. In: 52nd IEEE conference on decision and control; 2003, p. 2985\u201390."},{"issue":"2","key":"650_CR91","doi-asserted-by":"publisher","first-page":"191","DOI":"10.1109\/TCNS.2015.2489318","volume":"4","author":"T Tanaka","year":"2017","unstructured":"Tanaka T, Farokhi F, Langbort C. Faithful implementations of distributed algorithms and control laws. IEEE Trans Control Netw Syst. 2017;4(2):191\u2013201.","journal-title":"IEEE Trans Control Netw Syst"},{"key":"650_CR92","unstructured":"Vincent DR. Bidding off the wall: why reserve prices are kept secret. Discussion Papers 838, Northwestern University, Center for Mathematical Studies in Economics and Management Science; 1989."},{"key":"650_CR93","doi-asserted-by":"publisher","first-page":"209","DOI":"10.1016\/j.artint.2004.10.006","volume":"161","author":"RJ Wallace","year":"2005","unstructured":"Wallace RJ, Freuder EC. Constraint-based reasoning and privacy\/efficiency tradeoffs in multi-agent problem solving. Artif Intell. 2005;161:209\u201327.","journal-title":"Artif Intell"},{"key":"650_CR94","doi-asserted-by":"publisher","first-page":"646","DOI":"10.1007\/BF00992698","volume":"8","author":"C Watkins","year":"1992","unstructured":"Watkins C, Dayan P. Technical note: Q-learning. Mach Learn. 1992;8:646\u201353.","journal-title":"Mach Learn"},{"key":"650_CR95","unstructured":"Wei K, Chen YF, Smith A, Vo B. Whopay: a scalable and anonymous payment system for peer-to-peer environments. Technical report; 2005."},{"key":"650_CR96","first-page":"85","volume":"38","author":"W Yeoh","year":"2008","unstructured":"Yeoh W, Felner A, Koenig S. Bnb-adopt: an asynchronous branch-and-bound dcop algorithm. J Artif Intell Res JAIR. 2008;38:85\u2013133.","journal-title":"J Artif Intell Res JAIR"},{"key":"650_CR97","unstructured":"Yeoh W, Varakantham P, Sun X, Koenig S. Incremental dcop search algorithms for solving dynamic dcops. In: The 10th international conference on autonomous agents and multiagent systems, AAMAS\u201911; 2011, p. 1069\u201370."},{"key":"650_CR98","unstructured":"Yokoo M. Protocol\/mechanism design for cooperation\/competition. In: 3rd International joint conference on autonomous agents and multiagent systems; 2004, p. 3\u20137."},{"key":"650_CR99","doi-asserted-by":"publisher","first-page":"229","DOI":"10.1016\/j.artint.2004.10.007","volume":"161","author":"M Yokoo","year":"2005","unstructured":"Yokoo M, Suzuki K, Hirayama K. Secure distributed constraint satisfaction: reaching agreement without revealing private information. Artif Intell. 2005;161:229\u201345.","journal-title":"Artif Intell"},{"key":"650_CR100","doi-asserted-by":"crossref","unstructured":"Zhang C, Fan Y, Wang L, Chen H. Consensus of multi-agent systems by distributed self-triggered control. In: 33rd youth academic annual conference of Chinese association of automation (YAC); 2018, p. 270\u20135.","DOI":"10.1109\/YAC.2018.8406384"},{"key":"650_CR101","doi-asserted-by":"crossref","unstructured":"Zhu R, Shin KG. Differentially private and strategy-proof spectrum auction with approximate revenue maximization. In: 2015 IEEE conference on computer communications (INFOCOM); 2015, p. 918\u201326.","DOI":"10.1109\/INFOCOM.2015.7218463"},{"key":"650_CR102","unstructured":"Zivan R, Peled H. Max\/min-sum distributed constraint optimization through value propagation on an alternating dag. In: Proceedings of the 11th international conference on autonomous agents and multiagent systems\u2014Vol. 1, AAMAS \u201912. International Foundation for Autonomous Agents and Multiagent Systems; 2012, p. 265\u201372."},{"key":"650_CR103","doi-asserted-by":"crossref","unstructured":"Zou J, Meir R, Parkes D. Strategic voting behavior in doodle polls. In: Proceedings of the 18th ACM conference on computer supported cooperative work & social computing; 2015, p. 464\u201372.","DOI":"10.1145\/2675133.2675273"},{"key":"650_CR104","doi-asserted-by":"publisher","first-page":"7011","DOI":"10.1016\/j.eswa.2008.08.024","volume":"36","author":"A Zunino","year":"2009","unstructured":"Zunino A, Campo M. Chronos: a multi-agent system for distributed automatic meeting scheduling. Expert Syst Appl. 2009;36:7011\u20138.","journal-title":"Expert Syst Appl"}],"container-title":["SN Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s42979-021-00650-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s42979-021-00650-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s42979-021-00650-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,1]],"date-time":"2023-02-01T23:27:29Z","timestamp":1675294049000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s42979-021-00650-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,5,11]]},"references-count":104,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2021,7]]}},"alternative-id":["650"],"URL":"https:\/\/doi.org\/10.1007\/s42979-021-00650-4","relation":{},"ISSN":["2662-995X","2661-8907"],"issn-type":[{"type":"print","value":"2662-995X"},{"type":"electronic","value":"2661-8907"}],"subject":[],"published":{"date-parts":[[2021,5,11]]},"assertion":[{"value":"1 September 2020","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"16 April 2021","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"11 May 2021","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"There is no other conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}},{"value":"This article does not contain any studies with human participants or animals performed by any of the authors.","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"Ethical approval"}}],"article-number":"272"}}