21 search results - page 3 / 5 » On Optimal Strategies for a Hat Game on Graphs |
EJC
2007
13 years 6 months ago
2007
We introduce and study online balanced coloring games on the random graph process. The game is played by a player we call Painter. Edges of the complete graph with n vertices are ...
ICALP
2009
Springer
14 years 6 months ago
2009
Springer
A stochastic game is a two-player game played on a graph, where in each state the successor is chosen either by one of the players, or according to a probability distribution. We s...
CORR
2010
Springer
13 years 6 months ago
2010
Springer
We study Maker-Breaker games played on the edge set of a random graph. Specifically, we consider the random graph process and analyze the first time in a typical random graph proc...
MFCS
2004
Springer
13 years 11 months ago
2004
Springer
We consider infinite antagonistic games over finite graphs. We present conditions that, whenever satisfied by the payoff mapping, assure for both players positional (memoryless...
LICS
2008
IEEE
14 years 22 days ago
2008
IEEE
We investigate the notions of may- and mustapproximation in Erratic Idealized Algol (a nondeterministic extension of Idealized Algol), and give explicit characterizations of both ...