One-pile misère Nim for three or more players.
Kelly, Annela R. (2006)
International Journal of Mathematics and Mathematical Sciences
Similarity:
Displaying similar documents to “On the complexity of -player Hackenbush.”
One-pile misère Nim for three or more players.
Simplification of partizan games in misère play.
Mesdal, G.A., Ottaway, P. (2007)
Integers
Similarity:
The sequential join of combinatorial games.
Stewart, Fraser (2007)
Integers
Similarity:
A mixed duel under arbitrary moving
S. Trybuła (1991)
Applicationes Mathematicae
Similarity:
Analysis and improvement attempt of prof. Alan Fowler's negotiation game
Jakub Jan Golik (2018)
Annales Universitatis Paedagogicae Cracoviensis | Studia ad Didacticam Mathematicae Pertinentia
Similarity:
The main goal of the following article is to design an improved version of the negotiation game created by prof. Alan Fowler (Fowler, 1997). I have tried to achieve this by constructing four separate versions of the game which represent different approaches while preserving rules, chosen basic technical assumptions and the simplicity of the base game. Each version of the game is supposed to i.a. make it less obvious, create new negotiation possibilities (including potential cooperation),...
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...
Permissive strategies: from parity games to safety games
Julien Bernet, David Janin, Igor Walukiewicz (2010)
RAIRO - Theoretical Informatics and 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...