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...
Збережено в:
| Автори: | , , , , |
|---|---|
| Формат: | Artigo |
| Мова: | Inglês |
| Опубліковано: |
MDPI AG
2024-02-01
|
| Серія: | Mathematics |
| Предмети: | |
| Онлайн доступ: | https://www.mdpi.com/2227-7390/12/4/604 |
| Теги: |
Немає тегів, Будьте першим, хто поставить тег для цього запису!
|