{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,3,31]],"date-time":"2023-03-31T15:12:32Z","timestamp":1680275552589},"reference-count":26,"publisher":"Walter de Gruyter GmbH","issue":"3","funder":[{"DOI":"10.13039\/501100001659","name":"Deutsche Forschungsgemeinschaft","doi-asserted-by":"publisher","award":["1984"],"award-info":[{"award-number":["1984"]}],"id":[{"id":"10.13039\/501100001659","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2022,3,28]]},"abstract":"<jats:title>Abstract<\/jats:title>\n               <jats:p>This work provides methodological approaches to solve convex optimization problems arising in multi-agent systems which can be reformulated in terms of a so called <jats:italic>N<\/jats:italic>-cluster game. We consider different settings of information available to each agent in the system. First, we present a centralized algorithm, which requires a central coordinator having full access to information about agents\u2019 actions and gradients of their cost functions, to demonstrate how the standard gradient descent method can be applied to achieve an optimal output in <jats:italic>N<\/jats:italic>-cluster games. After that we relax the full information setting and assume that only partial information is available to each agent. Focus lies on the following two cases. In the first case, the agents have access to their gradient functions and are allowed to exchange information with their local neighbors over a communication graph that connects the whole system. In the second case, the agents do not know the functional form of their objectives\/gradients and can only access the current values of their objective functions at some query point. Moreover, the agents are allowed to communicate only with their local neighbors within the cluster to which they belong. For both settings we present the convergent optimization procedures and analyse their efficiency in simulations.<\/jats:p>","DOI":"10.1515\/auto-2021-0137","type":"journal-article","created":{"date-parts":[[2022,3,10]],"date-time":"2022-03-10T12:12:41Z","timestamp":1646914361000},"page":"237-247","source":"Crossref","is-referenced-by-count":0,"title":["Distributed optimization methods for <i>N<\/i>-cluster games"],"prefix":"10.1515","volume":"70","author":[{"given":"Tatiana","family":"Tatarenko","sequence":"first","affiliation":[{"name":"Control Methods and Robotics Lab , Technical University of Darmstadt , Darmstadt , Germany"}]},{"given":"Jan","family":"Zimmermann","sequence":"additional","affiliation":[{"name":"Control Methods and Robotics Lab , Technical University of Darmstadt , Darmstadt , Germany"}]}],"member":"374","published-online":{"date-parts":[[2022,3,11]]},"reference":[{"key":"2023033111222630653_j_auto-2021-0137_ref_001","unstructured":"Bach, F.\u2009R. and V. Perchet. 2016. Highly-smooth zero-th order online optimization. In: Conference on Learning Theory (COLT), pp.\u2009257\u2013283."},{"key":"2023033111222630653_j_auto-2021-0137_ref_002","doi-asserted-by":"crossref","unstructured":"Belgioioso, G., W. Ananduta, S. Grammatico and C. Ocampo-Martinez. 2020. Energy management and peer-to-peer trading in future smart grids: A distributed game-theoretic approach. In: 2020 European Control Conference (ECC), pp.\u20091324\u20131329.","DOI":"10.23919\/ECC51009.2020.9143658"},{"key":"2023033111222630653_j_auto-2021-0137_ref_003","doi-asserted-by":"crossref","unstructured":"Berahas, A.\u2009S., L. Cao, K. Choromanski and K. Scheinberg. 2021. A theoretical and empirical comparison of gradient approximations in derivative-free optimization. Foundations of Computational Mathematics. https:\/\/doi.org\/10.1007\/s10208-021-09513-z.","DOI":"10.1007\/s10208-021-09513-z"},{"key":"2023033111222630653_j_auto-2021-0137_ref_004","unstructured":"Bravo, M., D. Leslie and P. Mertikopoulos. 2018. Bandit learning in concave n-person games. In: Proceedings of the 32nd International Conference on Neural Information Processing Systems, NIPS\u201918. Red Hook, NY, USA, Curran Associates Inc., pp.\u20095666\u20135676."},{"key":"2023033111222630653_j_auto-2021-0137_ref_005","doi-asserted-by":"crossref","unstructured":"Chung, K.\u2009L. Sep 1954. On a stochastic approximation method. Ann. Math. Statist. 25(3): 463\u2013483.","DOI":"10.1214\/aoms\/1177728716"},{"key":"2023033111222630653_j_auto-2021-0137_ref_006","unstructured":"Flaxman, A.\u2009D., A.\u2009T. Kalai and H.\u2009B. McMahan. 2005. Online convex optimization in the bandit setting: Gradient descent without a gradient. In: Proceedings of the Sixteenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA\u201905. USA, Society for Industrial and Applied Mathematics, pp.\u2009385\u2013394."},{"key":"2023033111222630653_j_auto-2021-0137_ref_007","doi-asserted-by":"crossref","unstructured":"Gharesifard, B. and J. Cort\u00e9s. 2013. Distributed convergence to nash equilibria in two-network zero-sum games. Automatica 49(6): 1683\u20131692.","DOI":"10.1016\/j.automatica.2013.02.062"},{"key":"2023033111222630653_j_auto-2021-0137_ref_008","unstructured":"Hu, G. and Y. Pang. 2020. Nash equilibrium seeking in n-coalition games via a gradient-free method. arXiv preprint: 2008.12909."},{"key":"2023033111222630653_j_auto-2021-0137_ref_009","doi-asserted-by":"crossref","unstructured":"Jarrah, M., M. Jaradat, Y. Jararweh, M. Al-Ayyoub and A. Bousselham. 2015. A hierarchical optimization model for energy data flow in smart grid power systems. Information Systems 53: 190\u2013200.","DOI":"10.1016\/j.is.2014.12.003"},{"key":"2023033111222630653_j_auto-2021-0137_ref_010","unstructured":"Kamgarpour, C. and G. Tatarenko. 2020. Bandit online learning of nash equilibria in monotone games. arXiv preprint: 2009.04258."},{"key":"2023033111222630653_j_auto-2021-0137_ref_011","unstructured":"Meng, M. and X. Li. 2020. On the linear convergence of distributed nash equilibrium seeking for multi-cluster games under partial-decision information. arXiv preprint: 2005.06923."},{"key":"2023033111222630653_j_auto-2021-0137_ref_012","doi-asserted-by":"crossref","unstructured":"Niyato, D., A.\u2009V. Vasilakos and Z. Kun. 2011. Resource and revenue sharing with coalition formation of cloud providers: Game theoretic approach. In: 2011 11th IEEE\/ACM International Symposium on Cluster, Cloud and Grid Computing, pp.\u2009215\u2013224.","DOI":"10.1109\/CCGrid.2011.30"},{"key":"2023033111222630653_j_auto-2021-0137_ref_013","doi-asserted-by":"crossref","unstructured":"Pang, J.-S. and F. Facchinei. 2003. Finite-dimensional variational inequalities and complementarity problems: vol.\u20091. Springer series in operations research. Springer, New York, Berlin, Heidelberg.","DOI":"10.1007\/b97544"},{"key":"2023033111222630653_j_auto-2021-0137_ref_014","doi-asserted-by":"crossref","unstructured":"Scutari, G., D. Palomar, F. Facchinei and J.\u2009S. Pang. 2010. Convex optimization, game theory, and variational inequality theory. IEEE Signal Processing Magazine 27(3): 35\u201349.","DOI":"10.1109\/MSP.2010.936021"},{"key":"2023033111222630653_j_auto-2021-0137_ref_015","doi-asserted-by":"crossref","unstructured":"Shi, W., Q. Ling, G. Wu and W. Yin. 2015. EXTRA: An Exact First-Order Algorithm for Decentralized Consensus Optimization. SIAM Journal on Optimization 25(2): 944\u2013966.","DOI":"10.1137\/14096668X"},{"key":"2023033111222630653_j_auto-2021-0137_ref_016","doi-asserted-by":"crossref","unstructured":"Sun, C. and G. Hu. 2021. Distributed generalized nash equilibrium seeking of n-coalition games with full and distributive constraints. arXiv preprint: 2109.12515.","DOI":"10.1109\/CDC45484.2021.9683359"},{"key":"2023033111222630653_j_auto-2021-0137_ref_017","doi-asserted-by":"crossref","unstructured":"Tang, Y. and N. Li. 2019. Distributed zero-order algorithms for nonconvex multi-agent optimization. In: 2019 57th Annual Allerton Conference on Communication, Control, and Computing (Allerton), pp.\u2009781\u2013786.","DOI":"10.1109\/ALLERTON.2019.8919690"},{"key":"2023033111222630653_j_auto-2021-0137_ref_018","doi-asserted-by":"crossref","unstructured":"Tatarenko, T. and M. Kamgarpour. 2019. Learning nash equilibria in monotone games. In: 2019 IEEE 58th Conference on Decision and Control (CDC), pp.\u20093104\u20133109.","DOI":"10.1109\/CDC40024.2019.9029659"},{"key":"2023033111222630653_j_auto-2021-0137_ref_019","doi-asserted-by":"crossref","unstructured":"Tatarenko, T., J. Zimmermann and J. Adamy. 2021. Gradient play in n-cluster games with zero-order information. arXiv preprint: 2107.12648.","DOI":"10.1109\/CDC45484.2021.9683636"},{"key":"2023033111222630653_j_auto-2021-0137_ref_020","doi-asserted-by":"crossref","unstructured":"Tellidou, A.\u2009C. and A.\u2009G. Bakirtzis. Nov 2007. Agent-based analysis of capacity withholding and tacit collusion in electricity markets. IEEE Transactions on Power Systems 22(4): 1735\u20131742.","DOI":"10.1109\/TPWRS.2007.907533"},{"key":"2023033111222630653_j_auto-2021-0137_ref_021","doi-asserted-by":"crossref","unstructured":"Ye, M., G. Hu and F.\u2009L. Lewis. 2018. Nash equilibrium seeking for N-coalition noncooperative games. Automatica 95: 266\u2013272.","DOI":"10.1016\/j.automatica.2018.05.020"},{"key":"2023033111222630653_j_auto-2021-0137_ref_022","doi-asserted-by":"crossref","unstructured":"Ye, M., G. Hu and S. Xu. 2020. An extremum seeking-based approach for Nash equilibrium seeking in N-cluster noncooperative games. Automatica 114: 108815.","DOI":"10.1016\/j.automatica.2020.108815"},{"key":"2023033111222630653_j_auto-2021-0137_ref_023","doi-asserted-by":"crossref","unstructured":"Zeng, X., J. Chen, S. Liang and Y. Hong. 2019. Generalized Nash equilibrium seeking strategy for distributed nonsmooth multi-cluster game. Automatica 103: 20\u201326.","DOI":"10.1016\/j.automatica.2019.01.025"},{"key":"2023033111222630653_j_auto-2021-0137_ref_024","doi-asserted-by":"crossref","unstructured":"Zhao, C, J He, P Cheng and J Chen. 2017. Consensus-Based Energy Management in Smart Grid With Transmission Losses and Directed Communication. IEEE Transactions on Smart Grid 8(5): 2049\u20132061.","DOI":"10.1109\/TSG.2015.2513772"},{"key":"2023033111222630653_j_auto-2021-0137_ref_025","doi-asserted-by":"crossref","unstructured":"Zhou, J., Y. Lv, G. Wen, J. Lv and D. Zheng. 2021. Distributed nash equilibrium seeking in consistency-constrained multi-coalition games. arXiv preprint: 2106.10513.","DOI":"10.1109\/TCYB.2022.3155687"},{"key":"2023033111222630653_j_auto-2021-0137_ref_026","doi-asserted-by":"crossref","unstructured":"Zimmermann, J., T. Tatarenko, V. Willert and J. Adamy. 2021. Solving leaderless multi-cluster games over directed graphs. European Journal of Control 62: 14\u201321.","DOI":"10.1016\/j.ejcon.2021.06.007"}],"container-title":["at - Automatisierungstechnik"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.degruyter.com\/document\/doi\/10.1515\/auto-2021-0137\/xml","content-type":"application\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/www.degruyter.com\/document\/doi\/10.1515\/auto-2021-0137\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,3,31]],"date-time":"2023-03-31T14:33:14Z","timestamp":1680273194000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.degruyter.com\/document\/doi\/10.1515\/auto-2021-0137\/html"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,3,1]]},"references-count":26,"journal-issue":{"issue":"3","published-online":{"date-parts":[[2022,3,11]]},"published-print":{"date-parts":[[2022,3,28]]}},"alternative-id":["10.1515\/auto-2021-0137"],"URL":"https:\/\/doi.org\/10.1515\/auto-2021-0137","relation":{},"ISSN":["2196-677X","0178-2312"],"issn-type":[{"value":"2196-677X","type":"electronic"},{"value":"0178-2312","type":"print"}],"subject":[],"published":{"date-parts":[[2022,3,1]]}}}