Remarks on strategies in combinatorial games

DOI10.1016/0166-218X(85)90070-8zbMath0601.90150OpenAlexW1974154300MaRDI QIDQ1081541

J. Úlehla, Ales Pultr

Publication date: 1985

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0166-218x(85)90070-8

zbMATH Keywords

axiom of choicewinning strategyexistence proofscombinatorial games as a relationloss-preventing strategypersistent strategypreference function in a minimax formweakly winning

Mathematics Subject Classification ID

Game theory (91A99) 2-person games (91A05) Other classical set theory (including functions, relations, and set algebra) (03E20) Axiom of choice and related propositions (03E25)

Related Items (1)

Tarski's fixpoint lemma and combinatorial games

Cites Work

• Unnamed Item
• Unnamed Item
• Sur une théorie ensembliste des jeux alternatifs
• From Nim to Go
• Graphs and composite games

This page was built for publication: Remarks on strategies in combinatorial games