{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,3,31]],"date-time":"2023-03-31T14:18:39Z","timestamp":1680272319270},"reference-count":20,"publisher":"Walter de Gruyter GmbH","issue":"4","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,4,26]]},"abstract":"<jats:title>Zusammenfassung<\/jats:title>\n               <jats:p>In diesem Beitrag wird die Anwendung von Gradient-Tracking-Verfahren in Multi-Cluster-Spielen untersucht. Neben einer Aufarbeitung relevanter Literatur umfasst die Arbeit einen theoretischen und simulativen Vergleich zwischen zwei bestehenden Gradient-Tracking-basierten Algorithmen. Hierbei wird insbesondere auf die Unterschiede der Kommunikationsarchitekturen eingegangen. In den durchgef\u00fchrten Simulationen werden die Konvergenzzeiten der Algorithmen in Anwendung auf ein Nash-Cournot-Spiel miteinander verglichen. Es wird deutlich, dass sich eine weniger eingeschr\u00e4nkte Kommunikationsarchitektur zwischen den Clustern positiv auf die Konvergenzzeit auswirkt.<\/jats:p>","DOI":"10.1515\/auto-2021-0106","type":"journal-article","created":{"date-parts":[[2022,4,22]],"date-time":"2022-04-22T07:08:41Z","timestamp":1650611321000},"page":"355-366","source":"Crossref","is-referenced-by-count":0,"title":["Gradient-Tracking-basierte L\u00f6sung von Multi-Cluster-Spielen"],"prefix":"10.1515","volume":"70","author":[{"given":"Jan","family":"Zimmermann","sequence":"first","affiliation":[{"name":"Technische Universit\u00e4t Darmstadt , Darmstadt , Deutschland"}]},{"given":"Tatiana","family":"Tatarenko","sequence":"additional","affiliation":[{"name":"Technische Universit\u00e4t Darmstadt , Darmstadt , Deutschland"}]},{"given":"Volker","family":"Willert","sequence":"additional","affiliation":[{"name":"Hochschule f\u00fcr angewandte Wissenschaften W\u00fcrzburg-Schweinfurt , Schweinfurt , Deutschland"}]},{"given":"J\u00fcrgen","family":"Adamy","sequence":"additional","affiliation":[{"name":"Technische Universit\u00e4t Darmstadt , Darmstadt , Deutschland"}]}],"member":"374","published-online":{"date-parts":[[2022,3,25]]},"reference":[{"key":"2023033111015021081_j_auto-2021-0106_ref_001","doi-asserted-by":"crossref","unstructured":"Ahat, M., S.B. Amor, M. Bui, A. Bui, G. Gu\u00e9rard and C. Petermann. 2013. Smart Grid and Optimization. American Journal of Operations Research 3(1): 196\u2013206.","DOI":"10.4236\/ajor.2013.31A019"},{"key":"2023033111015021081_j_auto-2021-0106_ref_002","doi-asserted-by":"crossref","unstructured":"Dall\u2019Anese, E., H. Zhu and G.B. Giannakis. 2013. Distributed optimal power flow for smart microgrids. IEEE Transactions on Smart Grid 4(3): 1464\u20131475.","DOI":"10.1109\/TSG.2013.2248175"},{"key":"2023033111015021081_j_auto-2021-0106_ref_003","doi-asserted-by":"crossref","unstructured":"Kanzow, C. and A. Schwartz. 2018. Spieltheorie: Theorie und Verfahren zur L\u00f6sung von Nash- und verallgemeinerten Nash-Gleichgewichtsproblemen. Birkh\u00e4user.","DOI":"10.1007\/978-3-319-96679-3"},{"key":"2023033111015021081_j_auto-2021-0106_ref_004","doi-asserted-by":"crossref","unstructured":"Kasbekar, G.S. and S. Sarkar. 2012. Pricing games among interconnected microgrids. In: IEEE Power and Energy Society General Meeting.","DOI":"10.1109\/PESGM.2012.6344881"},{"key":"2023033111015021081_j_auto-2021-0106_ref_005","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: 2005.06923."},{"key":"2023033111015021081_j_auto-2021-0106_ref_006","doi-asserted-by":"crossref","unstructured":"Mengelkamp, E., J. G\u00e4rttner, K. Rock, S. Kessler, L. Orsini and C. Weinhardt. 2018. Designing microgrid energy markets: A case study: The Brooklyn Microgrid. Applied Energy 210: 870\u2013880.","DOI":"10.1016\/j.apenergy.2017.06.054"},{"key":"2023033111015021081_j_auto-2021-0106_ref_007","doi-asserted-by":"crossref","unstructured":"Nedi\u0107, A., A. Olshevsky and W. Shi. 2017. Achieving geometric convergence for distributed optimization over time-varying graphs. SIAM 27(4): 2597\u20132633.","DOI":"10.1137\/16M1084316"},{"key":"2023033111015021081_j_auto-2021-0106_ref_008","doi-asserted-by":"crossref","unstructured":"Pang, Y. and G. Hu. 2021. Gradient-free Nash equilibrium seeking in n-cluster games with uncoordinated constant step-sizes. arXiv: 2008.13088.","DOI":"10.1109\/CDC51059.2022.9992991"},{"key":"2023033111015021081_j_auto-2021-0106_ref_009","doi-asserted-by":"crossref","unstructured":"Pu, S., W. Shi, J. Xu and A. Nedi\u0107. 2021. Push-Pull Gradient Methods for Distributed Optimization in Networks. IEEE Transactions on Automatic Control 66(1): 1\u201316.","DOI":"10.1109\/TAC.2020.2972824"},{"key":"2023033111015021081_j_auto-2021-0106_ref_010","doi-asserted-by":"crossref","unstructured":"Qu, G. and Na Li. 2018. Harnessing smoothness to accelerate distributed optimization. IEEE Transactions on Control of Network Systems 5(3): 1245\u20131260.","DOI":"10.1109\/TCNS.2017.2698261"},{"key":"2023033111015021081_j_auto-2021-0106_ref_011","doi-asserted-by":"crossref","unstructured":"Tatarenko, T. and A. Nedi\u0107. 2020. Geometric convergence of distributed gradient play in games with unconstrained action sets. IFAC-PapersOnLine 53: 3367\u20133372, Elsevier B.\u2009V.","DOI":"10.1016\/j.ifacol.2020.12.1501"},{"key":"2023033111015021081_j_auto-2021-0106_ref_012","doi-asserted-by":"crossref","unstructured":"Tatarenko, T., J. Zimmermann and J. Adamy. 2021. Gradient play in n-cluster games with zero-order information. arXiv: 2107.12648.","DOI":"10.1109\/CDC45484.2021.9683636"},{"key":"2023033111015021081_j_auto-2021-0106_ref_013","doi-asserted-by":"crossref","unstructured":"Xin, R., C. Xi and U.A. Khan. 2019. FROST \u2013 Fast row-stochastic optimization with uncoordinated step-sizes. Eurasip Journal on Advances in Signal Processing 2019(1): 1.","DOI":"10.1186\/s13634-018-0596-y"},{"key":"2023033111015021081_j_auto-2021-0106_ref_014","doi-asserted-by":"crossref","unstructured":"Ye, M. and G. Hu. 2017. Simultaneous social cost minimization and Nash equilibrium seeking in non-cooperative games. In: Chinese Control Conference, CCC, pp.\u20093052\u20133059.","DOI":"10.23919\/ChiCC.2017.8027826"},{"key":"2023033111015021081_j_auto-2021-0106_ref_015","doi-asserted-by":"crossref","unstructured":"Ye, M., G. Hu and F.L. Lewis. 2018. Nash equilibrium seeking for N-coalition noncooperative games. Automatica 95: 266\u2013272.","DOI":"10.1016\/j.automatica.2018.05.020"},{"key":"2023033111015021081_j_auto-2021-0106_ref_016","doi-asserted-by":"crossref","unstructured":"Ye, M., G. Hu, F.L. Lewis and L. Xie. 2017. A unified strategy for solution seeking in graphical N-coalition noncooperative games. IEEE Transactions on Automatic Control 64(11): 4645\u20134652.","DOI":"10.1109\/TAC.2019.2901820"},{"key":"2023033111015021081_j_auto-2021-0106_ref_017","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":"2023033111015021081_j_auto-2021-0106_ref_018","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":"2023033111015021081_j_auto-2021-0106_ref_019","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"},{"key":"2023033111015021081_j_auto-2021-0106_ref_020","doi-asserted-by":"crossref","unstructured":"Zou, Y., B. Huang, Z. Meng and W. Ren. 2019. Distributed Nash equilibrium seeking algorithms for two-layer constrained non-cooperative games. In: Chinese Control Conference, CCC, pp.\u20095776\u20135781.","DOI":"10.23919\/ChiCC.2019.8865303"}],"container-title":["at - Automatisierungstechnik"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.degruyter.com\/document\/doi\/10.1515\/auto-2021-0106\/xml","content-type":"application\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/www.degruyter.com\/document\/doi\/10.1515\/auto-2021-0106\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,3,31]],"date-time":"2023-03-31T13:52:22Z","timestamp":1680270742000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.degruyter.com\/document\/doi\/10.1515\/auto-2021-0106\/html"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,3,25]]},"references-count":20,"journal-issue":{"issue":"4","published-online":{"date-parts":[[2022,3,25]]},"published-print":{"date-parts":[[2022,4,26]]}},"alternative-id":["10.1515\/auto-2021-0106"],"URL":"https:\/\/doi.org\/10.1515\/auto-2021-0106","relation":{},"ISSN":["2196-677X","0178-2312"],"issn-type":[{"value":"2196-677X","type":"electronic"},{"value":"0178-2312","type":"print"}],"subject":[],"published":{"date-parts":[[2022,3,25]]}}}