Strong convergence and the polygon property of 1-player games

DOI10.1016/0012-365X(95)00131-FzbMath0849.90149OpenAlexW2030850412MaRDI QIDQ1917518

Kimmo Eriksson

Publication date: 7 July 1996

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0012-365x(95)00131-f

zbMATH Keywords

strong convergenceone-player game

Mathematics Subject Classification ID

Games involving graphs (91A43) Combinatorial games (91A46)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Chip-firing games on directed graphs
• Convergence of Mozes's game of numbers
• The diamond lemma for ring theory
• Reachability is decidable in the numbers game
• Extendable shellability for rank 3 matroid complexes
• The numbers game and Coxeter groups
• Strong convergence and a game of numbers
• On theories with a combinatorial definition of 'equivalence'
• La correspondance de Robinson