Sciweavers

6 search results - page 2 / 2
» Almost Optimal Strategies in One Clock Priced Timed Games
Sort
View
80
Voted
EJC
2007
14 years 11 months ago
Online balanced graph avoidance games
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 ...
Martin Marciniszyn, Dieter Mitsche, Milos Stojakov...