A two-person zero-sum game invented by Andrew Gleason in the early 1950’s has a very simple description and yet turns out to be quite difficult to solve. This game is a stochastic game with an information lag for both players. No strategy with a bounded memory of past moves can be optimal. Yet using the notion of generalized subgames, we show that there exist optimal strategies of a simple natu...

In the sequential decision making task known as the best choice problem, n items are presented in a random order one at a time. After each item, the decision maker can determine only their relative ranks. The goal of decision maker is to select the best of all n items without the possibility of recalling previously observed items. Many important business decisions such as choosing a venture par...

This article provides sufficient conditions for the existence of solutions two-person zero-sum games with inf/sup-compact payoff functions and possibly noncompact decision sets both players. Payoff may be unbounded, we do not assume any convexity/concavity-type conditions. For such expected exist some pairs strategies. The results this imply several classic facts. also a value each player. are ...

Game playing is one of the most important areas in AI. Chess is a very popular two-player strategy board game. In the context of AI, chess falls under the category of adversarial games where the opponent tries to reduce your chance of winning as much as possible. Being a classic example of a two-player zero sum game (sum of the utilities of agent and opponent is zero), the game of chess provide...

The area of search theory can be divided broadly on two parts, one-sided search and two-sided [7]. Thus, in this paper; we deal with a two-sided search games played by a searcher and a mobile target with a rather simple type of motion called the conditionally deterministic motion (CDM). Here, the target motion takes place on a network and, more precisely, on a set of possible paths. After a gen...