Reduced canonical forms of stoppers (Q2500976)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Reduced canonical forms of stoppers |
scientific article; zbMATH DE number 5050775
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Reduced canonical forms of stoppers |
scientific article; zbMATH DE number 5050775 |
Statements
Reduced canonical forms of stoppers (English)
0 references
30 August 2006
0 references
Summary: The reduced canonical form of a loopfree game \(G\) is the simplest game infinitesimally close to \(G\). Reduced canonical forms were introduced by \textit{D. Calistrate} [in: Games of no chance. Combinatorial games at MSRI. Workshop, July 11--21, 1994 in Berkeley, CA, USA. Cambridge: Cambridge Univ. Press. Math. Sci. Res. Inst. Publ. 29, 409--416 (1997; Zbl 0872.90132)], 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.
0 references
0.8525955080986023
0 references
0.7571061849594116
0 references
