{"id":1659,"date":"2026-05-16T14:20:59","date_gmt":"2026-05-16T14:20:59","guid":{"rendered":"https:\/\/www.cs.ubbcluj.ro\/~meco\/polarity-related-influence-maximization-through-multi-agent-reinforcement-learning-2026\/"},"modified":"2026-05-16T14:29:42","modified_gmt":"2026-05-16T14:29:42","slug":"polarity-related-influence-maximization-through-multi-agent-reinforcement-learning-2026","status":"publish","type":"post","link":"https:\/\/www.cs.ubbcluj.ro\/~meco\/polarity-related-influence-maximization-through-multi-agent-reinforcement-learning-2026\/","title":{"rendered":"Polarity Related Influence Maximization through Multi-Agent Reinforcement Learning (2026)"},"content":{"rendered":"<div class=\"entry-content\">\n<p>Proceedings of the 18th International Conference on Agents and Artificial Intelligence<\/p>\n<h2>Authors<\/h2>\n<p>Anik\u00f3 Kopacz, Camelia Chira<\/p>\n<h2>Abstract<\/h2>\n<p>Influence maximization is a network optimization problem, which consists of selecting nodes as sources while maximizing the spread of information. The source nodes that are initially activated form the seed set. Polarity-related influence maximization accounts for having both positive and negative types of relationships between nodes. In this paper, we propose a two-stage multi-agent reinforcement learning based approach to address the polarity-related influence maximization problem. In the first stage, Louvain community detection is applied to find interlinked groups of nodes, and we assign agents to a subset of the communities. The responsibility of the agents is to select a strategy to determine a node from the community as the next seed-node. In the second stage, a deep reinforcement learning model is trained to select the strategies that maximize the information spread in the network. The nodes determined by the agents are aggregated and form the seed set. The proposed approach is validated on the Bitcoin OTC, WikiElec and Slashdot directed signed networks, and the results show that community-based reinforcement learning agents are able to optimize the positive influence spread.<\/p>\n<h2>Citation<\/h2>\n<pre class=\"wp-block-preformatted\">@Inproceedings{Kopacz2026PolarityRI,\n author = {Anik\u00f3 Kopacz and Camelia Chira},\n booktitle = {Proceedings of the 18th International Conference on Agents and Artificial Intelligence},\n title = {Polarity Related Influence Maximization through Multi-Agent Reinforcement Learning},\n year = {2026}\n}<\/pre>\n<\/div>\n","protected":false},"excerpt":{"rendered":"<p>Proceedings of the 18th International Conference on Agents and Artificial Intelligence Authors Anik\u00f3 Kopacz, Camelia Chira Abstract Influence maximization is a network optimization problem, which consists of selecting nodes as sources while maximizing the spread of information. The source nodes that are initially activated form the seed set. Polarity-related influence maximization accounts for having both&hellip;<\/p>\n","protected":false},"author":6,"featured_media":1667,"comment_status":"closed","ping_status":"","sticky":false,"template":"","format":"standard","meta":[],"categories":[4],"tags":[8,11,20,47],"_links":{"self":[{"href":"https:\/\/www.cs.ubbcluj.ro\/~meco\/wp-json\/wp\/v2\/posts\/1659"}],"collection":[{"href":"https:\/\/www.cs.ubbcluj.ro\/~meco\/wp-json\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/www.cs.ubbcluj.ro\/~meco\/wp-json\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/www.cs.ubbcluj.ro\/~meco\/wp-json\/wp\/v2\/users\/6"}],"replies":[{"embeddable":true,"href":"https:\/\/www.cs.ubbcluj.ro\/~meco\/wp-json\/wp\/v2\/comments?post=1659"}],"version-history":[{"count":2,"href":"https:\/\/www.cs.ubbcluj.ro\/~meco\/wp-json\/wp\/v2\/posts\/1659\/revisions"}],"predecessor-version":[{"id":1663,"href":"https:\/\/www.cs.ubbcluj.ro\/~meco\/wp-json\/wp\/v2\/posts\/1659\/revisions\/1663"}],"wp:featuredmedia":[{"embeddable":true,"href":"https:\/\/www.cs.ubbcluj.ro\/~meco\/wp-json\/wp\/v2\/media\/1667"}],"wp:attachment":[{"href":"https:\/\/www.cs.ubbcluj.ro\/~meco\/wp-json\/wp\/v2\/media?parent=1659"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/www.cs.ubbcluj.ro\/~meco\/wp-json\/wp\/v2\/categories?post=1659"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/www.cs.ubbcluj.ro\/~meco\/wp-json\/wp\/v2\/tags?post=1659"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}