Reduced Canonical Forms of Stoppers

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

• Type: Journal
• Year: 2006
• Where: COMBINATORICS
• Authors: Aaron N. Siegel
• Keywords: Canonical Forms, COMBINATORICS 2006, Loopfree Game, Simplest Game