<?xml version="1.0" encoding="UTF-8"?>
<!DOCTYPE article PUBLIC "-//NLM//DTD JATS (Z39.96) Journal Publishing DTD v1.3 20210610//EN" "JATS-journalpublishing1-3.dtd">
<article article-type="research-article" dtd-version="1.3" xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xml:lang="ru"><front><journal-meta><journal-id journal-id-type="publisher-id">ntv</journal-id><journal-title-group><journal-title xml:lang="ru">Научно-технический вестник информационных технологий, механики и оптики</journal-title><trans-title-group xml:lang="en"><trans-title>Scientific and Technical Journal of Information Technologies, Mechanics and Optics</trans-title></trans-title-group></journal-title-group><issn pub-type="ppub">2226-1494</issn><issn pub-type="epub">2500-0373</issn><publisher><publisher-name>Университет ИТМО</publisher-name></publisher></journal-meta><article-meta><article-id pub-id-type="doi">10.17586/2226-1494-2024-24-6-1044-1048</article-id><article-id custom-type="elpub" pub-id-type="custom">ntv-411</article-id><article-categories><subj-group subj-group-type="heading"><subject>Research Article</subject></subj-group><subj-group subj-group-type="section-heading" xml:lang="ru"><subject>КОМПЬЮТЕРНЫЕ СИСТЕМЫ И ИНФОРМАЦИОННЫЕ ТЕХНОЛОГИИ</subject></subj-group><subj-group subj-group-type="section-heading" xml:lang="en"><subject>COMPUTER SCIENCE</subject></subj-group></article-categories><title-group><article-title>Особенности организации игрового взаимодействия асимметричных агентов с использованием графовых нейронных сетей</article-title><trans-title-group xml:lang="en"><trans-title>Aspects of organizing game interactions among asymmetric agents using graph neural networks</trans-title></trans-title-group></title-group><contrib-group><contrib contrib-type="author" corresp="yes"><contrib-id contrib-id-type="orcid">https://orcid.org/0000-0002-2938-0575</contrib-id><name-alternatives><name name-style="eastern" xml:lang="ru"><surname>Исаков</surname><given-names>А. О.</given-names></name><name name-style="western" xml:lang="en"><surname>Isakov</surname><given-names>A. O.</given-names></name></name-alternatives><bio xml:lang="ru"><p>Исаков Артём Олегович - аспирант, </p><p>Санкт-Петербург, 197101</p></bio><bio xml:lang="en"><p>Artem O. Isakov - PhD Student,</p><p>Saint Petersburg, 197101</p></bio><email xlink:type="simple">aoisakov@itmo.ru</email><xref ref-type="aff" rid="aff-1"/></contrib><contrib contrib-type="author" corresp="yes"><contrib-id contrib-id-type="orcid">https://orcid.org/0000-0002-2855-9207</contrib-id><name-alternatives><name name-style="eastern" xml:lang="ru"><surname>Перегородиев</surname><given-names>Д. Е.</given-names></name><name name-style="western" xml:lang="en"><surname>Peregorodiev</surname><given-names>D. E.</given-names></name></name-alternatives><bio xml:lang="ru"><p>Перегородиев Данил Евгеньевич - студент,</p><p>Санкт-Петербург, 197101</p></bio><bio xml:lang="en"><p>Danil E. Peregorodiev - Student,</p><p>Saint Petersburg, 197101</p></bio><email xlink:type="simple">deperegorodiev@itmo.ru</email><xref ref-type="aff" rid="aff-1"/></contrib><contrib contrib-type="author" corresp="yes"><contrib-id contrib-id-type="orcid">https://orcid.org/0000-0003-1886-2867</contrib-id><name-alternatives><name name-style="eastern" xml:lang="ru"><surname>Томилов</surname><given-names>И. В.</given-names></name><name name-style="western" xml:lang="en"><surname>Tomilov</surname><given-names>I. V.</given-names></name></name-alternatives><bio xml:lang="ru"><p>Томилов Иван Вячеславович - студент,</p><p>Санкт-Петербург, 197101</p></bio><bio xml:lang="en"><p>Ivan V. Tomilov - Student,</p><p>Saint Petersburg, 197101</p></bio><email xlink:type="simple">ivan-tomilov3@yandex.ru</email><xref ref-type="aff" rid="aff-1"/></contrib><contrib contrib-type="author" corresp="yes"><contrib-id contrib-id-type="orcid">https://orcid.org/0000-0002-1361-6037</contrib-id><name-alternatives><name name-style="eastern" xml:lang="ru"><surname>Гусарова</surname><given-names>Н. Ф.</given-names></name><name name-style="western" xml:lang="en"><surname>Gusarova</surname><given-names>N. F.</given-names></name></name-alternatives><bio xml:lang="ru"><p>Гусарова Наталия Федоровна - кандидат технических наук, старший научный сотрудник, доцент,</p><p>Санкт-Петербург, 197101</p></bio><bio xml:lang="en"><p>Natalia F. Gusarova - PhD, Senior Researcher, Associate Professor,</p><p>Saint Petersburg, 197101</p></bio><email xlink:type="simple">natfed@list.ru</email><xref ref-type="aff" rid="aff-1"/></contrib><contrib contrib-type="author" corresp="yes"><contrib-id contrib-id-type="orcid">https://orcid.org/0000-0001-7417-6947</contrib-id><name-alternatives><name name-style="eastern" xml:lang="ru"><surname>Голубев</surname><given-names>А. А.</given-names></name><name name-style="western" xml:lang="en"><surname>Golubev</surname><given-names>A. A.</given-names></name></name-alternatives><bio xml:lang="ru"><p>Голубев Александр Андреевич - аспирант,</p><p>Санкт-Петербург, 197101</p></bio><bio xml:lang="en"><p>Alexander A. Golubev - PhD Student,</p><p>Saint Petersburg, 197101</p></bio><email xlink:type="simple">9459539@gmail.com</email><xref ref-type="aff" rid="aff-1"/></contrib></contrib-group><aff-alternatives id="aff-1"><aff xml:lang="ru"><institution>Университет ИТМО</institution><country>Россия</country></aff><aff xml:lang="en"><institution>ITMO University</institution><country>Russian Federation</country></aff></aff-alternatives><pub-date pub-type="collection"><year>2024</year></pub-date><pub-date pub-type="epub"><day>29</day><month>12</month><year>2024</year></pub-date><volume>24</volume><issue>6</issue><fpage>1044</fpage><lpage>1048</lpage><permissions><copyright-statement>Copyright &amp;#x00A9; Исаков А.О., Перегородиев Д.Е., Томилов И.В., Гусарова Н.Ф., Голубев А.А., 2024</copyright-statement><copyright-year>2024</copyright-year><copyright-holder xml:lang="ru">Исаков А.О., Перегородиев Д.Е., Томилов И.В., Гусарова Н.Ф., Голубев А.А.</copyright-holder><copyright-holder xml:lang="en">Isakov A.O., Peregorodiev D.E., Tomilov I.V., Gusarova N.F., Golubev A.A.</copyright-holder><license xml:lang="ru" license-type="creative-commons-attribution" xlink:href="https://creativecommons.org/licenses/by/4.0/" xlink:type="simple"><license-p>Данная работа распространяется под лицензией Creative Commons Attribution 4.0.</license-p></license><license xml:lang="en" license-type="creative-commons-attribution" xlink:href="https://creativecommons.org/licenses/by/4.0/" xlink:type="simple"><license-p>This work is licensed under a Creative Commons Attribution 4.0 License.</license-p></license></permissions><self-uri xlink:href="https://ntv.elpub.ru/jour/article/view/411">https://ntv.elpub.ru/jour/article/view/411</self-uri><abstract><sec><title>Введение</title><p>Введение. Рассмотрена структура представления графа межагентных связей для повышения эффективности взаимодействия агентов в кооперативных состязательных играх с использованием графовых нейронных сетей.</p></sec><sec><title>Метод</title><p>Метод. Выполнена сравнительная оценка метрик и матриц смежности для графов связей, задаваемых с применением геометрической и семантической метрик близости.</p></sec><sec><title>Основные результаты</title><p>Основные результаты. Показано, что семантическая близость более эффективна при построении графа межагентных связей, а применение орграфов обеспечивает гибкое управление информационными потоками.</p></sec><sec><title>Обсуждение</title><p>Обсуждение. Предложенные закономерности важно учитывать при организации многоагентного обучения с подкреплением в широком диапазоне областей применения.</p></sec></abstract><trans-abstract xml:lang="en"><p>The article considers the structures of representation of the graph of inter-agent connections for increasing the efficiency of agent interaction in cooperative competitive games using graph neural networks. A comparative assessment of metrics and adjacency matrices for graphs of connections defined using geometric and semantic metrics of proximity is performed. It is shown that semantic proximity is more effective in constructing a graph of inter-agent connections, and the use of oriented graphs ensures flexible management of information flows. The proposed patterns are important to consider when organizing multi-agent reinforcement learning in a wide range of application areas.</p></trans-abstract><kwd-group xml:lang="ru"><kwd>теория графов</kwd><kwd>графовые нейронные сети</kwd><kwd>обучение с подкреплением</kwd><kwd>многоагентные системы</kwd><kwd>кооперативно-состязательное поведение</kwd></kwd-group><kwd-group xml:lang="en"><kwd>graph theory</kwd><kwd>graph neural networks</kwd><kwd>reinforcement learning</kwd><kwd>multi-agent systems</kwd><kwd>cooperative-competitive behavior</kwd></kwd-group><funding-group><funding-statement xml:lang="ru">Работа выполнена при поддержке Министерства науки и высшего образования Российской Федерации, госзадание № 2019-1339.</funding-statement><funding-statement xml:lang="en">The Ministry of Science and Higher Education of the Russian Federation: State Assignment No. 2019-1339.</funding-statement></funding-group></article-meta></front><back><ref-list><title>References</title><ref id="cit1"><label>1</label><citation-alternatives><mixed-citation xml:lang="ru">Yang S. Hierarchical graph multi-agent reinforcement learning for traffic signal control // Information Sciences. 2023. V. 634. P. 55–72. https://doi.org/10.1016/j.ins.2023.03.087</mixed-citation><mixed-citation xml:lang="en">Yang S. Hierarchical graph multi-agent reinforcement learning for traffic signal control. Information Sciences, 2023, vol. 634, pp. 55–72. https://doi.org/10.1016/j.ins.2023.03.087</mixed-citation></citation-alternatives></ref><ref id="cit2"><label>2</label><citation-alternatives><mixed-citation xml:lang="ru">Veličković P. Everything is connected: Graph neural networks // Current Opinion in Structural Biology. 2023. V. 79. P. 102538. https://doi.org/10.1016/j.sbi.2023.102538</mixed-citation><mixed-citation xml:lang="en">Veličković P. Everything is connected: Graph neural networks. Current Opinion in Structural Biology, 2023, vol. 79, pp. 102538. https://doi.org/10.1016/j.sbi.2023.102538</mixed-citation></citation-alternatives></ref><ref id="cit3"><label>3</label><citation-alternatives><mixed-citation xml:lang="ru">Khemani B., Patil S., Kotecha K., Tanwar S. A review of graph neural networks: concepts, architectures, techniques, challenges, datasets, applications, and future directions // Journal of Big Data. 2024. V. 11. N 1. P. 18. https://doi.org/10.1186/s40537-023-00876-4</mixed-citation><mixed-citation xml:lang="en">Khemani B., Patil S., Kotecha K., Tanwar S. A review of graph neural networks: concepts, architectures, techniques, challenges, datasets, applications, and future directions. Journal of Big Data, 2024, vol. 11, no. 1, pp. 18. https://doi.org/10.1186/s40537-023-00876-4</mixed-citation></citation-alternatives></ref><ref id="cit4"><label>4</label><citation-alternatives><mixed-citation xml:lang="ru">Nie M., Chen D., Wang D. Reinforcement learning on graphs: A survey // IEEE Transactions on Emerging Topics in Computational Intelligence. 2023. V. 7. N 4. P. 1065–1082. https://doi.org/10.1109/tetci.2022.3222545</mixed-citation><mixed-citation xml:lang="en">Nie M., Chen D., Wang D. Reinforcement learning on graphs: A survey. IEEE Transactions on Emerging Topics in Computational Intelligence, 2023, vol. 7, no. 4, pp. 1065–1082. https://doi.org/10.1109/tetci.2022.3222545</mixed-citation></citation-alternatives></ref><ref id="cit5"><label>5</label><citation-alternatives><mixed-citation xml:lang="ru">Zhou J., Cui G., Hu S., Zhang Z., Yang C., Liu Z., Wang L., Li C., Sun M. Graph neural networks: A review of methods and applications // AI Open. 2020. V. 1. P. 57–81. https://doi.org/10.1016/j.aiopen.2021.01.001</mixed-citation><mixed-citation xml:lang="en">Zhou J., Cui G., Hu S., Zhang Z., Yang C., Liu Z., Wang L., Li C., Sun M. Graph neural networks: A review of methods and applications. AI Open, 2020, vol. 1, pp. 57–81. https://doi.org/10.1016/j.aiopen.2021.01.001</mixed-citation></citation-alternatives></ref><ref id="cit6"><label>6</label><citation-alternatives><mixed-citation xml:lang="ru">Wu Z., Pan S., Chen F., Long G., Zhang C., Yu P.S. A comprehensive survey on graph neural networks // IEEE Transactions on Neural Networks and Learning Systems. 2020. V. 32. N 1. P. 4–24. https://doi.org/10.1109/tnnls.2020.2978386</mixed-citation><mixed-citation xml:lang="en">Wu Z., Pan S., Chen F., Long G., Zhang C., Yu P.S. A comprehensive survey on graph neural networks. IEEE Transactions on Neural Networks and Learning Systems, 2020, vol. 32, no. 1, pp. 4–24. https://doi.org/10.1109/tnnls.2020.2978386</mixed-citation></citation-alternatives></ref><ref id="cit7"><label>7</label><citation-alternatives><mixed-citation xml:lang="ru">Bhatti U.A., Tang H., Wu G., Marjan S., Hussain A. Deep learning with graph convolutional networks: An overview and latest applications in computational intelligence // International Journal of Intelligent Systems. 2023. V. 2023. P. 8342104. https://doi.org/10.1155/2023/8342104</mixed-citation><mixed-citation xml:lang="en">Bhatti U.A., Tang H., Wu G., Marjan S., Hussain A. Deep learning with graph convolutional networks: An overview and latest applications in computational intelligence. International Journal of Intelligent Systems, 2023, vol. 2023, pp. 8342104. https://doi.org/10.1155/2023/8342104</mixed-citation></citation-alternatives></ref><ref id="cit8"><label>8</label><citation-alternatives><mixed-citation xml:lang="ru">Wu L., Cui P., Pei J., Zhao L., Guo X. Graph neural networks: foundation, frontiers and applications // Proc. of the 28th ACM SIGKDD Conference on Knowledge Discovery and Data Mining. 2022. P. 4840–4841. https://doi.org/10.1145/3534678.3542609</mixed-citation><mixed-citation xml:lang="en">Wu L., Cui P., Pei J., Zhao L., Guo X. Graph neural networks: foundation, frontiers and applications. Proc. of the 28th ACM SIGKDD Conference on Knowledge Discovery and Data Mining, 2022, pp. 4840–4841. https://doi.org/10.1145/3534678.3542609</mixed-citation></citation-alternatives></ref><ref id="cit9"><label>9</label><citation-alternatives><mixed-citation xml:lang="ru">Meng L., Shao Y., Yuan L., Lai L., Cheng P., Li X., Yu W., Zhang W., Lin X., Zhou J. A survey of distributed graph algorithms on massive graphs // ACM Computing Surveys. 2024. V. 57. N 2. P. 1–39. https://doi.org/10.1145/3694966</mixed-citation><mixed-citation xml:lang="en">Meng L., Shao Y., Yuan L., Lai L., Cheng P., Li X., Yu W., Zhang W., Lin X., Zhou J. A survey of distributed graph algorithms on massive graphs. ACM Computing Surveys, 2024, vol. 57, no. 2, pp. 1–39. https://doi.org/10.1145/3694966</mixed-citation></citation-alternatives></ref><ref id="cit10"><label>10</label><citation-alternatives><mixed-citation xml:lang="ru">Vrahatis A.G., Lazaros K., Kotsiantis S. Graph Attention Networks: A Comprehensive Review of Methods and Applications // Future Internet. 2024. V. 16. N 9. P. 318. https://doi.org/10.3390/fi16090318</mixed-citation><mixed-citation xml:lang="en">Vrahatis A.G., Lazaros K., Kotsiantis S. Graph Attention Networks: A Comprehensive Review of Methods and Applications. Future Internet, 2024, vol. 16, no. 9, pp. 318. https://doi.org/10.3390/ fi16090318</mixed-citation></citation-alternatives></ref><ref id="cit11"><label>11</label><citation-alternatives><mixed-citation xml:lang="ru">Munikoti S., Agarwal D., Das L., Halappanavar M., Natarajan B. Challenges and opportunities in deep reinforcement learning with graph neural networks: A comprehensive review of algorithms and applications // IEEE Transactions on Neural Networks and Learning Systems. 2023. V. 35. N 11. P. 15051–15071. https://doi.org/10.1109/tnnls.2023.3283523</mixed-citation><mixed-citation xml:lang="en">Munikoti S., Agarwal D., Das L., Halappanavar M., Natarajan B. Challenges and opportunities in deep reinforcement learning with graph neural networks: A comprehensive review of algorithms and applications. IEEE Transactions on Neural Networks and Learning Systems, 2023, vol. 35, no. 11, pp. 15051–15071. https://doi.org/10.1109/tnnls.2023.3283523</mixed-citation></citation-alternatives></ref><ref id="cit12"><label>12</label><citation-alternatives><mixed-citation xml:lang="ru">Verbavatz V., Barthelemy M. Betweenness centrality in dense spatial networks // Physical Review E. 2022. V. 105. N 5. P. 054303. https://doi.org/10.1103/physreve.105.054303</mixed-citation><mixed-citation xml:lang="en">Verbavatz V., Barthelemy M. Betweenness centrality in dense spatial networks. Physical Review E, 2022, vol. 105, no. 5, pp. 054303. https://doi.org/10.1103/physreve.105.054303</mixed-citation></citation-alternatives></ref><ref id="cit13"><label>13</label><citation-alternatives><mixed-citation xml:lang="ru">Tsalouchidou I., Baeza-Yates R., Bonchi F., Liao K., Sellis T. Temporal betweenness centrality in dynamic graphs // International Journal of Data Science and Analytics. 2020. V. 9. N 3. P. 257–272. https://doi.org/10.1007/s41060-019-00189-x</mixed-citation><mixed-citation xml:lang="en">Tsalouchidou I., Baeza-Yates R., Bonchi F., Liao K., Sellis T. Temporal betweenness centrality in dynamic graphs. International Journal of Data Science and Analytics, 2020, vol. 9, no. 3, pp. 257– 272. https://doi.org/10.1007/s41060-019-00189-x</mixed-citation></citation-alternatives></ref><ref id="cit14"><label>14</label><citation-alternatives><mixed-citation xml:lang="ru">Wills P., Meyer F.G. Metrics for graph comparison: a practitionerʼs guide // PLoS ONE. 2020. V. 15. N 2. P. e0228728. https://doi.org/10.1371/journal.pone.0228728</mixed-citation><mixed-citation xml:lang="en">Wills P., Meyer F.G. Metrics for graph comparison: a practitionerʼs guide. PLoS ONE, 2020, vol. 15, no. 2, pp. e0228728. https://doi.org/10.1371/journal.pone.0228728</mixed-citation></citation-alternatives></ref><ref id="cit15"><label>15</label><citation-alternatives><mixed-citation xml:lang="ru">O’Bray L., Horn M., Rieck B., Borgwardt K. Evaluation metrics for graph generative models: Problems, pitfalls, and practical solutions // Proc. of the ICLR 2022 — 10th International Conference on Learning Representations. 2022.</mixed-citation><mixed-citation xml:lang="en">O’Bray L., Horn M., Rieck B., Borgwardt K. Evaluation metrics for graph generative models: Problems, pitfalls, and practical solutions. Proc. of the ICLR 2022 — 10th International Conference on Learning Representations, 2022.</mixed-citation></citation-alternatives></ref></ref-list><fn-group><fn fn-type="conflict"><p>The authors declare that there are no conflicts of interest present.</p></fn></fn-group></back></article>
