Every equivalence class of short games formed over the antisymmetrization relation ≈ has a computable representative called the 'canonical' game, which is the undominated, irreversible game such that for all [Short] IGames x y, x ≈ y ↔ canonical x = canonical y.
Every equivalence class of short games formed over the antisymmetrization relation ≈ has a computable representative called the 'canonical' game, which is the undominated, irreversible game such that for all [Short] IGames x y,
x ≈ y ↔ canonical x = canonical y.