Reduced Canonical Forms of Stoppers

Aaron N. Siegel


The reduced canonical form of a loopfree game $G$ is the simplest game infinitesimally close to $G$. Reduced canonical forms were introduced by Calistrate, and Grossman and Siegel provided an alternate proof of their existence. In this paper, we show that the Grossman–Siegel construction generalizes to find reduced canonical forms of certain loopy games.

Full Text: