Stochastic games - an overview -- A brief summary of the papers in the volume -- Contributed Papers -- 1 Models for the Game of Liar’s dice -- 2 A Discrete Search Game -- 3 Algorithms for Stochastic Games -- 4 On the Algorithm of Pollatschek and Avi-Itzhak -- 5 Semi-infinite Stochastic Games....

Games with Finite Resources as defined by Gale (1957) are two-person zero-sum N-stage games in which each player has N resources and may use each resource once and only once in the N stages. Gale's theorem on these games is generalized in several directions. First the payoff is allowed to be any...

This problem is in the area of minimax selection of experiments. Nature chooses a number [theta] in the closed interval [-1, 1]. The statistician chooses a number y in the same interval (an experiment) and is informed whether [theta] < y, [theta] = y, or 0> y. Based on this information, the statistician then estimates...</y,>