Carrying umbrellas: An online relocation game on a graph.
Lee, Jae-Ha, Park, Chong-Dae, Chwa, Kyung-Yong (2001)
Journal of Graph Algorithms and Applications
Similarity:
Displaying similar documents to “Hercules versus Hidden Hydra Helper”
Carrying umbrellas: An online relocation game on a graph.
Prioric games and minimal degrees below
C. Yates (1974)
Fundamenta Mathematicae
Similarity:
Permissive strategies : from parity games to safety games
Julien Bernet, David Janin, Igor Walukiewicz (2002)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Similarity:
It is proposed to compare strategies in a parity game by comparing the sets of behaviours they allow. For such a game, there may be no winning strategy that encompasses all the behaviours of all winning strategies. It is shown, however, that there always exists a permissive strategy that encompasses all the behaviours of all memoryless strategies. An algorithm for finding such a permissive strategy is presented. Its complexity matches currently known upper bounds for the simpler problem...
Positions of value in generalized domineering and chess.
Drummond-Cole, Gabriel C. (2005)
Integers
Similarity:
On the open-open game
Peg Daniels, Kenneth Kunen, Haoxuan Zhou (1994)
Fundamenta Mathematicae
Similarity:
We modify a game due to Berner and Juhász to get what we call “the open-open game (of length ω)”: a round consists of player I choosing a nonempty open subset of a space X and II choosing a nonempty open subset of I’s choice; I wins if the union of II’s open sets is dense in X, otherwise II wins. This game is of interest for ccc spaces. It can be translated into a game on partial orders (trees and Boolean algebras, for example). We present basic results and various conditions under which...
Fixpoints, games and the difference hierarchy
Julian C. Bradfield (2003)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Similarity:
Drawing on an analogy with temporal fixpoint logic, we relate the arithmetic fixpoint definable sets to the winning positions of certain games, namely games whose winning conditions lie in the difference hierarchy over . This both provides a simple characterization of the fixpoint hierarchy, and refines existing results on the power of the game quantifier in descriptive set theory. We raise the problem of transfinite fixpoint hierarchies.
Galvin Tree-Games
E. C. Milner (1985)
Publications du Département de mathématiques (Lyon)
Similarity:
Two pile move-size dynamic Nim.
Holshouser, Arthur, Reiter, Harold (2005)
Discrete Mathematics and Theoretical Computer Science. DMTCS [electronic only]
Similarity:
On the complexity of -player Hackenbush.
Cincotti, Alessandro (2009)
Integers
Similarity:
Potential-based strategies for tic-tac-toe on the integer lattice with numerous directions.
Kruczek, Klay, Sundberg, Eric (2010)
The Electronic Journal of Combinatorics [electronic only]
Similarity: