Search Game on an Odd Number of Arcs with Immobile Hider
Search Game on the Union of N Identical Graphs Joined at One or Two Points
Signed Chip Firing Games and symmetric Sandpile Models on the cycles
We investigate the Sandpile Model and Chip Firing Game and an extension of these models on cycle graphs. The extended model consists of allowing a negative number of chips at each vertex. We give the characterization of reachable configurations and of fixed points of each model. At the end, we give explicit formula for the number of their fixed points.
Snaky is a 41-dimensional winner.
Solitaire Clobber played on Hamming graphs.
Some hardness results for question/answer games.
Stability of Nash equilibria in locational games