Search

We are searching for an unknown horizontal or vertical line in the plane under the competitive framework. We design a framework for lower bounds on all cyclic and monotone strategies that result in two-sequence functionals. For optimizing such functionals we apply a method that combines two main paradigms. The given solution shows that the combination method is of general interest. Finally, we obtain the current best strategy and can prove that this is the best strategy among all cyclic and monotone strategies which is a main step toward a lower bound construction. [ABSTRACT FROM AUTHOR]

Rufus Isaacs introduced Princess and Monster games in the final chapter of his classic book. The value of the Princess and Monster game on an interval is as of yet unknown. We present some numerical results to estimate this value. [ABSTRACT FROM AUTHOR]