Sciweavers

356 search results - page 9 / 72
» Graph Games on Ordinals
Sort
View
87
Voted
EJC
2008
14 years 9 months ago
Eriksson's numbers game and finite Coxeter groups
The numbers game is a one-player game played on a finite simple graph with certain "amplitudes" assigned to its edges and with an initial assignment of real numbers to i...
Robert G. Donnelly
66
Voted
JAL
2002
99views more  JAL 2002»
14 years 9 months ago
Kayles and Nimbers
Kayles is a combinatorial game on graphs. Two players select alternatingly a vertex from a given graph G - a chosen vertex may not be adjacent or equal to an already chosen vertex...
Hans L. Bodlaender, Dieter Kratsch
FSTTCS
2008
Springer
14 years 10 months ago
Banach-Mazur Games on Graphs
We survey determinacy, definability, and complexity issues of Banach-Mazur games on finite and infinite graphs. Infinite games where two players take turns to move a token thro...
Erich Grädel
71
Voted
ICALP
2010
Springer
15 years 1 months ago
Energy Parity Games
Energy parity games are infinite two-player turn-based games played on weighted graphs. The objective of the game combines a (qualitative) parity condition with the (quantitative)...
Krishnendu Chatterjee, Laurent Doyen
LPAR
2010
Springer
14 years 8 months ago
The Complexity of Partial-Observation Parity Games
We consider two-player zero-sum games on graphs. On the basis of the information available to the players these games can be classified as follows: (a) partial-observation (both p...
Krishnendu Chatterjee, Laurent Doyen