Global ETD Search
Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.
Results
Showing 1 to 9 of 9 for “"combinatorial games"”.
-
Distributionally Ambiguous Stackelberg Combinatorial Games for Submodular Optimization and Camera View-Frame Placement
… solution methodologies for Stackelberg zero-sum games, which model sequential decision-making between an attacker and a defender. Our work specifically addresses challenging settings where the defender's recourse is a complex com- binatorial optimization problem and the attacker faces uncertainty …
-
Unbounded unimodal search and pursuit problems
… lead to new complexity results on some combinatorial games. Upper and lower bounds on the time for capture are developed for the continuous Lion-Man problem.
-
Jogos combinatórios em grafos: jogo Timber e jogo de Coloração
Studies three competitive combinatorial games. The timber game is played in digraphs, with each arc representing a domino, and the arc direction indicates the direction in which it can be toppled, causing a chain reaction. The player who topples the last domino is the winner. A P-position is an …
-
Games on Graphs and Other Combinatorial Problems
In this dissertation, we consider various combinatorial problems. The four chapters after the Introduction concern games on graphs, while latter on, we make progress on some questions in the settings of Rademacher sums and graph theory. In Chapter 2, we study the $(m,b)$ Maker-Breaker percolation …
-
Nontraditional Positional Games: New methods and boards for playing Tic-Tac-Toe
… on Tic-Tac-Toe. We consider positional games played using a new type of move called a hop. A hop involves two parts: move and replace. In a hop the positions occupied by both players will change: one will move a piece to a new position and one will gain a piece in play. We play …
-
Nontraditional Positional Games: New methods and boards for playing Tic-Tac-Toe
… on Tic-Tac-Toe. We consider positional games played using a new type of move called a hop. A hop involves two parts: move and replace. In a hop the positions occupied by both players will change: one will move a piece to a new position and one will gain a piece in play. We play …
-
Peg Solitaire on Trees with Diameter Four
… of peg solitaire is generalized to graphs in the combinatorial sense. One of the important open problems in this paper was to classify solvable trees. In this thesis, we will give necessary and sufficient conditions for the solvability for all trees with diameter four. We also give the maximum …
-
Games on graphs, visibility representations, and graph colorings
"In this thesis we study combinatorial games on graphs and some graph parameters whose consideration was inspired by an interest in the symmetry of hypercubes. A capacity function f on a graph G assigns a nonnegative integer to each vertex of V(G). An f-matching in G is a set M ⊆ E(G) such that the …
-
Topics in Probabilistic Combinatorics
… and eight chapters, each devoted to a different combinatorial problem. In Chapter 2, we study problems regarding reconstructing the entirety, or a large subset, of a point set $V$ embedded in either $\mathbb{R}$ or $\mathbb{R}^d$, where the only information available about $V$ consists of the …