Solutions of transferable utility cooperative games
A. Stefanescu (1994)
RAIRO - Operations Research - Recherche Opérationnelle
Similarity:
Displaying similar documents to “On dot-depth two”
Solutions of transferable utility cooperative games
A morphic approach to combinatorial games: the Tribonacci case
Eric Duchêne, Michel Rigo (2007)
RAIRO - Theoretical Informatics and Applications
Similarity:
We propose a variation of Wythoff's game on three piles of tokens, in the sense that the losing positions can be derived from the Tribonacci word instead of the Fibonacci word for the two piles game. Thanks to the corresponding exotic numeration system built on the Tribonacci sequence, deciding whether a game position is losing or not can be computed in polynomial time.
Two pile move-size dynamic Nim.
Holshouser, Arthur, Reiter, Harold (2005)
Discrete Mathematics and Theoretical Computer Science. DMTCS [electronic only]
Similarity:
Some observations and solutions to short and long global Nim.
James, Jeffery, Schlatter, Mark (2008)
Integers
Similarity:
On the complexity of -player Hackenbush.
Cincotti, Alessandro (2009)
Integers
Similarity:
The sequential join of combinatorial games.
Stewart, Fraser (2007)
Integers
Similarity:
Simplification of partizan games in misère play.
Mesdal, G.A., Ottaway, P. (2007)
Integers
Similarity:
One-pile misère Nim for three or more players.
Kelly, Annela R. (2006)
International Journal of Mathematics and Mathematical Sciences
Similarity:
Degrees of indeterminacy of games
Andreas Blass (1972)
Fundamenta Mathematicae
Similarity: