Tarski's fixpoint lemma and combinatorial games

DOI10.1007/BF00383202zbMATH Open0733.90091OpenAlexW2077065689WikidataQ124807784 ScholiaQ124807784MaRDI QIDQ810391FDOQ810391

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

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

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)

Cites Work

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

Cited In (4)

• Representation of game algebras
• Title not available (Why is that?)
• Cop-win graphs with maximum capture-time
• Title not available (Why is that?)

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)