Balance Games on Colored Graphs
نویسندگان
چکیده
We consider games played on finite colored graphs for an infinite number of rounds, whose goal is to visit all colors with the same asymptotic frequency. Such games may represent scheduling problems with special fairness constraints. We show that the main corresponding decision problems are Co-NP-
منابع مشابه
On Complexity of Flooding Games on Graphs with Interval Representations
The flooding games, which are called Flood-It, Mad Virus, or HoneyBee, are a kind of coloring games and they have been becoming popular online. In these games, each player colors one specified cell in his/her turn, and all connected neighbor cells of the same color are also colored by the color. This flooding or coloring spreads on the same color cells. It is natural to consider the coloring ga...
متن کاملEffectiveness of Videogames on Balance and Fear of Falling in Chronic Stroke Patient
Objectives: Balance disorder is one of the most common problems after stroke causes falling and fear of falling in some patients. The balance based video games are newly used in people with motor problems. It is very important to use different interventions for balance issues. The aim of this study is to determine the effectiveness of videogame on balance and fear of falling in one participant....
متن کاملPure Nash equilibria: complete characterization of hard and easy graphical games
We consider the computational complexity of pure Nash equilibria in graphical games. It is known that the problem is NP-complete in general, but tractable (i.e., in P) for special classes of graphs such as those with bounded treewidth. It is then natural to ask: is it possible to characterize all tractable classes of graphs for this problem? In this work, we provide such a characterization for ...
متن کاملThe Complexity of Coloring Games on Perfect Graphs
In this paper we consider the following type of game: two players must color the vertices of a given graph G = (V, E), in a prescribed order, in such a way that no two adjacent vertices are colored with the same color. In one variant, the first player which is unable to move loses the game. In another variant, player 1 wins the game, if and only if the game ends with all vertices colored. In th...
متن کاملThrottling zero force propagation speed on graphs
Zero forcing is a game played on a graph that starts with a coloring of the vertices as white and black and at each step any vertex colored black with a unique neighbor colored white “forces” the color of the white vertex to become black. In this note we look at what happens when we balance the size of the initial set of vertices colored black and the number of steps, called speed of propagaion...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2009