Tarski's fixpoint lemma and combinatorial games

DOI10.1007/BF00383202MaRDI QIDQ810391zbMATH OpenOpenAlexWikidataFDO

Authors Bernhard Banaschewski, A. Pultr

Publication date 1991

Published in Order (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/bf00383202

zbMATH Keywords

complete latticeexistence of winning strategiesgames on latticesgames on superalgebraic latticesgames with a topological tolerancepersistent strategies for combinatorial gamesTarski's fixpoint lemma for order preserving maps

Mathematics Subject Classification ID

2-person games (91A05) Combinatorial games (91A46) Ordered sets (06A99) Lattices (06B99)

Recommendations

• A note on a Tarski type fixed-point theorem
• The complexity of Tarski's fixed point theorem
• The set of Nash equilibria of a supermodular game is a complete lattice
• Lattices of games
• Remarks on strategies in combinatorial games

Cites work

• Graphs and composite games
• Remarks on strategies in combinatorial games
• Sur une théorie ensembliste des jeux alternatifs
• The fundamental duality of partially ordered sets

Cited in

(4)

• Cop-win graphs with maximum capture-time
• Representation of game algebras
• scientific article; zbMATH DE number 1424046 (Why is no real title available?)
• scientific article; zbMATH DE number 5038466 (Why is no real title available?)

This page was built for publication: Tarski's fixpoint lemma and combinatorial games

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q810391)