Abstract
We investigate pure Nash equilibria in generalized graph k-coloring games where we are given an edge-weighted undirected graph together with a set of k colors. Nodes represent players and edges capture their mutual interests. The strategy set of each player consists of k colors. The utility of a player v in a given state or coloring is given by the sum of the weights of edges \(\{v,u\}\) incident to v such that the color chosen by v is different than the one chosen by u, plus the profit gained by using the chosen color. Such games form some of the basic payoff structures in game theory, model lots of real-world scenarios with selfish players and extend or are related to several fundamental class of games.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
