Optimal Coloring Strategies for the Max <i>k</i>-Cut Game
We explore strong Nash equilibria in the max <i>k</i>-cut game on an undirected and unweighted graph with a set of <i>k</i> colors. Here, the vertices represent players, and the edges denote their relationships. Each player, <i>v</i>, selects a color as its strategy, and its payoff (or utility) is d...
Wedi'i Gadw mewn:
| Prif Awduron: | , , , , |
|---|---|
| Fformat: | Artigo |
| Iaith: | Inglês |
| Cyhoeddwyd: |
MDPI AG
2024-02-01
|
| Cyfres: | Mathematics |
| Pynciau: | |
| Mynediad Ar-lein: | https://www.mdpi.com/2227-7390/12/4/604 |
| Tagiau: |
Dim Tagiau, Byddwch y cyntaf i dagio'r cofnod hwn!
|