Optimal Coloring Strategies for the Max <i>k</i>-Cut Game

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 strate...

Full description

Bibliographic Details
Main Authors: Andrea Garuglieri, Dario Madeo, Chiara Mocenni, Giulia Palma, Simone Rinaldi
Format: Article
Language:English
Published: MDPI AG 2024-02-01
Series:Mathematics
Subjects:
max <i>k</i>-cut problem
game theory
optimal colorings
coalitions
Nash equilibrium
Online Access:https://www.mdpi.com/2227-7390/12/4/604

Internet

https://www.mdpi.com/2227-7390/12/4/604

Similar Items