356 search results - page 4 / 72 » Graph Games on Ordinals |
IJCAI
2007
13 years 8 months ago
2007
We introduce and analyze q-potential games and qcongestion games, where q is a positive integer. A 1-potential (congestion) game is a potential (congestion) game. We show that a g...
ENDM
2006
13 years 7 months ago
2006
We introduce the incidence game chromatic number which unifies the ideas of game chromatic number and incidence coloring number of an undirected graph. For kdegenerate graphs with...
CSL
2008
Springer
13 years 9 months ago
2008
Springer
We study the logical definablity of the winning regions of parity games. For games with a bounded number of priorities, it is wellknown that the winning regions are definable in th...
ECML
2007
Springer
14 years 1 months ago
2007
Springer
A general game player is an agent capable of taking as input a description of a game’s rules in a formal language and proceeding to play without any subsequent human input. To do...
DM
2008
13 years 7 months ago
2008
This paper discusses the game colouring number of partial k-trees and planar graphs. Let colg(PT k) and colg(P) denote the maximum game colouring number of partial k trees and the...