Filter games and combinatorial properties of winning strategies

1995/01/26 by Claude Laflamme, Laflamme, Claude
Mathematics · Computer Science · #Advanced Topology and Set Theory #Mathematical Dynamics and Fractals #Computability, Logic, AI Algorithms

paper · pdf · doi:10.48550/arxiv.math/9501209

Abstract

We characterize winning strategies in various infinite games involving filters on the natural numbers in terms of combinatorics or structural properties of the given filter. These generalize several ultrafilter games of Galvin.

Related

• On the Existence of Optimal Strategies in a Combinatorial Game
• Filters and games
• Playing Games with Algorithms: Algorithmic Combinatorial Game Theory
• Cardinals of the P_κ(λ)-Filter Games
• Combinatorial Game Theory, Well-Tempered Scoring Games, and a Knot Game