Physical Sciences and Mathematics Commons^™

Characterizing Compact Game Trees, Andrew Dubose

UNLV Theses, Dissertations, Professional Papers, and Capstones

It is well-known that the body of a game tree of height less than or equal to ω is compact

if and only if the tree is finitely branching. In this thesis, we develop necessary and sufficient

conditions for the body of any game tree to be compact.

A Comparison Of The Product Topology On Two Trees With The Tree Topology On The Concatenation Of Two Trees, Katlyn Kathleen Cox

UNLV Theses, Dissertations, Professional Papers, and Capstones

A game tree is a nonempty set of sequences, closed under subsequences (i.e., if p ∈ T

and p extends q, then q ∈ T). If T is a game tree, then there is a natural topology on [T],

the set of paths through T. In this study we consider two types of topological spaces, both

constructed from game trees. The first is constructed by taking the Cartesian product of

two game trees, T and S: [T] × [S]. The second is constructed by the concatenation of two

game trees, T and S: [T ∗ S]. The goal of our …