Remarks on strategies in combinatorial games
Viewing strategies in combinatorial games as a relation \(S\subset X\times X\) where X is the set of states (instead of a mapping \(S: X\to X)\) the authors give: 1) a very short proof of the existence of a loss-preventing strategy, 2) a proof of the existence of a winning strategy without the axiom of choice, and 3) a proof of the theorem on the value of a game with a preference function in a minimax form.
scientific article; zbMATH DE number 3970567