EUVIMEDEUVIMED entdecken
Crossref

Geometric constraint landscapes: Polynomial time coalition formation in conditional games

Vu Duc Nghia, Janos Demetrovics, Vu Duc Thi, Le Quang Minh, Nguyen Hoang Son

Journal of Computer Science and Cybernetics · 29.04.2026 · 42 (2)

DOI: 10.15625/1813-9663/24322 ↗

Kurz gefasst

Fachartikel in der Zeitschrift Journal of Computer Science and Cybernetics, online erschienen am 29.04.2026. Verfasst von Vu Duc Nghia und 4 weiteren Autor:innen.

AbstractBibliografische AngabenZitierenVerwandte Studien

Abstract (Originalsprache)

In this paper, by introducing novel conditional games, we contribute to AI and multi-agent systems by modeling real-world coalition formation with multiple interdependent constraints that simple games cannot achieve. While simple games treat all players as identical units with a single threshold, conditional games with linear constraints create geometric structure in the solution space, transforming NP-hard problems into polynomial-time solvable ones. This enables AI systems to identify minimal winning coalitions in real-time for complex scenarios like resource-constrained influence maximization in influencer marketing, cybersecurity configuration management, and ethical AI governance frameworks. The precise boundary analysis provided by linear constraints allows multi-agent systems to navigate strategic thresholds with mathematical precision, optimizing resource allocation by identifying exactly which agents are critical for crossing success boundaries. This computational and strategic advantage, turning constraint-induced structure into navigable geometric landscapes, enables sophisticated coalition formation, predictive strategic planning, and dynamic adaptation that simple games, with their arbitrary winning coalition distributions and exponential complexity, simply cannot support in practical applications. The geometric-structure-leveraged Constraint Projection Algorithm is presented with real-world simulation applied in green influencer marketing, demonstrating how the polynomial constraint projection algorithm transforms influencer selection from a trial-and-error process into a precise, data-driven optimization.

Zitieren

APA

Nghia, V. D., Demetrovics, J., Thi, V. D., Minh, L. Q., & Son, N. H. (2026). Geometric constraint landscapes: Polynomial time coalition formation in conditional games. Journal of Computer Science and Cybernetics, 42(2). https://doi.org/10.15625/1813-9663/24322

Vancouver

Nghia VD, Demetrovics J, Thi VD, Minh LQ, Son NH. Geometric constraint landscapes: Polynomial time coalition formation in conditional games. Journal of Computer Science and Cybernetics. 2026;42(2). doi:10.15625/1813-9663/24322

BibTeX
@article{Nghia2026,
  author = {Nghia, Vu Duc and Demetrovics, Janos and Thi, Vu Duc and Minh, Le Quang and Son, Nguyen Hoang},
  title = {Geometric constraint landscapes: Polynomial time coalition formation in conditional games},
  journal = {Journal of Computer Science and Cybernetics},
  year = {2026},
  volume = {42},
  number = {2},
  doi = {10.15625/1813-9663/24322}
}
Kostenlos starten →