Zobrazeno 1 - 1
of 1
pro vyhledávání: '"Andrea Garuglieri"'
Publikováno v:
Mathematics, Vol 12, Iss 4, p 604 (2024)
We explore strong Nash equilibria in the max k-cut game on an undirected and unweighted graph with a set of k colors. Here, the vertices represent players, and the edges denote their relationships. Each player, v, selects a color as its strategy, and
Externí odkaz:
https://doaj.org/article/37ddb244fc3d4fc0af9b6857453fe6ed
