@article{MTMT:37013474, title = {Relational games and repeated bayesian relational games with decision tables for influencer marketing}, url = {https://m2.mtmt.hu/api/publication/37013474}, author = {Nghia, Vu Duc and Demetrovics, János and Thi, Vu Duc and Son, Nguyen Hoang and Giang, Nguyen Long}, doi = {10.1007/s00500-025-11043-7}, journal-iso = {SOFT COMPUT}, journal = {SOFT COMPUTING}, volume = {30}, unique-id = {37013474}, issn = {1432-7643}, year = {2026}, eissn = {1433-7479}, pages = {1637-1663} } @article{MTMT:37353270, title = {Deterministic Q-Learning with Relational Game Theory: Polynomial-Time Convergence to Minimal Winning Coalitions in Symmetric Influence Networks and Extension}, url = {https://m2.mtmt.hu/api/publication/37353270}, author = {Vu, Duc Nghia and Demetrovics, János}, doi = {10.3390/math14091526}, journal-iso = {MATHEMATICS-BASEL}, journal = {MATHEMATICS}, volume = {14}, unique-id = {37353270}, abstract = {This paper presents a theoretically grounded integration of deterministic Q-learning with relational game theory (QLRG) for efficiently identifying minimal winning coalitions in Online Social Networks (OSNs). We address the fundamental challenge that coalition formation is NP-hard under traditional approaches by leveraging structural properties of relational dependencies and Armstrong’s axioms to transform the problem into one solvable in polynomial time. Our framework reduces the state space from exponential O(2n) to O(n2) through a sufficient statistic representation based on coalition size, follower reach, and terminal status, while achieving O(n4) time complexity under deterministic, static, and sufficiently symmetric influence structures. The QLRG framework introduces three critical innovations: (1) a principled agent selection mechanism derived directly from the Q-function that eliminates heuristic weight tuning; (2) a formal Boost action defined through temporal closure operators that captures influence spread dynamics; and (3) a constrained MDP formulation that enforces relational consistency through action elimination rather than penalty terms. We prove that the Bellman optimality operator forms a contraction mapping, guaranteeing deterministic convergence to optimal policies with established rates of O(1/√k) for decreasing learning rates or linear convergence up to bias for constant rates. To bridge the gap between this idealized model and the asymmetry inherent in real OSNs, we further develop a cluster-based sufficient statistics approach. By partitioning the network into communities with bounded internal variation, we relax the global symmetry requirement while preserving polynomial state space complexity, and obtaining a single within-community swap changes the optimal Q-value by at most εi1−γ, which is a local Lipschitz continuity result. The implications of this are both theoretical and practical, and they form the bedrock for relaxing the global symmetry assumption in the QLRG framework. Empirical validation on synthetic networks satisfying the symmetry assumption demonstrates that QLRG consistently identifies minimal winning coalitions matching the optimal solutions found by exhaustive search, while operating with polynomial-time complexity. Unlike conventional approaches, our framework simultaneously satisfies four critical properties: deterministic convergence, policy optimality, minimal coalition identification, and computational tractability. The work bridges computational social science and operations research, providing a mathematically rigorous foundation for strategic decision-making in influencer marketing and coalition formation. While the framework requires symmetry assumptions that may only hold approximately in real-world OSNs, it establishes an idealized baseline for future extensions addressing stochasticity, dynamics, and partial observability. This research represents a paradigm shift from empirical improvements to theoretically grounded convergence guarantees for coalition formation problems, demonstrating how structural mathematical insights can transform intractable problems into efficiently solvable ones without sacrificing solution quality.}, year = {2026}, eissn = {2227-7390}, pages = {1-47}, orcid-numbers = {Vu, Duc Nghia/0009-0006-2088-5506} } @article{MTMT:37545652, title = {Cluster-Based Q-Learning Relational Game (C-QLRG): A Practical Relaxation for Asymmetric Online Social Networks}, url = {https://m2.mtmt.hu/api/publication/37545652}, author = {Vu, Duc Nghia and Demetrovics, János}, doi = {10.3390/ai7060231}, journal-iso = {AI}, journal = {AI}, volume = {7}, unique-id = {37545652}, abstract = {The Q-Learning Relational Game (QLRG) framework provides a theoretically rigorous method for identifying minimal winning coalitions in online social networks (OSNs) under the restrictive assumption of global agent symmetry or uniform matroid structure. Real-world OSNs, however, exhibit significant asymmetry. This paper introduces the Cluster-Based Q-Learning Relational Game (C-QLRG), a practical extension that relaxes the global symmetry requirement by leveraging community structure. We partition the agent set into communities with bounded internal variation and represent the state solely by community membership counts of the seed set. Because the closure operator already captures all eventual influence spread, the problem reduces to a sequential seed selection task where the agent decides, at each step, from which community to add the next seed. We prove that the optimal Q-function of a suitably regularized reach-efficiency objective is Lipschitz continuous and derive a performance bound for the learned policy. The full algorithm is presented, and its complexity is analyzed. Empirical evaluations on a synthetic asymmetric network and Zachary’s Karate Club demonstrate that C-QLRG is highly sensitive to reward parameters, where default settings lead to premature stopping, but parameter tuning combined with a corrected minimality verification recovers high-efficiency coalitions by removing non-contributing agents. With tuned parameters, C-QLRG produces a near-winning coalition of size 11 and 99% reach on the synthetic network, surpassing the greedy baseline’s efficiency (size 12) despite a one-node coverage gap, while identifying the optimal winning coalition of size 1 on the Karate Club dataset, matching all baselines. The framework thus offers a principled trade-off between model fidelity and scalability, with the reward design choice being critical for practical deployment.}, year = {2026}, eissn = {2673-2688}, pages = {231}, orcid-numbers = {Vu, Duc Nghia/0009-0006-2088-5506} } @article{MTMT:37545660, title = {Relational and Weighted Cost-Relational Cooperative Games for Influencer Coalition Optimization in Environmental Sustainability: Algorithms, Complexity, and Cost Efficiency}, url = {https://m2.mtmt.hu/api/publication/37545660}, author = {Vu, Duc Nghia and Demetrovics, János and Nguyen, Hoang Son}, doi = {10.3390/computers15070410}, journal-iso = {COMPUTERS}, journal = {COMPUTERS}, volume = {15}, unique-id = {37545660}, issn = {2073-431X}, abstract = {This paper addresses the critical challenge of identifying cost-effective coalitions of social media influencers to promote environmental sustainability (ES) messages under budget constraints. Traditional influencer marketing often relies on heuristics that ignore relational dependencies and heterogeneous agent costs, leading to redundant coverage and suboptimal resource allocation. To overcome these limitations, we introduce a novel Relational Cooperative Game (RG) framework that formalizes pre-determined dependencies among influencers and followers using closure operators, enabling a portfolio of polynomial-time identification algorithms for Minimal Winning Coalitions (MWCs). We further extend this model to the Weighted Cost-Relational Game (WCRG) to optimize campaigns with heterogeneous influencer costs. We prove that finding a Minimum-Cost Winning Coalition (MCWC) is NP-hard via reduction from weighted set cover and propose two complementary algorithms: (1) a Greedy Cost–Benefit (GCB) algorithm that operates in polynomial time and empirically achieves optimal solutions across all tested instances; a logarithmic approximation guarantee is established for the restricted single-antecedent model; and (2) an Integer Linear Programming (ILP) formulation enhanced with Strongly Connected Component (SCC) preprocessing to handle cyclic dependencies and yield exact optimal solutions for moderate instances. Extensive empirical validation, ranging from a representative six-agent cyclic scenario to large-scale synthetic networks (up to 300 agents), confirms the framework’s robustness and scalability. Results demonstrate that GCB consistently achieves optimal solutions (approximation ratio = 1.000×) with subsecond runtime (<0.2 s) and minimal memory overhead (<50 MB), while ILP-SCC leverages graph condensation for rapid exact solving. Compared to size-based baselines, WCRG achieves up to 95.2% cost savings by systematically leveraging cost-efficient micro-influencers, empirically validating that minimizing coalition size does not guarantee cost efficiency. These findings establish WCRG as a scalable, budget-aware optimization toolkit for maximizing the impact of sustainability campaigns through relational coalition design.}, year = {2026}, eissn = {2073-431X}, pages = {410}, orcid-numbers = {Vu, Duc Nghia/0009-0006-2088-5506; Nguyen, Hoang Son/0000-0003-0468-8327} } @article{MTMT:36847089, title = {Approximate Relational Games For Green Influencer Marketing Optimization}, url = {https://m2.mtmt.hu/api/publication/36847089}, author = {Vu, Nghia D. and Demetrovics, János and Nguyen, Giang L. and Vu, Thi D. and Nguyen, Son H. and Nguyen, Kuop G.}, doi = {10.1109/ACCESS.2025.3605398}, journal-iso = {IEEE ACCESS}, journal = {IEEE ACCESS}, volume = {13}, unique-id = {36847089}, year = {2025}, eissn = {2169-3536}, pages = {158967-158983}, orcid-numbers = {Vu, Nghia D./0009-0006-2088-5506; Nguyen, Giang L./0000-0001-6184-1469; Nguyen, Kuop G./0009-0000-3770-574X} } @article{MTMT:33197390, title = {Investigation of Dense Family of Closure Operations}, url = {https://m2.mtmt.hu/api/publication/33197390}, author = {Son, N H and Demetrovics, János and Thi, V D and Thuy, N N}, doi = {10.2478/cait-2022-0025}, journal-iso = {CYBERN INF TECHNOL}, journal = {CYBERNETICS AND INFORMATION TECHNOLOGIES}, volume = {22}, unique-id = {33197390}, issn = {1311-9702}, abstract = {As a basic notion in algebra, closure operations have been successfully applied to many fields of computer science. In this paper we study dense family in the closure operations. In particular, we prove some families to be dense in any closure operation, in which the greatest and smallest dense families, including the collection of the whole closed sets and the minimal generator of the closed sets, are also pointed out. More important, a necessary and sufficient condition for an arbitrary family to be dense is provided in our paper. Then we use these dense families to characterize minimal keys of the closure operation under the viewpoint of transversal hypergraphs and construct an algorithm for determining the minimal keys of a closure operation.}, year = {2022}, eissn = {1314-4081}, pages = {18-28} } @article{MTMT:32335159, title = {Some Properties Related to Reduct of Consistent Decision Systems}, url = {https://m2.mtmt.hu/api/publication/32335159}, author = {Giang, NL and Demetrovics, János and Thi, VD and Khoa, PD}, doi = {10.2478/cait-2021-0015}, journal-iso = {CYBERN INF TECHNOL}, journal = {CYBERNETICS AND INFORMATION TECHNOLOGIES}, volume = {21}, unique-id = {32335159}, issn = {1311-9702}, abstract = {Reduct of decision systems is the topic that has been attracting the interest of many researchers in data mining and machine learning for more than two decades. So far, many algorithms for finding reduct of decision systems by rough set theory have been proposed. However, most of the proposed algorithms are heuristic algorithms that find one reduct with the best classification quality. The complete study of properties of reduct of decision systems is limited. In this paper, we discover equivalence properties of reduct of consistent decision systems related to a Sperner-system. As the result, the study of the family of reducts in a consistent decision system is the study of Sperner-systems.}, keywords = {relational database; Rough set theory; Reduct; Sperner-system; decision system}, year = {2021}, eissn = {1314-4081}, pages = {3-9} } @article{MTMT:31585540, title = {An Algorithm for Mining High Utility Sequential Patterns with Time Interval}, url = {https://m2.mtmt.hu/api/publication/31585540}, author = {Duong, H T and Demetrovics, János and Thi, V D and Thang, N T and Anh, T T}, doi = {10.2478/cait-2019-0032}, journal-iso = {CYBERN INF TECHNOL}, journal = {CYBERNETICS AND INFORMATION TECHNOLOGIES}, volume = {19}, unique-id = {31585540}, issn = {1311-9702}, abstract = {Mining High Utility Sequential Patterns (HUSP) is an emerging topic in data mining which attracts many researchers. The HUSP mining algorithms can extract sequential patterns having high utility (importance) in a quantitative sequence database. In real world applications, the time intervals between elements are also very important. However, recent HUSP mining algorithms cannot extract sequential patterns with time intervals between elements. Thus, in this paper, we propose an algorithm for mining high utility sequential patterns with the time interval problem. We consider not only sequential patterns' utilities, but also their time intervals. The sequence weight utility value is used to ensure the important downward closure property. Besides that, we use four time constraints for dealing with time interval in the sequence to extract more meaningful patterns. Experimental results show that our proposed method is efficient and effective in mining high utility sequential pattern with time intervals.}, keywords = {Time interval; Datamining; sequential pattern; high utility}, year = {2019}, eissn = {1314-4081}, pages = {3-16} } @article{MTMT:30323943, title = {An Efficient Method to Reduce the Size of Consistent Decision Tables}, url = {https://m2.mtmt.hu/api/publication/30323943}, author = {Demetrovics, János and Quang, Hoang Minh and Thi, Vu Duc and Anh, Nguyen Viet}, doi = {10.14232/actacyb.23.4.2018.4}, journal-iso = {ACTA CYBERN-SZEGED}, journal = {ACTA CYBERNETICA}, volume = {23}, unique-id = {30323943}, issn = {0324-721X}, year = {2018}, eissn = {2676-993X}, pages = {1039-1054} } @article{MTMT:3268553, title = {An optimization of closed frequent subgraph mining algorithm}, url = {https://m2.mtmt.hu/api/publication/3268553}, author = {Demetrovics, János and Quang, HM and Ank, NV and Thi, VD}, doi = {10.1515/cait-2017-0001}, journal-iso = {CYBERN INF TECHNOL}, journal = {CYBERNETICS AND INFORMATION TECHNOLOGIES}, volume = {17}, unique-id = {3268553}, issn = {1311-9702}, year = {2017}, eissn = {1314-4081}, pages = {3-15} }